About the Execution of GreatSPN+red for MedleyA-PT-17
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3131.903 | 1240624.00 | 1534745.00 | 3266.20 | TTFFFFFFFFFFFFFF | 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.r575-smll-171734919700132.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 MedleyA-PT-17, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919700132
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 175K Jun 2 16:33 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 MedleyA-PT-17-LTLFireability-00
FORMULA_NAME MedleyA-PT-17-LTLFireability-01
FORMULA_NAME MedleyA-PT-17-LTLFireability-02
FORMULA_NAME MedleyA-PT-17-LTLFireability-03
FORMULA_NAME MedleyA-PT-17-LTLFireability-04
FORMULA_NAME MedleyA-PT-17-LTLFireability-05
FORMULA_NAME MedleyA-PT-17-LTLFireability-06
FORMULA_NAME MedleyA-PT-17-LTLFireability-07
FORMULA_NAME MedleyA-PT-17-LTLFireability-08
FORMULA_NAME MedleyA-PT-17-LTLFireability-09
FORMULA_NAME MedleyA-PT-17-LTLFireability-10
FORMULA_NAME MedleyA-PT-17-LTLFireability-11
FORMULA_NAME MedleyA-PT-17-LTLFireability-12
FORMULA_NAME MedleyA-PT-17-LTLFireability-13
FORMULA_NAME MedleyA-PT-17-LTLFireability-14
FORMULA_NAME MedleyA-PT-17-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717367223493
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:27:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 22:27:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:27:05] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2024-06-02 22:27:05] [INFO ] Transformed 248 places.
[2024-06-02 22:27:05] [INFO ] Transformed 591 transitions.
[2024-06-02 22:27:05] [INFO ] Found NUPN structural information;
[2024-06-02 22:27:05] [INFO ] Parsed PT model containing 248 places and 591 transitions and 2764 arcs in 348 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-17-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 589/589 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 199 transition count 509
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 199 transition count 509
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 132 place count 199 transition count 475
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 134 place count 197 transition count 471
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 197 transition count 471
Applied a total of 136 rules in 101 ms. Remains 197 /248 variables (removed 51) and now considering 471/589 (removed 118) transitions.
// Phase 1: matrix 471 rows 197 cols
[2024-06-02 22:27:06] [INFO ] Computed 7 invariants in 37 ms
[2024-06-02 22:27:06] [INFO ] Implicit Places using invariants in 466 ms returned []
[2024-06-02 22:27:06] [INFO ] Invariant cache hit.
[2024-06-02 22:27:07] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 986 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2024-06-02 22:27:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-06-02 22:27:13] [INFO ] Deduced a trap composed of 15 places in 276 ms of which 26 ms to minimize.
[2024-06-02 22:27:13] [INFO ] Deduced a trap composed of 17 places in 203 ms of which 2 ms to minimize.
[2024-06-02 22:27:13] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 3 ms to minimize.
[2024-06-02 22:27:13] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 3 ms to minimize.
[2024-06-02 22:27:14] [INFO ] Deduced a trap composed of 114 places in 186 ms of which 3 ms to minimize.
[2024-06-02 22:27:14] [INFO ] Deduced a trap composed of 39 places in 183 ms of which 2 ms to minimize.
[2024-06-02 22:27:14] [INFO ] Deduced a trap composed of 45 places in 214 ms of which 12 ms to minimize.
[2024-06-02 22:27:14] [INFO ] Deduced a trap composed of 95 places in 158 ms of which 3 ms to minimize.
[2024-06-02 22:27:14] [INFO ] Deduced a trap composed of 114 places in 201 ms of which 3 ms to minimize.
[2024-06-02 22:27:15] [INFO ] Deduced a trap composed of 115 places in 243 ms of which 3 ms to minimize.
[2024-06-02 22:27:15] [INFO ] Deduced a trap composed of 114 places in 235 ms of which 2 ms to minimize.
[2024-06-02 22:27:15] [INFO ] Deduced a trap composed of 88 places in 164 ms of which 2 ms to minimize.
[2024-06-02 22:27:15] [INFO ] Deduced a trap composed of 114 places in 172 ms of which 2 ms to minimize.
[2024-06-02 22:27:16] [INFO ] Deduced a trap composed of 39 places in 167 ms of which 3 ms to minimize.
[2024-06-02 22:27:17] [INFO ] Deduced a trap composed of 122 places in 207 ms of which 3 ms to minimize.
[2024-06-02 22:27:17] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 2 ms to minimize.
[2024-06-02 22:27:17] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 2 ms to minimize.
[2024-06-02 22:27:17] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 2 ms to minimize.
[2024-06-02 22:27:17] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 2 ms to minimize.
[2024-06-02 22:27:17] [INFO ] Deduced a trap composed of 25 places in 186 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-06-02 22:27:18] [INFO ] Deduced a trap composed of 25 places in 224 ms of which 3 ms to minimize.
[2024-06-02 22:27:18] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 3 ms to minimize.
[2024-06-02 22:27:18] [INFO ] Deduced a trap composed of 22 places in 207 ms of which 3 ms to minimize.
[2024-06-02 22:27:19] [INFO ] Deduced a trap composed of 26 places in 198 ms of which 2 ms to minimize.
[2024-06-02 22:27:19] [INFO ] Deduced a trap composed of 25 places in 187 ms of which 2 ms to minimize.
[2024-06-02 22:27:19] [INFO ] Deduced a trap composed of 24 places in 196 ms of which 2 ms to minimize.
[2024-06-02 22:27:20] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 3 ms to minimize.
[2024-06-02 22:27:20] [INFO ] Deduced a trap composed of 21 places in 227 ms of which 3 ms to minimize.
[2024-06-02 22:27:21] [INFO ] Deduced a trap composed of 37 places in 197 ms of which 3 ms to minimize.
[2024-06-02 22:27:21] [INFO ] Deduced a trap composed of 24 places in 218 ms of which 3 ms to minimize.
[2024-06-02 22:27:21] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 2 ms to minimize.
[2024-06-02 22:27:21] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 2 ms to minimize.
[2024-06-02 22:27:21] [INFO ] Deduced a trap composed of 26 places in 203 ms of which 2 ms to minimize.
[2024-06-02 22:27:22] [INFO ] Deduced a trap composed of 44 places in 162 ms of which 3 ms to minimize.
[2024-06-02 22:27:22] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 3 ms to minimize.
[2024-06-02 22:27:22] [INFO ] Deduced a trap composed of 39 places in 185 ms of which 3 ms to minimize.
[2024-06-02 22:27:22] [INFO ] Deduced a trap composed of 24 places in 174 ms of which 3 ms to minimize.
[2024-06-02 22:27:23] [INFO ] Deduced a trap composed of 117 places in 164 ms of which 2 ms to minimize.
[2024-06-02 22:27:23] [INFO ] Deduced a trap composed of 47 places in 159 ms of which 2 ms to minimize.
[2024-06-02 22:27:23] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-06-02 22:27:27] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 2 ms to minimize.
[2024-06-02 22:27:27] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 2 ms to minimize.
[2024-06-02 22:27:27] [INFO ] Deduced a trap composed of 49 places in 193 ms of which 5 ms to minimize.
[2024-06-02 22:27:27] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 3 ms to minimize.
[2024-06-02 22:27:28] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 3 ms to minimize.
[2024-06-02 22:27:28] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 2 ms to minimize.
[2024-06-02 22:27:28] [INFO ] Deduced a trap composed of 22 places in 195 ms of which 4 ms to minimize.
[2024-06-02 22:27:29] [INFO ] Deduced a trap composed of 45 places in 130 ms of which 2 ms to minimize.
[2024-06-02 22:27:29] [INFO ] Deduced a trap composed of 44 places in 146 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-06-02 22:27:31] [INFO ] Deduced a trap composed of 118 places in 190 ms of which 2 ms to minimize.
[2024-06-02 22:27:32] [INFO ] Deduced a trap composed of 133 places in 154 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-06-02 22:27:35] [INFO ] Deduced a trap composed of 58 places in 142 ms of which 2 ms to minimize.
[2024-06-02 22:27:35] [INFO ] Deduced a trap composed of 52 places in 177 ms of which 2 ms to minimize.
[2024-06-02 22:27:36] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 3 ms to minimize.
[2024-06-02 22:27:36] [INFO ] Deduced a trap composed of 34 places in 195 ms of which 3 ms to minimize.
[2024-06-02 22:27:36] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 2 ms to minimize.
[2024-06-02 22:27:36] [INFO ] Deduced a trap composed of 25 places in 172 ms of which 4 ms to minimize.
[2024-06-02 22:27:37] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 197/668 variables, and 65 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/197 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 0 solved, 470 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 58/65 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-06-02 22:27:41] [INFO ] Deduced a trap composed of 38 places in 152 ms of which 2 ms to minimize.
[2024-06-02 22:27:42] [INFO ] Deduced a trap composed of 118 places in 171 ms of which 2 ms to minimize.
[2024-06-02 22:27:42] [INFO ] Deduced a trap composed of 123 places in 177 ms of which 2 ms to minimize.
[2024-06-02 22:27:42] [INFO ] Deduced a trap composed of 42 places in 183 ms of which 2 ms to minimize.
[2024-06-02 22:27:42] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 2 ms to minimize.
[2024-06-02 22:27:43] [INFO ] Deduced a trap composed of 24 places in 177 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-06-02 22:27:45] [INFO ] Deduced a trap composed of 134 places in 147 ms of which 3 ms to minimize.
[2024-06-02 22:27:45] [INFO ] Deduced a trap composed of 132 places in 129 ms of which 2 ms to minimize.
[2024-06-02 22:27:45] [INFO ] Deduced a trap composed of 135 places in 159 ms of which 2 ms to minimize.
[2024-06-02 22:27:46] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-06-02 22:27:50] [INFO ] Deduced a trap composed of 26 places in 185 ms of which 2 ms to minimize.
[2024-06-02 22:27:50] [INFO ] Deduced a trap composed of 25 places in 181 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-06-02 22:27:53] [INFO ] Deduced a trap composed of 133 places in 133 ms of which 2 ms to minimize.
[2024-06-02 22:27:54] [INFO ] Deduced a trap composed of 106 places in 188 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-06-02 22:27:57] [INFO ] Deduced a trap composed of 126 places in 155 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
At refinement iteration 9 (OVERLAPS) 471/668 variables, 197/277 constraints. Problems are: Problem set: 50 solved, 420 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/668 variables, 420/697 constraints. Problems are: Problem set: 50 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 668/668 variables, and 697 constraints, problems are : Problem set: 50 solved, 420 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 420/470 constraints, Known Traps: 73/73 constraints]
After SMT, in 60767ms problems are : Problem set: 50 solved, 420 unsolved
Search for dead transitions found 50 dead transitions in 60806ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 197/248 places, 421/589 transitions.
Applied a total of 0 rules in 12 ms. Remains 197 /197 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61943 ms. Remains : 197/248 places, 421/589 transitions.
Support contains 43 out of 197 places after structural reductions.
[2024-06-02 22:28:08] [INFO ] Flatten gal took : 115 ms
[2024-06-02 22:28:08] [INFO ] Flatten gal took : 56 ms
[2024-06-02 22:28:08] [INFO ] Input system was already deterministic with 421 transitions.
Support contains 39 out of 197 places (down from 43) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 25 to 23
RANDOM walk for 40000 steps (1376 resets) in 3908 ms. (10 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (28 resets) in 60 ms. (65 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (29 resets) in 50 ms. (78 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (29 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (30 resets) in 34 ms. (114 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (28 resets) in 53 ms. (74 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (28 resets) in 49 ms. (80 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (28 resets) in 41 ms. (95 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (28 resets) in 43 ms. (91 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (28 resets) in 45 ms. (87 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (28 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (29 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (28 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (29 resets) in 36 ms. (108 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (27 resets) in 40 ms. (97 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (29 resets) in 27 ms. (142 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (27 resets) in 37 ms. (105 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (28 resets) in 33 ms. (117 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (28 resets) in 38 ms. (102 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (29 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (28 resets) in 27 ms. (143 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (28 resets) in 40 ms. (97 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (29 resets) in 35 ms. (111 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (29 resets) in 48 ms. (81 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 376727 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :10 out of 23
Probabilistic random walk after 376727 steps, saw 69254 distinct states, run finished after 3017 ms. (steps per millisecond=124 ) properties seen :10
// Phase 1: matrix 421 rows 197 cols
[2024-06-02 22:28:13] [INFO ] Computed 7 invariants in 4 ms
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
Problem AtomicPropp8 is UNSAT
At refinement iteration 1 (OVERLAPS) 172/197 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-02 22:28:13] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
[2024-06-02 22:28:13] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 2 ms to minimize.
[2024-06-02 22:28:13] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:28:14] [INFO ] Deduced a trap composed of 38 places in 154 ms of which 3 ms to minimize.
[2024-06-02 22:28:14] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 5/12 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-02 22:28:14] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-02 22:28:14] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 3 ms to minimize.
[2024-06-02 22:28:14] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 2/15 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 421/618 variables, 197/212 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/618 variables, 0/212 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/618 variables, 0/212 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 618/618 variables, and 212 constraints, problems are : Problem set: 1 solved, 12 unsolved in 2022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 1 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 172/197 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 8/15 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-02 22:28:15] [INFO ] Deduced a trap composed of 55 places in 163 ms of which 2 ms to minimize.
[2024-06-02 22:28:15] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 2 ms to minimize.
Problem AtomicPropp0 is UNSAT
[2024-06-02 22:28:15] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 2 ms to minimize.
[2024-06-02 22:28:16] [INFO ] Deduced a trap composed of 26 places in 173 ms of which 3 ms to minimize.
[2024-06-02 22:28:16] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 3 ms to minimize.
[2024-06-02 22:28:16] [INFO ] Deduced a trap composed of 36 places in 169 ms of which 2 ms to minimize.
[2024-06-02 22:28:16] [INFO ] Deduced a trap composed of 39 places in 166 ms of which 3 ms to minimize.
[2024-06-02 22:28:16] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 3 ms to minimize.
[2024-06-02 22:28:16] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 9/24 constraints. Problems are: Problem set: 2 solved, 11 unsolved
[2024-06-02 22:28:17] [INFO ] Deduced a trap composed of 38 places in 158 ms of which 2 ms to minimize.
[2024-06-02 22:28:17] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 2/26 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/26 constraints. Problems are: Problem set: 2 solved, 11 unsolved
Problem AtomicPropp17 is UNSAT
At refinement iteration 6 (OVERLAPS) 421/618 variables, 197/223 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/618 variables, 10/233 constraints. Problems are: Problem set: 3 solved, 10 unsolved
[2024-06-02 22:28:18] [INFO ] Deduced a trap composed of 105 places in 150 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/618 variables, 1/234 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 618/618 variables, and 234 constraints, problems are : Problem set: 3 solved, 10 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 10/13 constraints, Known Traps: 20/20 constraints]
After SMT, in 7081ms problems are : Problem set: 3 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 421/421 transitions.
Graph (trivial) has 144 edges and 197 vertex of which 6 / 197 are part of one of the 2 SCC in 6 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 193 transition count 390
Reduce places removed 25 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 53 place count 168 transition count 388
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 166 transition count 388
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 55 place count 166 transition count 373
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 85 place count 151 transition count 373
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 89 place count 147 transition count 365
Iterating global reduction 3 with 4 rules applied. Total rules applied 93 place count 147 transition count 365
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 94 place count 146 transition count 357
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 146 transition count 357
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 137 place count 125 transition count 336
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 153 place count 117 transition count 376
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 3 with 22 rules applied. Total rules applied 175 place count 117 transition count 354
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 181 place count 114 transition count 351
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 193 place count 108 transition count 396
Free-agglomeration rule applied 26 times.
Iterating global reduction 3 with 26 rules applied. Total rules applied 219 place count 108 transition count 370
Reduce places removed 26 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 46 rules applied. Total rules applied 265 place count 82 transition count 350
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 270 place count 82 transition count 345
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 275 place count 82 transition count 352
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 288 place count 77 transition count 344
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 289 place count 76 transition count 343
Applied a total of 289 rules in 221 ms. Remains 76 /197 variables (removed 121) and now considering 343/421 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 222 ms. Remains : 76/197 places, 343/421 transitions.
RANDOM walk for 40000 steps (6250 resets) in 1051 ms. (38 steps per ms) remains 5/10 properties
BEST_FIRST walk for 40003 steps (20 resets) in 124 ms. (320 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (2027 resets) in 193 ms. (206 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1973 resets) in 107 ms. (370 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (16 resets) in 182 ms. (218 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1945 resets) in 80 ms. (493 steps per ms) remains 5/5 properties
[2024-06-02 22:28:21] [INFO ] Flow matrix only has 293 transitions (discarded 50 similar events)
// Phase 1: matrix 293 rows 76 cols
[2024-06-02 22:28:21] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 22:28:21] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 64/76 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 22:28:21] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 293/369 variables, 76/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 37/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/369 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 121 constraints, problems are : Problem set: 0 solved, 5 unsolved in 434 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 76/76 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 64/76 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 293/369 variables, 76/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 37/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 5/126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 22:28:22] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 1 ms to minimize.
[2024-06-02 22:28:22] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:28:22] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 3/129 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/369 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 129 constraints, problems are : Problem set: 0 solved, 5 unsolved in 841 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 76/76 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 4/4 constraints]
After SMT, in 1306ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 1 properties in 3811 ms.
Support contains 10 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 343/343 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 76 transition count 342
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 75 transition count 342
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 74 transition count 341
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 71 transition count 366
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 71 transition count 364
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 70 transition count 352
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 70 transition count 352
Free-agglomeration rule applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 21 place count 70 transition count 345
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 28 place count 63 transition count 345
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 63 transition count 359
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 62 transition count 359
Applied a total of 30 rules in 54 ms. Remains 62 /76 variables (removed 14) and now considering 359/343 (removed -16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 62/76 places, 359/343 transitions.
RANDOM walk for 40000 steps (21 resets) in 296 ms. (134 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (13 resets) in 281 ms. (141 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (16 resets) in 288 ms. (138 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 333 ms. (119 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 373 ms. (106 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 41626 steps, run visited all 4 properties in 121 ms. (steps per millisecond=344 )
Probabilistic random walk after 41626 steps, saw 10787 distinct states, run finished after 126 ms. (steps per millisecond=330 ) properties seen :4
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-17-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 16 stabilizing places and 16 stable transitions
FORMULA MedleyA-PT-17-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 421/421 transitions.
Graph (trivial) has 197 edges and 197 vertex of which 9 / 197 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 190 transition count 389
Reduce places removed 25 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 53 place count 165 transition count 387
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 163 transition count 387
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 55 place count 163 transition count 372
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 85 place count 148 transition count 372
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 93 place count 140 transition count 357
Iterating global reduction 3 with 8 rules applied. Total rules applied 101 place count 140 transition count 357
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 102 place count 139 transition count 349
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 139 transition count 349
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 149 place count 116 transition count 326
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 150 place count 115 transition count 320
Iterating global reduction 3 with 1 rules applied. Total rules applied 151 place count 115 transition count 320
Performed 27 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 205 place count 88 transition count 442
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 209 place count 88 transition count 438
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 211 place count 86 transition count 422
Iterating global reduction 4 with 2 rules applied. Total rules applied 213 place count 86 transition count 422
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 221 place count 86 transition count 414
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 5 with 31 rules applied. Total rules applied 252 place count 86 transition count 383
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 258 place count 83 transition count 380
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 260 place count 82 transition count 392
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 261 place count 81 transition count 391
Applied a total of 261 rules in 120 ms. Remains 81 /197 variables (removed 116) and now considering 391/421 (removed 30) transitions.
[2024-06-02 22:28:27] [INFO ] Flow matrix only has 353 transitions (discarded 38 similar events)
// Phase 1: matrix 353 rows 81 cols
[2024-06-02 22:28:27] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:28:27] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-02 22:28:27] [INFO ] Flow matrix only has 353 transitions (discarded 38 similar events)
[2024-06-02 22:28:27] [INFO ] Invariant cache hit.
[2024-06-02 22:28:28] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-06-02 22:28:28] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
[2024-06-02 22:28:28] [INFO ] Redundant transitions in 27 ms returned []
Running 382 sub problems to find dead transitions.
[2024-06-02 22:28:28] [INFO ] Flow matrix only has 353 transitions (discarded 38 similar events)
[2024-06-02 22:28:28] [INFO ] Invariant cache hit.
[2024-06-02 22:28:28] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-06-02 22:28:30] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 2 ms to minimize.
[2024-06-02 22:28:30] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:28:30] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:28:30] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 2 ms to minimize.
[2024-06-02 22:28:30] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 1 ms to minimize.
[2024-06-02 22:28:30] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:28:30] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:28:30] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:28:30] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 2 ms to minimize.
[2024-06-02 22:28:31] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 1 ms to minimize.
[2024-06-02 22:28:31] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:28:31] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
[2024-06-02 22:28:31] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-06-02 22:28:31] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 1 ms to minimize.
[2024-06-02 22:28:31] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2024-06-02 22:28:31] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 1 ms to minimize.
[2024-06-02 22:28:32] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 2 ms to minimize.
[2024-06-02 22:28:32] [INFO ] Deduced a trap composed of 22 places in 253 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-06-02 22:28:33] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 2 ms to minimize.
[2024-06-02 22:28:33] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-06-02 22:28:35] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2024-06-02 22:28:35] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 5 (OVERLAPS) 352/433 variables, 81/110 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 72/182 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 8 (OVERLAPS) 1/434 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 10 (OVERLAPS) 0/434 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 382 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 183 constraints, problems are : Problem set: 0 solved, 382 unsolved in 25001 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 81/81 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (OVERLAPS) 352/433 variables, 81/110 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 72/182 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 382/564 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 7 (OVERLAPS) 1/434 variables, 1/565 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/434 variables, and 565 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 81/81 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 22/22 constraints]
After SMT, in 55472ms problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 55478ms
Starting structural reductions in SI_LTL mode, iteration 1 : 81/197 places, 391/421 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56162 ms. Remains : 81/197 places, 391/421 transitions.
Stuttering acceptance computed with spot in 245 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-03
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-17-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLFireability-03 finished in 56500 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)||F(G((X(p1) U p2)))))'
Support contains 10 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 421/421 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 190 transition count 408
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 190 transition count 408
Applied a total of 14 rules in 6 ms. Remains 190 /197 variables (removed 7) and now considering 408/421 (removed 13) transitions.
// Phase 1: matrix 408 rows 190 cols
[2024-06-02 22:29:24] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 22:29:24] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-02 22:29:24] [INFO ] Invariant cache hit.
[2024-06-02 22:29:24] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
Running 407 sub problems to find dead transitions.
[2024-06-02 22:29:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 22:29:28] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 3 ms to minimize.
[2024-06-02 22:29:28] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-06-02 22:29:28] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-06-02 22:29:29] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 2 ms to minimize.
[2024-06-02 22:29:29] [INFO ] Deduced a trap composed of 45 places in 161 ms of which 3 ms to minimize.
[2024-06-02 22:29:29] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 3 ms to minimize.
[2024-06-02 22:29:29] [INFO ] Deduced a trap composed of 96 places in 138 ms of which 2 ms to minimize.
[2024-06-02 22:29:29] [INFO ] Deduced a trap composed of 53 places in 130 ms of which 2 ms to minimize.
[2024-06-02 22:29:29] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 2 ms to minimize.
[2024-06-02 22:29:30] [INFO ] Deduced a trap composed of 47 places in 139 ms of which 2 ms to minimize.
[2024-06-02 22:29:30] [INFO ] Deduced a trap composed of 90 places in 136 ms of which 2 ms to minimize.
[2024-06-02 22:29:30] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 3 ms to minimize.
[2024-06-02 22:29:31] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 2 ms to minimize.
[2024-06-02 22:29:31] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 2 ms to minimize.
[2024-06-02 22:29:31] [INFO ] Deduced a trap composed of 21 places in 162 ms of which 2 ms to minimize.
[2024-06-02 22:29:31] [INFO ] Deduced a trap composed of 90 places in 138 ms of which 2 ms to minimize.
[2024-06-02 22:29:31] [INFO ] Deduced a trap composed of 112 places in 136 ms of which 3 ms to minimize.
[2024-06-02 22:29:31] [INFO ] Deduced a trap composed of 117 places in 147 ms of which 2 ms to minimize.
[2024-06-02 22:29:32] [INFO ] Deduced a trap composed of 50 places in 133 ms of which 3 ms to minimize.
[2024-06-02 22:29:32] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 22:29:32] [INFO ] Deduced a trap composed of 112 places in 131 ms of which 2 ms to minimize.
[2024-06-02 22:29:32] [INFO ] Deduced a trap composed of 111 places in 108 ms of which 2 ms to minimize.
[2024-06-02 22:29:32] [INFO ] Deduced a trap composed of 111 places in 145 ms of which 3 ms to minimize.
[2024-06-02 22:29:33] [INFO ] Deduced a trap composed of 111 places in 153 ms of which 3 ms to minimize.
[2024-06-02 22:29:33] [INFO ] Deduced a trap composed of 113 places in 152 ms of which 2 ms to minimize.
[2024-06-02 22:29:33] [INFO ] Deduced a trap composed of 113 places in 143 ms of which 3 ms to minimize.
[2024-06-02 22:29:33] [INFO ] Deduced a trap composed of 122 places in 146 ms of which 3 ms to minimize.
[2024-06-02 22:29:33] [INFO ] Deduced a trap composed of 115 places in 140 ms of which 2 ms to minimize.
[2024-06-02 22:29:33] [INFO ] Deduced a trap composed of 115 places in 140 ms of which 2 ms to minimize.
[2024-06-02 22:29:34] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 3 ms to minimize.
[2024-06-02 22:29:34] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 2 ms to minimize.
[2024-06-02 22:29:35] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 3 ms to minimize.
[2024-06-02 22:29:35] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 2 ms to minimize.
[2024-06-02 22:29:35] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 3 ms to minimize.
[2024-06-02 22:29:35] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 3 ms to minimize.
[2024-06-02 22:29:35] [INFO ] Deduced a trap composed of 36 places in 147 ms of which 2 ms to minimize.
[2024-06-02 22:29:35] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 3 ms to minimize.
[2024-06-02 22:29:36] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 3 ms to minimize.
[2024-06-02 22:29:36] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 2 ms to minimize.
[2024-06-02 22:29:36] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 22:29:38] [INFO ] Deduced a trap composed of 112 places in 150 ms of which 3 ms to minimize.
[2024-06-02 22:29:39] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 2 ms to minimize.
[2024-06-02 22:29:39] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 2 ms to minimize.
[2024-06-02 22:29:39] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 2 ms to minimize.
[2024-06-02 22:29:40] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 3 ms to minimize.
[2024-06-02 22:29:40] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 3 ms to minimize.
[2024-06-02 22:29:40] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 2 ms to minimize.
[2024-06-02 22:29:40] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 3 ms to minimize.
[2024-06-02 22:29:40] [INFO ] Deduced a trap composed of 29 places in 133 ms of which 3 ms to minimize.
[2024-06-02 22:29:40] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 3 ms to minimize.
[2024-06-02 22:29:40] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 2 ms to minimize.
[2024-06-02 22:29:41] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 2 ms to minimize.
[2024-06-02 22:29:41] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 2 ms to minimize.
[2024-06-02 22:29:41] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 3 ms to minimize.
[2024-06-02 22:29:41] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 3 ms to minimize.
[2024-06-02 22:29:41] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 2 ms to minimize.
[2024-06-02 22:29:42] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 3 ms to minimize.
[2024-06-02 22:29:42] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 2 ms to minimize.
[2024-06-02 22:29:42] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 2 ms to minimize.
[2024-06-02 22:29:42] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 22:29:43] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 2 ms to minimize.
[2024-06-02 22:29:44] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 1 ms to minimize.
[2024-06-02 22:29:44] [INFO ] Deduced a trap composed of 29 places in 148 ms of which 3 ms to minimize.
[2024-06-02 22:29:44] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 3 ms to minimize.
[2024-06-02 22:29:44] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 2 ms to minimize.
[2024-06-02 22:29:44] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 1 ms to minimize.
[2024-06-02 22:29:44] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 2 ms to minimize.
[2024-06-02 22:29:45] [INFO ] Deduced a trap composed of 125 places in 132 ms of which 2 ms to minimize.
[2024-06-02 22:29:45] [INFO ] Deduced a trap composed of 51 places in 137 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 9/76 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 22:29:47] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 2 ms to minimize.
[2024-06-02 22:29:47] [INFO ] Deduced a trap composed of 130 places in 127 ms of which 2 ms to minimize.
[2024-06-02 22:29:48] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 22:29:52] [INFO ] Deduced a trap composed of 115 places in 148 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/598 variables, and 80 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/190 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 73/73 constraints]
Escalating to Integer solving :Problem set: 0 solved, 407 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 73/80 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 22:29:58] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 2 ms to minimize.
[2024-06-02 22:29:58] [INFO ] Deduced a trap composed of 38 places in 152 ms of which 2 ms to minimize.
[2024-06-02 22:29:58] [INFO ] Deduced a trap composed of 58 places in 134 ms of which 3 ms to minimize.
[2024-06-02 22:29:59] [INFO ] Deduced a trap composed of 46 places in 121 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 22:30:01] [INFO ] Deduced a trap composed of 52 places in 142 ms of which 2 ms to minimize.
[2024-06-02 22:30:01] [INFO ] Deduced a trap composed of 40 places in 161 ms of which 3 ms to minimize.
[2024-06-02 22:30:01] [INFO ] Deduced a trap composed of 36 places in 161 ms of which 2 ms to minimize.
[2024-06-02 22:30:02] [INFO ] Deduced a trap composed of 34 places in 155 ms of which 2 ms to minimize.
[2024-06-02 22:30:02] [INFO ] Deduced a trap composed of 44 places in 157 ms of which 3 ms to minimize.
[2024-06-02 22:30:02] [INFO ] Deduced a trap composed of 34 places in 147 ms of which 3 ms to minimize.
[2024-06-02 22:30:02] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 7/91 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 22:30:05] [INFO ] Deduced a trap composed of 54 places in 132 ms of which 2 ms to minimize.
[2024-06-02 22:30:05] [INFO ] Deduced a trap composed of 51 places in 153 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 7 (OVERLAPS) 408/598 variables, 190/283 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/598 variables, 407/690 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/598 variables, and 690 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 86/86 constraints]
After SMT, in 60266ms problems are : Problem set: 0 solved, 407 unsolved
Search for dead transitions found 0 dead transitions in 60271ms
Starting structural reductions in LTL mode, iteration 1 : 190/197 places, 408/421 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60807 ms. Remains : 190/197 places, 408/421 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-05
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-17-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLFireability-05 finished in 60954 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U (p1||G(!p0))) U (F(p2) U p3)))'
Support contains 7 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 421/421 transitions.
Graph (trivial) has 175 edges and 197 vertex of which 6 / 197 are part of one of the 2 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 192 transition count 389
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 165 transition count 389
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 55 place count 165 transition count 372
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 89 place count 148 transition count 372
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 95 place count 142 transition count 361
Iterating global reduction 2 with 6 rules applied. Total rules applied 101 place count 142 transition count 361
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 141 transition count 353
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 141 transition count 353
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 149 place count 118 transition count 330
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 150 place count 118 transition count 329
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 151 place count 117 transition count 323
Iterating global reduction 3 with 1 rules applied. Total rules applied 152 place count 117 transition count 323
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 182 place count 102 transition count 398
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 184 place count 102 transition count 396
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 186 place count 101 transition count 415
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 4 with 29 rules applied. Total rules applied 215 place count 101 transition count 386
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 221 place count 98 transition count 383
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 225 place count 96 transition count 394
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 226 place count 95 transition count 393
Applied a total of 226 rules in 83 ms. Remains 95 /197 variables (removed 102) and now considering 393/421 (removed 28) transitions.
[2024-06-02 22:30:25] [INFO ] Flow matrix only has 371 transitions (discarded 22 similar events)
// Phase 1: matrix 371 rows 95 cols
[2024-06-02 22:30:25] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 22:30:25] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-02 22:30:25] [INFO ] Flow matrix only has 371 transitions (discarded 22 similar events)
[2024-06-02 22:30:25] [INFO ] Invariant cache hit.
[2024-06-02 22:30:25] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-02 22:30:25] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2024-06-02 22:30:25] [INFO ] Redundant transitions in 8 ms returned []
Running 384 sub problems to find dead transitions.
[2024-06-02 22:30:25] [INFO ] Flow matrix only has 371 transitions (discarded 22 similar events)
[2024-06-02 22:30:25] [INFO ] Invariant cache hit.
[2024-06-02 22:30:25] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-06-02 22:30:27] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 1 ms to minimize.
[2024-06-02 22:30:27] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 1 ms to minimize.
[2024-06-02 22:30:27] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2024-06-02 22:30:27] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 1 ms to minimize.
[2024-06-02 22:30:27] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-06-02 22:30:27] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-02 22:30:27] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 1 ms to minimize.
[2024-06-02 22:30:28] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 1 ms to minimize.
[2024-06-02 22:30:28] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-06-02 22:30:28] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 2 ms to minimize.
[2024-06-02 22:30:28] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:30:28] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 1 ms to minimize.
[2024-06-02 22:30:28] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2024-06-02 22:30:28] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 2 ms to minimize.
[2024-06-02 22:30:29] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:30:29] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2024-06-02 22:30:29] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-06-02 22:30:29] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2024-06-02 22:30:29] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-06-02 22:30:29] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-06-02 22:30:31] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 2 ms to minimize.
[2024-06-02 22:30:31] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-06-02 22:30:31] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-06-02 22:30:32] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 5 (OVERLAPS) 370/465 variables, 95/126 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 13/139 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/465 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 8 (OVERLAPS) 1/466 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/466 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 10 (OVERLAPS) 0/466 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 384 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/466 variables, and 140 constraints, problems are : Problem set: 0 solved, 384 unsolved in 23271 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 384/384 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 384 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 3 (OVERLAPS) 370/465 variables, 95/126 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 13/139 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 384/523 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 465/466 variables, and 523 constraints, problems are : Problem set: 0 solved, 384 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 13/14 constraints, PredecessorRefiner: 384/384 constraints, Known Traps: 24/24 constraints]
After SMT, in 53673ms problems are : Problem set: 0 solved, 384 unsolved
Search for dead transitions found 0 dead transitions in 53679ms
Starting structural reductions in SI_LTL mode, iteration 1 : 95/197 places, 393/421 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54170 ms. Remains : 95/197 places, 393/421 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p3), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-07
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-17-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLFireability-07 finished in 54396 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 5 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 421/421 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 189 transition count 406
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 189 transition count 406
Applied a total of 16 rules in 4 ms. Remains 189 /197 variables (removed 8) and now considering 406/421 (removed 15) transitions.
// Phase 1: matrix 406 rows 189 cols
[2024-06-02 22:31:19] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 22:31:19] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-02 22:31:19] [INFO ] Invariant cache hit.
[2024-06-02 22:31:19] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
Running 405 sub problems to find dead transitions.
[2024-06-02 22:31:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 405 unsolved
[2024-06-02 22:31:23] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 2 ms to minimize.
[2024-06-02 22:31:23] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-06-02 22:31:24] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-06-02 22:31:24] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-02 22:31:24] [INFO ] Deduced a trap composed of 112 places in 144 ms of which 3 ms to minimize.
[2024-06-02 22:31:24] [INFO ] Deduced a trap composed of 111 places in 114 ms of which 2 ms to minimize.
[2024-06-02 22:31:24] [INFO ] Deduced a trap composed of 47 places in 145 ms of which 2 ms to minimize.
[2024-06-02 22:31:24] [INFO ] Deduced a trap composed of 111 places in 119 ms of which 2 ms to minimize.
[2024-06-02 22:31:24] [INFO ] Deduced a trap composed of 45 places in 146 ms of which 2 ms to minimize.
[2024-06-02 22:31:24] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 2 ms to minimize.
[2024-06-02 22:31:25] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 2 ms to minimize.
[2024-06-02 22:31:25] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 2 ms to minimize.
[2024-06-02 22:31:25] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 3 ms to minimize.
[2024-06-02 22:31:26] [INFO ] Deduced a trap composed of 21 places in 247 ms of which 4 ms to minimize.
[2024-06-02 22:31:26] [INFO ] Deduced a trap composed of 24 places in 327 ms of which 4 ms to minimize.
[2024-06-02 22:31:26] [INFO ] Deduced a trap composed of 33 places in 157 ms of which 2 ms to minimize.
[2024-06-02 22:31:26] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 3 ms to minimize.
[2024-06-02 22:31:27] [INFO ] Deduced a trap composed of 47 places in 256 ms of which 4 ms to minimize.
[2024-06-02 22:31:27] [INFO ] Deduced a trap composed of 111 places in 249 ms of which 5 ms to minimize.
[2024-06-02 22:31:27] [INFO ] Deduced a trap composed of 24 places in 312 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 405 unsolved
[2024-06-02 22:31:28] [INFO ] Deduced a trap composed of 32 places in 306 ms of which 4 ms to minimize.
[2024-06-02 22:31:28] [INFO ] Deduced a trap composed of 121 places in 156 ms of which 3 ms to minimize.
[2024-06-02 22:31:28] [INFO ] Deduced a trap composed of 113 places in 142 ms of which 3 ms to minimize.
[2024-06-02 22:31:29] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 3 ms to minimize.
[2024-06-02 22:31:29] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 2 ms to minimize.
[2024-06-02 22:31:29] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 3 ms to minimize.
[2024-06-02 22:31:29] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 3 ms to minimize.
[2024-06-02 22:31:29] [INFO ] Deduced a trap composed of 28 places in 197 ms of which 2 ms to minimize.
[2024-06-02 22:31:29] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 3 ms to minimize.
[2024-06-02 22:31:30] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 2 ms to minimize.
[2024-06-02 22:31:30] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 2 ms to minimize.
[2024-06-02 22:31:30] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 2 ms to minimize.
[2024-06-02 22:31:31] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 2 ms to minimize.
[2024-06-02 22:31:31] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 2 ms to minimize.
[2024-06-02 22:31:31] [INFO ] Deduced a trap composed of 33 places in 149 ms of which 2 ms to minimize.
[2024-06-02 22:31:31] [INFO ] Deduced a trap composed of 120 places in 153 ms of which 3 ms to minimize.
[2024-06-02 22:31:31] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 2 ms to minimize.
[2024-06-02 22:31:32] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 3 ms to minimize.
[2024-06-02 22:31:32] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 2 ms to minimize.
[2024-06-02 22:31:32] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 405 unsolved
[2024-06-02 22:31:34] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 2 ms to minimize.
[2024-06-02 22:31:34] [INFO ] Deduced a trap composed of 92 places in 142 ms of which 3 ms to minimize.
[2024-06-02 22:31:34] [INFO ] Deduced a trap composed of 122 places in 167 ms of which 3 ms to minimize.
[2024-06-02 22:31:34] [INFO ] Deduced a trap composed of 96 places in 139 ms of which 2 ms to minimize.
[2024-06-02 22:31:35] [INFO ] Deduced a trap composed of 96 places in 146 ms of which 2 ms to minimize.
[2024-06-02 22:31:35] [INFO ] Deduced a trap composed of 114 places in 156 ms of which 2 ms to minimize.
[2024-06-02 22:31:35] [INFO ] Deduced a trap composed of 112 places in 125 ms of which 2 ms to minimize.
[2024-06-02 22:31:36] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 2 ms to minimize.
[2024-06-02 22:31:36] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 2 ms to minimize.
[2024-06-02 22:31:36] [INFO ] Deduced a trap composed of 115 places in 149 ms of which 2 ms to minimize.
[2024-06-02 22:31:36] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 2 ms to minimize.
[2024-06-02 22:31:36] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 2 ms to minimize.
[2024-06-02 22:31:37] [INFO ] Deduced a trap composed of 115 places in 133 ms of which 2 ms to minimize.
[2024-06-02 22:31:37] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 2 ms to minimize.
[2024-06-02 22:31:37] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 2 ms to minimize.
[2024-06-02 22:31:37] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 2 ms to minimize.
[2024-06-02 22:31:37] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 2 ms to minimize.
[2024-06-02 22:31:38] [INFO ] Deduced a trap composed of 31 places in 239 ms of which 4 ms to minimize.
[2024-06-02 22:31:38] [INFO ] Deduced a trap composed of 43 places in 160 ms of which 2 ms to minimize.
[2024-06-02 22:31:39] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 405 unsolved
[2024-06-02 22:31:40] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 2 ms to minimize.
[2024-06-02 22:31:40] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 2 ms to minimize.
[2024-06-02 22:31:40] [INFO ] Deduced a trap composed of 49 places in 136 ms of which 2 ms to minimize.
[2024-06-02 22:31:40] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 2 ms to minimize.
[2024-06-02 22:31:40] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 2 ms to minimize.
[2024-06-02 22:31:40] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 2 ms to minimize.
[2024-06-02 22:31:41] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 2 ms to minimize.
[2024-06-02 22:31:41] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 2 ms to minimize.
[2024-06-02 22:31:41] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 2 ms to minimize.
[2024-06-02 22:31:41] [INFO ] Deduced a trap composed of 48 places in 140 ms of which 2 ms to minimize.
[2024-06-02 22:31:42] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 11/78 constraints. Problems are: Problem set: 0 solved, 405 unsolved
[2024-06-02 22:31:44] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 2 ms to minimize.
[2024-06-02 22:31:44] [INFO ] Deduced a trap composed of 112 places in 139 ms of which 2 ms to minimize.
[2024-06-02 22:31:45] [INFO ] Deduced a trap composed of 39 places in 163 ms of which 2 ms to minimize.
[2024-06-02 22:31:45] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 2 ms to minimize.
[2024-06-02 22:31:45] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 2 ms to minimize.
[2024-06-02 22:31:45] [INFO ] Deduced a trap composed of 21 places in 154 ms of which 2 ms to minimize.
[2024-06-02 22:31:45] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 7/85 constraints. Problems are: Problem set: 0 solved, 405 unsolved
[2024-06-02 22:31:49] [INFO ] Deduced a trap composed of 41 places in 248 ms of which 3 ms to minimize.
[2024-06-02 22:31:50] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 2 ms to minimize.
SMT process timed out in 30313ms, After SMT, problems are : Problem set: 0 solved, 405 unsolved
Search for dead transitions found 0 dead transitions in 30318ms
Starting structural reductions in LTL mode, iteration 1 : 189/197 places, 406/421 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30783 ms. Remains : 189/197 places, 406/421 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-09
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 4 ms.
FORMULA MedleyA-PT-17-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLFireability-09 finished in 30900 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)||G((F(p1)&&F(G(p2)))))))'
Support contains 5 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 421/421 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 191 transition count 409
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 191 transition count 409
Applied a total of 12 rules in 4 ms. Remains 191 /197 variables (removed 6) and now considering 409/421 (removed 12) transitions.
// Phase 1: matrix 409 rows 191 cols
[2024-06-02 22:31:50] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 22:31:50] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-06-02 22:31:50] [INFO ] Invariant cache hit.
[2024-06-02 22:31:50] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
Running 408 sub problems to find dead transitions.
[2024-06-02 22:31:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 22:31:54] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 3 ms to minimize.
[2024-06-02 22:31:55] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2024-06-02 22:31:55] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
[2024-06-02 22:31:55] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
[2024-06-02 22:31:55] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 3 ms to minimize.
[2024-06-02 22:31:55] [INFO ] Deduced a trap composed of 113 places in 149 ms of which 2 ms to minimize.
[2024-06-02 22:31:55] [INFO ] Deduced a trap composed of 113 places in 144 ms of which 2 ms to minimize.
[2024-06-02 22:31:55] [INFO ] Deduced a trap composed of 112 places in 146 ms of which 2 ms to minimize.
[2024-06-02 22:31:56] [INFO ] Deduced a trap composed of 114 places in 149 ms of which 3 ms to minimize.
[2024-06-02 22:31:56] [INFO ] Deduced a trap composed of 112 places in 141 ms of which 2 ms to minimize.
[2024-06-02 22:31:56] [INFO ] Deduced a trap composed of 123 places in 126 ms of which 2 ms to minimize.
[2024-06-02 22:31:56] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 2 ms to minimize.
[2024-06-02 22:31:57] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 2 ms to minimize.
[2024-06-02 22:31:57] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 2 ms to minimize.
[2024-06-02 22:31:57] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 2 ms to minimize.
[2024-06-02 22:31:57] [INFO ] Deduced a trap composed of 112 places in 135 ms of which 2 ms to minimize.
[2024-06-02 22:31:58] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 2 ms to minimize.
[2024-06-02 22:31:58] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 2 ms to minimize.
[2024-06-02 22:31:58] [INFO ] Deduced a trap composed of 55 places in 164 ms of which 2 ms to minimize.
[2024-06-02 22:31:58] [INFO ] Deduced a trap composed of 33 places in 166 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 22:31:58] [INFO ] Deduced a trap composed of 123 places in 128 ms of which 2 ms to minimize.
[2024-06-02 22:31:59] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 2 ms to minimize.
[2024-06-02 22:31:59] [INFO ] Deduced a trap composed of 121 places in 141 ms of which 2 ms to minimize.
[2024-06-02 22:32:00] [INFO ] Deduced a trap composed of 36 places in 165 ms of which 2 ms to minimize.
[2024-06-02 22:32:00] [INFO ] Deduced a trap composed of 40 places in 171 ms of which 2 ms to minimize.
[2024-06-02 22:32:00] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 3 ms to minimize.
[2024-06-02 22:32:00] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 2 ms to minimize.
[2024-06-02 22:32:00] [INFO ] Deduced a trap composed of 24 places in 179 ms of which 3 ms to minimize.
[2024-06-02 22:32:01] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 2 ms to minimize.
[2024-06-02 22:32:01] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 3 ms to minimize.
[2024-06-02 22:32:01] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 2 ms to minimize.
[2024-06-02 22:32:01] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 3 ms to minimize.
[2024-06-02 22:32:01] [INFO ] Deduced a trap composed of 45 places in 122 ms of which 2 ms to minimize.
[2024-06-02 22:32:01] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 2 ms to minimize.
[2024-06-02 22:32:02] [INFO ] Deduced a trap composed of 58 places in 140 ms of which 2 ms to minimize.
[2024-06-02 22:32:02] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 3 ms to minimize.
[2024-06-02 22:32:02] [INFO ] Deduced a trap composed of 48 places in 161 ms of which 2 ms to minimize.
[2024-06-02 22:32:02] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 2 ms to minimize.
[2024-06-02 22:32:02] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 1 ms to minimize.
[2024-06-02 22:32:02] [INFO ] Deduced a trap composed of 24 places in 179 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 22:32:05] [INFO ] Deduced a trap composed of 29 places in 263 ms of which 2 ms to minimize.
[2024-06-02 22:32:05] [INFO ] Deduced a trap composed of 113 places in 238 ms of which 2 ms to minimize.
[2024-06-02 22:32:06] [INFO ] Deduced a trap composed of 39 places in 245 ms of which 2 ms to minimize.
[2024-06-02 22:32:06] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 2 ms to minimize.
[2024-06-02 22:32:06] [INFO ] Deduced a trap composed of 103 places in 116 ms of which 2 ms to minimize.
[2024-06-02 22:32:06] [INFO ] Deduced a trap composed of 96 places in 148 ms of which 2 ms to minimize.
[2024-06-02 22:32:07] [INFO ] Deduced a trap composed of 47 places in 149 ms of which 2 ms to minimize.
[2024-06-02 22:32:07] [INFO ] Deduced a trap composed of 49 places in 147 ms of which 2 ms to minimize.
[2024-06-02 22:32:07] [INFO ] Deduced a trap composed of 90 places in 213 ms of which 2 ms to minimize.
[2024-06-02 22:32:07] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
[2024-06-02 22:32:08] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 3 ms to minimize.
[2024-06-02 22:32:08] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 2 ms to minimize.
[2024-06-02 22:32:08] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-06-02 22:32:08] [INFO ] Deduced a trap composed of 25 places in 212 ms of which 5 ms to minimize.
[2024-06-02 22:32:09] [INFO ] Deduced a trap composed of 116 places in 143 ms of which 2 ms to minimize.
[2024-06-02 22:32:09] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 2 ms to minimize.
[2024-06-02 22:32:09] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 2 ms to minimize.
[2024-06-02 22:32:09] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 18/65 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 22:32:11] [INFO ] Deduced a trap composed of 116 places in 143 ms of which 2 ms to minimize.
[2024-06-02 22:32:12] [INFO ] Deduced a trap composed of 104 places in 133 ms of which 2 ms to minimize.
[2024-06-02 22:32:12] [INFO ] Deduced a trap composed of 114 places in 132 ms of which 2 ms to minimize.
[2024-06-02 22:32:12] [INFO ] Deduced a trap composed of 90 places in 215 ms of which 4 ms to minimize.
[2024-06-02 22:32:12] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 2 ms to minimize.
[2024-06-02 22:32:12] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 2 ms to minimize.
[2024-06-02 22:32:13] [INFO ] Deduced a trap composed of 119 places in 143 ms of which 2 ms to minimize.
[2024-06-02 22:32:13] [INFO ] Deduced a trap composed of 24 places in 249 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 22:32:15] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 2 ms to minimize.
[2024-06-02 22:32:15] [INFO ] Deduced a trap composed of 38 places in 189 ms of which 4 ms to minimize.
[2024-06-02 22:32:16] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 191/600 variables, and 76 constraints, problems are : Problem set: 0 solved, 408 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/191 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 69/69 constraints]
Escalating to Integer solving :Problem set: 0 solved, 408 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 69/76 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 22:32:24] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-06-02 22:32:24] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 2 ms to minimize.
[2024-06-02 22:32:24] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 3 ms to minimize.
[2024-06-02 22:32:24] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 2 ms to minimize.
[2024-06-02 22:32:25] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 2 ms to minimize.
[2024-06-02 22:32:25] [INFO ] Deduced a trap composed of 54 places in 159 ms of which 3 ms to minimize.
[2024-06-02 22:32:26] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 2 ms to minimize.
[2024-06-02 22:32:26] [INFO ] Deduced a trap composed of 45 places in 142 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 8/84 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 22:32:27] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 2 ms to minimize.
[2024-06-02 22:32:27] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 3 ms to minimize.
[2024-06-02 22:32:28] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 22:32:31] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 7 (OVERLAPS) 409/600 variables, 191/279 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/600 variables, 408/687 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 600/600 variables, and 687 constraints, problems are : Problem set: 0 solved, 408 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 81/81 constraints]
After SMT, in 60234ms problems are : Problem set: 0 solved, 408 unsolved
Search for dead transitions found 0 dead transitions in 60239ms
Starting structural reductions in LTL mode, iteration 1 : 191/197 places, 409/421 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60821 ms. Remains : 191/197 places, 409/421 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-10
Product exploration explored 100000 steps with 3447 reset in 326 ms.
Product exploration explored 100000 steps with 3446 reset in 300 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 147 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (1376 resets) in 205 ms. (194 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (298 resets) in 94 ms. (421 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (297 resets) in 114 ms. (347 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (298 resets) in 124 ms. (320 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (295 resets) in 155 ms. (256 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (298 resets) in 80 ms. (493 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 533024 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :1 out of 5
Probabilistic random walk after 533024 steps, saw 98645 distinct states, run finished after 3001 ms. (steps per millisecond=177 ) properties seen :1
[2024-06-02 22:32:55] [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) 126/131 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 60/191 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 22:32:55] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
[2024-06-02 22:32:55] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-06-02 22:32:56] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 409/600 variables, 191/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 22:32:56] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 2 ms to minimize.
[2024-06-02 22:32:56] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/600 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/600 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/600 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 600/600 variables, and 203 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1085 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 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) 126/131 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 60/191 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 22:32:56] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-06-02 22:32:57] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 2 ms to minimize.
[2024-06-02 22:32:57] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 409/600 variables, 191/206 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/600 variables, 4/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 22:32:57] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/600 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/600 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/600 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 600/600 variables, and 211 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1276 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 2372ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1176 ms.
Support contains 5 out of 191 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 409/409 transitions.
Graph (trivial) has 184 edges and 191 vertex of which 9 / 191 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 185 transition count 373
Reduce places removed 27 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 158 transition count 372
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 157 transition count 372
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 57 place count 157 transition count 358
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 85 place count 143 transition count 358
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 133 place count 119 transition count 334
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 135 place count 117 transition count 320
Iterating global reduction 3 with 2 rules applied. Total rules applied 137 place count 117 transition count 320
Performed 28 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 193 place count 89 transition count 475
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 211 place count 89 transition count 457
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 213 place count 87 transition count 441
Iterating global reduction 4 with 2 rules applied. Total rules applied 215 place count 87 transition count 441
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 219 place count 87 transition count 437
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 5 with 19 rules applied. Total rules applied 238 place count 87 transition count 418
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 244 place count 84 transition count 415
Free-agglomeration rule applied 27 times.
Iterating global reduction 5 with 27 rules applied. Total rules applied 271 place count 84 transition count 388
Reduce places removed 27 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 44 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 5 with 79 rules applied. Total rules applied 350 place count 57 transition count 336
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 6 with 34 rules applied. Total rules applied 384 place count 57 transition count 302
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 388 place count 57 transition count 298
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 392 place count 53 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 7 with 32 rules applied. Total rules applied 424 place count 53 transition count 266
Free-agglomeration rule applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 428 place count 53 transition count 262
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 432 place count 49 transition count 262
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 440 place count 49 transition count 254
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 442 place count 49 transition count 282
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 444 place count 47 transition count 282
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 445 place count 46 transition count 281
Applied a total of 445 rules in 117 ms. Remains 46 /191 variables (removed 145) and now considering 281/409 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 46/191 places, 281/409 transitions.
RANDOM walk for 40000 steps (818 resets) in 206 ms. (193 steps per ms) remains 1/4 properties
BEST_FIRST walk for 33187 steps (357 resets) in 85 ms. (385 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR p2 p0))), (F p2)]
Knowledge based reduction with 11 factoid took 317 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 189 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 166 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Support contains 5 out of 191 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 191/191 places, 409/409 transitions.
Graph (trivial) has 184 edges and 191 vertex of which 9 / 191 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 184 transition count 376
Reduce places removed 26 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 158 transition count 375
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 157 transition count 375
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 55 place count 157 transition count 361
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 83 place count 143 transition count 361
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 131 place count 119 transition count 337
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 133 place count 117 transition count 323
Iterating global reduction 3 with 2 rules applied. Total rules applied 135 place count 117 transition count 323
Performed 26 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 187 place count 91 transition count 444
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 191 place count 91 transition count 440
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 193 place count 89 transition count 424
Iterating global reduction 4 with 2 rules applied. Total rules applied 195 place count 89 transition count 424
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 199 place count 89 transition count 420
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 5 with 33 rules applied. Total rules applied 232 place count 89 transition count 387
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 238 place count 86 transition count 384
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 242 place count 84 transition count 418
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 243 place count 83 transition count 417
Applied a total of 243 rules in 50 ms. Remains 83 /191 variables (removed 108) and now considering 417/409 (removed -8) transitions.
[2024-06-02 22:33:00] [INFO ] Flow matrix only has 373 transitions (discarded 44 similar events)
// Phase 1: matrix 373 rows 83 cols
[2024-06-02 22:33:00] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:33:00] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-02 22:33:00] [INFO ] Flow matrix only has 373 transitions (discarded 44 similar events)
[2024-06-02 22:33:00] [INFO ] Invariant cache hit.
[2024-06-02 22:33:00] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-02 22:33:00] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
[2024-06-02 22:33:00] [INFO ] Redundant transitions in 35 ms returned []
Running 408 sub problems to find dead transitions.
[2024-06-02 22:33:00] [INFO ] Flow matrix only has 373 transitions (discarded 44 similar events)
[2024-06-02 22:33:00] [INFO ] Invariant cache hit.
[2024-06-02 22:33:00] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 22:33:02] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 2 ms to minimize.
[2024-06-02 22:33:03] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
[2024-06-02 22:33:03] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 1 ms to minimize.
[2024-06-02 22:33:03] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 2 ms to minimize.
[2024-06-02 22:33:03] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:33:03] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-06-02 22:33:03] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 1 ms to minimize.
[2024-06-02 22:33:03] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 2 ms to minimize.
[2024-06-02 22:33:03] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 1 ms to minimize.
[2024-06-02 22:33:03] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 1 ms to minimize.
[2024-06-02 22:33:04] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 1 ms to minimize.
[2024-06-02 22:33:04] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-06-02 22:33:04] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 1 ms to minimize.
[2024-06-02 22:33:04] [INFO ] Deduced a trap composed of 49 places in 113 ms of which 1 ms to minimize.
[2024-06-02 22:33:04] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 2 ms to minimize.
[2024-06-02 22:33:04] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 2 ms to minimize.
[2024-06-02 22:33:04] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 2 ms to minimize.
[2024-06-02 22:33:05] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:33:05] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2024-06-02 22:33:06] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 22:33:06] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 1 ms to minimize.
[2024-06-02 22:33:06] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 1 ms to minimize.
[2024-06-02 22:33:06] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:33:07] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:33:07] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:33:07] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 1 ms to minimize.
[2024-06-02 22:33:07] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 22:33:08] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-06-02 22:33:09] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 22:33:10] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:33:10] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 6 (OVERLAPS) 372/455 variables, 83/121 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 78/199 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 9 (OVERLAPS) 1/456 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 11 (OVERLAPS) 0/456 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 408 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 200 constraints, problems are : Problem set: 0 solved, 408 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 83/83 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 408 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 31/38 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 3 (OVERLAPS) 372/455 variables, 83/121 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 78/199 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 408/607 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/456 variables, and 607 constraints, problems are : Problem set: 0 solved, 408 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 83/83 constraints, ReadFeed: 78/79 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 31/31 constraints]
After SMT, in 60445ms problems are : Problem set: 0 solved, 408 unsolved
Search for dead transitions found 0 dead transitions in 60450ms
Starting structural reductions in SI_LTL mode, iteration 1 : 83/191 places, 417/409 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61114 ms. Remains : 83/191 places, 417/409 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 p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 185 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (7468 resets) in 953 ms. (41 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1402 resets) in 93 ms. (425 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1369 resets) in 157 ms. (253 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1396 resets) in 121 ms. (327 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1381 resets) in 250 ms. (159 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1403 resets) in 170 ms. (233 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 391147 steps, run visited all 5 properties in 1449 ms. (steps per millisecond=269 )
Probabilistic random walk after 391147 steps, saw 89093 distinct states, run finished after 1450 ms. (steps per millisecond=269 ) properties seen :5
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR p2 p0))), (F p2)]
Knowledge based reduction with 11 factoid took 331 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 195 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 156 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 18253 reset in 279 ms.
Product exploration explored 100000 steps with 18246 reset in 324 ms.
Support contains 5 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 417/417 transitions.
Applied a total of 0 rules in 7 ms. Remains 83 /83 variables (removed 0) and now considering 417/417 (removed 0) transitions.
[2024-06-02 22:34:05] [INFO ] Flow matrix only has 373 transitions (discarded 44 similar events)
[2024-06-02 22:34:05] [INFO ] Invariant cache hit.
[2024-06-02 22:34:05] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-02 22:34:05] [INFO ] Flow matrix only has 373 transitions (discarded 44 similar events)
[2024-06-02 22:34:05] [INFO ] Invariant cache hit.
[2024-06-02 22:34:05] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-02 22:34:05] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
[2024-06-02 22:34:05] [INFO ] Redundant transitions in 3 ms returned []
Running 408 sub problems to find dead transitions.
[2024-06-02 22:34:05] [INFO ] Flow matrix only has 373 transitions (discarded 44 similar events)
[2024-06-02 22:34:05] [INFO ] Invariant cache hit.
[2024-06-02 22:34:05] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 22:34:07] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 2 ms to minimize.
[2024-06-02 22:34:07] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 2 ms to minimize.
[2024-06-02 22:34:07] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 2 ms to minimize.
[2024-06-02 22:34:07] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 1 ms to minimize.
[2024-06-02 22:34:07] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 2 ms to minimize.
[2024-06-02 22:34:08] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 2 ms to minimize.
[2024-06-02 22:34:08] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 2 ms to minimize.
[2024-06-02 22:34:08] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 1 ms to minimize.
[2024-06-02 22:34:08] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 2 ms to minimize.
[2024-06-02 22:34:08] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 1 ms to minimize.
[2024-06-02 22:34:08] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 2 ms to minimize.
[2024-06-02 22:34:09] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:34:09] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 1 ms to minimize.
[2024-06-02 22:34:09] [INFO ] Deduced a trap composed of 49 places in 152 ms of which 1 ms to minimize.
[2024-06-02 22:34:09] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 1 ms to minimize.
[2024-06-02 22:34:09] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 2 ms to minimize.
[2024-06-02 22:34:09] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 2 ms to minimize.
[2024-06-02 22:34:10] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:34:10] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:34:11] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 22:34:11] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 2 ms to minimize.
[2024-06-02 22:34:11] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 2 ms to minimize.
[2024-06-02 22:34:11] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2024-06-02 22:34:12] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2024-06-02 22:34:12] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:34:12] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 2 ms to minimize.
[2024-06-02 22:34:13] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 22:34:13] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 1 ms to minimize.
[2024-06-02 22:34:15] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 22:34:16] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2024-06-02 22:34:17] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 6 (OVERLAPS) 372/455 variables, 83/121 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 78/199 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 9 (OVERLAPS) 1/456 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 11 (OVERLAPS) 0/456 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 408 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 200 constraints, problems are : Problem set: 0 solved, 408 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 83/83 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 408 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 31/38 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 3 (OVERLAPS) 372/455 variables, 83/121 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 78/199 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 408/607 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/456 variables, and 607 constraints, problems are : Problem set: 0 solved, 408 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 83/83 constraints, ReadFeed: 78/79 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 31/31 constraints]
After SMT, in 60410ms problems are : Problem set: 0 solved, 408 unsolved
Search for dead transitions found 0 dead transitions in 60415ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60867 ms. Remains : 83/83 places, 417/417 transitions.
Treatment of property MedleyA-PT-17-LTLFireability-10 finished in 195869 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((p0&&G(F(p1)))))'
Support contains 3 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 421/421 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 190 transition count 408
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 190 transition count 408
Applied a total of 14 rules in 11 ms. Remains 190 /197 variables (removed 7) and now considering 408/421 (removed 13) transitions.
// Phase 1: matrix 408 rows 190 cols
[2024-06-02 22:35:06] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:35:06] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-06-02 22:35:06] [INFO ] Invariant cache hit.
[2024-06-02 22:35:06] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
Running 407 sub problems to find dead transitions.
[2024-06-02 22:35:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 22:35:13] [INFO ] Deduced a trap composed of 15 places in 242 ms of which 3 ms to minimize.
[2024-06-02 22:35:13] [INFO ] Deduced a trap composed of 15 places in 281 ms of which 3 ms to minimize.
[2024-06-02 22:35:13] [INFO ] Deduced a trap composed of 17 places in 244 ms of which 3 ms to minimize.
[2024-06-02 22:35:13] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-02 22:35:14] [INFO ] Deduced a trap composed of 37 places in 242 ms of which 3 ms to minimize.
[2024-06-02 22:35:14] [INFO ] Deduced a trap composed of 122 places in 237 ms of which 3 ms to minimize.
[2024-06-02 22:35:14] [INFO ] Deduced a trap composed of 111 places in 242 ms of which 3 ms to minimize.
[2024-06-02 22:35:14] [INFO ] Deduced a trap composed of 47 places in 242 ms of which 3 ms to minimize.
[2024-06-02 22:35:15] [INFO ] Deduced a trap composed of 122 places in 230 ms of which 4 ms to minimize.
[2024-06-02 22:35:15] [INFO ] Deduced a trap composed of 96 places in 261 ms of which 3 ms to minimize.
[2024-06-02 22:35:15] [INFO ] Deduced a trap composed of 96 places in 234 ms of which 3 ms to minimize.
[2024-06-02 22:35:16] [INFO ] Deduced a trap composed of 38 places in 219 ms of which 3 ms to minimize.
[2024-06-02 22:35:16] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 2 ms to minimize.
[2024-06-02 22:35:16] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 4 ms to minimize.
[2024-06-02 22:35:17] [INFO ] Deduced a trap composed of 32 places in 275 ms of which 4 ms to minimize.
[2024-06-02 22:35:17] [INFO ] Deduced a trap composed of 23 places in 280 ms of which 3 ms to minimize.
[2024-06-02 22:35:17] [INFO ] Deduced a trap composed of 25 places in 259 ms of which 3 ms to minimize.
[2024-06-02 22:35:18] [INFO ] Deduced a trap composed of 24 places in 274 ms of which 4 ms to minimize.
[2024-06-02 22:35:18] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 2 ms to minimize.
[2024-06-02 22:35:18] [INFO ] Deduced a trap composed of 29 places in 159 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 22:35:18] [INFO ] Deduced a trap composed of 111 places in 261 ms of which 4 ms to minimize.
[2024-06-02 22:35:19] [INFO ] Deduced a trap composed of 112 places in 242 ms of which 4 ms to minimize.
[2024-06-02 22:35:19] [INFO ] Deduced a trap composed of 112 places in 232 ms of which 3 ms to minimize.
[2024-06-02 22:35:19] [INFO ] Deduced a trap composed of 111 places in 200 ms of which 3 ms to minimize.
[2024-06-02 22:35:19] [INFO ] Deduced a trap composed of 121 places in 238 ms of which 3 ms to minimize.
[2024-06-02 22:35:21] [INFO ] Deduced a trap composed of 34 places in 264 ms of which 4 ms to minimize.
[2024-06-02 22:35:21] [INFO ] Deduced a trap composed of 25 places in 243 ms of which 3 ms to minimize.
[2024-06-02 22:35:21] [INFO ] Deduced a trap composed of 21 places in 258 ms of which 3 ms to minimize.
[2024-06-02 22:35:22] [INFO ] Deduced a trap composed of 111 places in 243 ms of which 3 ms to minimize.
[2024-06-02 22:35:22] [INFO ] Deduced a trap composed of 28 places in 263 ms of which 3 ms to minimize.
[2024-06-02 22:35:22] [INFO ] Deduced a trap composed of 37 places in 266 ms of which 3 ms to minimize.
[2024-06-02 22:35:22] [INFO ] Deduced a trap composed of 48 places in 285 ms of which 5 ms to minimize.
[2024-06-02 22:35:23] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 3 ms to minimize.
[2024-06-02 22:35:23] [INFO ] Deduced a trap composed of 24 places in 250 ms of which 4 ms to minimize.
[2024-06-02 22:35:23] [INFO ] Deduced a trap composed of 37 places in 247 ms of which 3 ms to minimize.
[2024-06-02 22:35:24] [INFO ] Deduced a trap composed of 29 places in 247 ms of which 3 ms to minimize.
[2024-06-02 22:35:24] [INFO ] Deduced a trap composed of 27 places in 242 ms of which 3 ms to minimize.
[2024-06-02 22:35:24] [INFO ] Deduced a trap composed of 118 places in 243 ms of which 3 ms to minimize.
[2024-06-02 22:35:24] [INFO ] Deduced a trap composed of 35 places in 266 ms of which 4 ms to minimize.
[2024-06-02 22:35:25] [INFO ] Deduced a trap composed of 57 places in 258 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 22:35:28] [INFO ] Deduced a trap composed of 45 places in 252 ms of which 3 ms to minimize.
[2024-06-02 22:35:28] [INFO ] Deduced a trap composed of 50 places in 276 ms of which 4 ms to minimize.
[2024-06-02 22:35:28] [INFO ] Deduced a trap composed of 23 places in 246 ms of which 3 ms to minimize.
[2024-06-02 22:35:29] [INFO ] Deduced a trap composed of 36 places in 245 ms of which 3 ms to minimize.
[2024-06-02 22:35:30] [INFO ] Deduced a trap composed of 23 places in 262 ms of which 4 ms to minimize.
[2024-06-02 22:35:30] [INFO ] Deduced a trap composed of 36 places in 233 ms of which 3 ms to minimize.
[2024-06-02 22:35:31] [INFO ] Deduced a trap composed of 34 places in 256 ms of which 4 ms to minimize.
[2024-06-02 22:35:31] [INFO ] Deduced a trap composed of 31 places in 240 ms of which 3 ms to minimize.
[2024-06-02 22:35:31] [INFO ] Deduced a trap composed of 24 places in 268 ms of which 4 ms to minimize.
[2024-06-02 22:35:31] [INFO ] Deduced a trap composed of 34 places in 237 ms of which 3 ms to minimize.
[2024-06-02 22:35:32] [INFO ] Deduced a trap composed of 25 places in 232 ms of which 4 ms to minimize.
[2024-06-02 22:35:32] [INFO ] Deduced a trap composed of 115 places in 187 ms of which 4 ms to minimize.
[2024-06-02 22:35:32] [INFO ] Deduced a trap composed of 98 places in 217 ms of which 3 ms to minimize.
[2024-06-02 22:35:33] [INFO ] Deduced a trap composed of 34 places in 242 ms of which 3 ms to minimize.
[2024-06-02 22:35:33] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 2 ms to minimize.
[2024-06-02 22:35:34] [INFO ] Deduced a trap composed of 43 places in 204 ms of which 3 ms to minimize.
[2024-06-02 22:35:34] [INFO ] Deduced a trap composed of 43 places in 189 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 17/64 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 22:35:36] [INFO ] Deduced a trap composed of 30 places in 158 ms of which 2 ms to minimize.
[2024-06-02 22:35:37] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 2 ms to minimize.
SMT process timed out in 30359ms, After SMT, problems are : Problem set: 0 solved, 407 unsolved
Search for dead transitions found 0 dead transitions in 30366ms
Starting structural reductions in LTL mode, iteration 1 : 190/197 places, 408/421 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31046 ms. Remains : 190/197 places, 408/421 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-17-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLFireability-12 finished in 31311 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((p0||(F(p1)&&X(X(G(p0)))))))'
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 421/421 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 190 transition count 408
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 190 transition count 408
Applied a total of 14 rules in 7 ms. Remains 190 /197 variables (removed 7) and now considering 408/421 (removed 13) transitions.
// Phase 1: matrix 408 rows 190 cols
[2024-06-02 22:35:37] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 22:35:37] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-06-02 22:35:37] [INFO ] Invariant cache hit.
[2024-06-02 22:35:38] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
Running 407 sub problems to find dead transitions.
[2024-06-02 22:35:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 22:35:44] [INFO ] Deduced a trap composed of 17 places in 238 ms of which 3 ms to minimize.
[2024-06-02 22:35:44] [INFO ] Deduced a trap composed of 15 places in 313 ms of which 4 ms to minimize.
[2024-06-02 22:35:45] [INFO ] Deduced a trap composed of 17 places in 232 ms of which 3 ms to minimize.
[2024-06-02 22:35:45] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-06-02 22:35:45] [INFO ] Deduced a trap composed of 122 places in 246 ms of which 4 ms to minimize.
[2024-06-02 22:35:45] [INFO ] Deduced a trap composed of 112 places in 245 ms of which 3 ms to minimize.
[2024-06-02 22:35:45] [INFO ] Deduced a trap composed of 37 places in 234 ms of which 3 ms to minimize.
[2024-06-02 22:35:46] [INFO ] Deduced a trap composed of 112 places in 196 ms of which 3 ms to minimize.
[2024-06-02 22:35:46] [INFO ] Deduced a trap composed of 112 places in 192 ms of which 3 ms to minimize.
[2024-06-02 22:35:46] [INFO ] Deduced a trap composed of 55 places in 239 ms of which 3 ms to minimize.
[2024-06-02 22:35:46] [INFO ] Deduced a trap composed of 114 places in 241 ms of which 4 ms to minimize.
[2024-06-02 22:35:47] [INFO ] Deduced a trap composed of 47 places in 233 ms of which 3 ms to minimize.
[2024-06-02 22:35:47] [INFO ] Deduced a trap composed of 35 places in 255 ms of which 3 ms to minimize.
[2024-06-02 22:35:47] [INFO ] Deduced a trap composed of 95 places in 254 ms of which 3 ms to minimize.
[2024-06-02 22:35:48] [INFO ] Deduced a trap composed of 113 places in 241 ms of which 3 ms to minimize.
[2024-06-02 22:35:48] [INFO ] Deduced a trap composed of 123 places in 232 ms of which 3 ms to minimize.
[2024-06-02 22:35:49] [INFO ] Deduced a trap composed of 113 places in 238 ms of which 4 ms to minimize.
[2024-06-02 22:35:49] [INFO ] Deduced a trap composed of 25 places in 259 ms of which 3 ms to minimize.
[2024-06-02 22:35:50] [INFO ] Deduced a trap composed of 24 places in 261 ms of which 3 ms to minimize.
[2024-06-02 22:35:50] [INFO ] Deduced a trap composed of 24 places in 251 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 22:35:51] [INFO ] Deduced a trap composed of 22 places in 210 ms of which 4 ms to minimize.
[2024-06-02 22:35:52] [INFO ] Deduced a trap composed of 36 places in 253 ms of which 3 ms to minimize.
[2024-06-02 22:35:52] [INFO ] Deduced a trap composed of 44 places in 251 ms of which 3 ms to minimize.
[2024-06-02 22:35:52] [INFO ] Deduced a trap composed of 25 places in 247 ms of which 3 ms to minimize.
[2024-06-02 22:35:53] [INFO ] Deduced a trap composed of 25 places in 244 ms of which 4 ms to minimize.
[2024-06-02 22:35:53] [INFO ] Deduced a trap composed of 25 places in 259 ms of which 3 ms to minimize.
[2024-06-02 22:35:53] [INFO ] Deduced a trap composed of 25 places in 242 ms of which 3 ms to minimize.
[2024-06-02 22:35:53] [INFO ] Deduced a trap composed of 29 places in 181 ms of which 3 ms to minimize.
[2024-06-02 22:35:54] [INFO ] Deduced a trap composed of 21 places in 217 ms of which 3 ms to minimize.
[2024-06-02 22:35:54] [INFO ] Deduced a trap composed of 37 places in 235 ms of which 3 ms to minimize.
[2024-06-02 22:35:54] [INFO ] Deduced a trap composed of 23 places in 223 ms of which 3 ms to minimize.
[2024-06-02 22:35:54] [INFO ] Deduced a trap composed of 40 places in 237 ms of which 3 ms to minimize.
[2024-06-02 22:35:55] [INFO ] Deduced a trap composed of 25 places in 240 ms of which 3 ms to minimize.
[2024-06-02 22:35:55] [INFO ] Deduced a trap composed of 24 places in 217 ms of which 3 ms to minimize.
[2024-06-02 22:35:55] [INFO ] Deduced a trap composed of 42 places in 220 ms of which 3 ms to minimize.
[2024-06-02 22:35:55] [INFO ] Deduced a trap composed of 50 places in 243 ms of which 3 ms to minimize.
[2024-06-02 22:35:56] [INFO ] Deduced a trap composed of 27 places in 244 ms of which 3 ms to minimize.
[2024-06-02 22:35:56] [INFO ] Deduced a trap composed of 30 places in 229 ms of which 3 ms to minimize.
[2024-06-02 22:35:56] [INFO ] Deduced a trap composed of 23 places in 226 ms of which 3 ms to minimize.
[2024-06-02 22:35:57] [INFO ] Deduced a trap composed of 23 places in 223 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 22:36:01] [INFO ] Deduced a trap composed of 33 places in 248 ms of which 4 ms to minimize.
[2024-06-02 22:36:01] [INFO ] Deduced a trap composed of 35 places in 243 ms of which 3 ms to minimize.
[2024-06-02 22:36:01] [INFO ] Deduced a trap composed of 21 places in 246 ms of which 3 ms to minimize.
[2024-06-02 22:36:02] [INFO ] Deduced a trap composed of 24 places in 274 ms of which 3 ms to minimize.
[2024-06-02 22:36:02] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 2 ms to minimize.
[2024-06-02 22:36:02] [INFO ] Deduced a trap composed of 39 places in 246 ms of which 3 ms to minimize.
[2024-06-02 22:36:03] [INFO ] Deduced a trap composed of 34 places in 249 ms of which 3 ms to minimize.
[2024-06-02 22:36:03] [INFO ] Deduced a trap composed of 35 places in 243 ms of which 3 ms to minimize.
[2024-06-02 22:36:03] [INFO ] Deduced a trap composed of 44 places in 241 ms of which 3 ms to minimize.
[2024-06-02 22:36:03] [INFO ] Deduced a trap composed of 35 places in 229 ms of which 3 ms to minimize.
[2024-06-02 22:36:04] [INFO ] Deduced a trap composed of 55 places in 237 ms of which 3 ms to minimize.
[2024-06-02 22:36:04] [INFO ] Deduced a trap composed of 33 places in 231 ms of which 3 ms to minimize.
[2024-06-02 22:36:04] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 2 ms to minimize.
[2024-06-02 22:36:04] [INFO ] Deduced a trap composed of 35 places in 242 ms of which 3 ms to minimize.
[2024-06-02 22:36:05] [INFO ] Deduced a trap composed of 31 places in 236 ms of which 3 ms to minimize.
[2024-06-02 22:36:05] [INFO ] Deduced a trap composed of 32 places in 199 ms of which 3 ms to minimize.
[2024-06-02 22:36:06] [INFO ] Deduced a trap composed of 133 places in 230 ms of which 3 ms to minimize.
[2024-06-02 22:36:06] [INFO ] Deduced a trap composed of 55 places in 186 ms of which 3 ms to minimize.
[2024-06-02 22:36:06] [INFO ] Deduced a trap composed of 51 places in 233 ms of which 3 ms to minimize.
[2024-06-02 22:36:07] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 22:36:08] [INFO ] Deduced a trap composed of 45 places in 255 ms of which 3 ms to minimize.
[2024-06-02 22:36:08] [INFO ] Deduced a trap composed of 24 places in 253 ms of which 3 ms to minimize.
[2024-06-02 22:36:08] [INFO ] Deduced a trap composed of 33 places in 239 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/598 variables, and 70 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/190 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 63/63 constraints]
Escalating to Integer solving :Problem set: 0 solved, 407 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 63/70 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 22:36:12] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 2 ms to minimize.
[2024-06-02 22:36:13] [INFO ] Deduced a trap composed of 40 places in 217 ms of which 3 ms to minimize.
[2024-06-02 22:36:13] [INFO ] Deduced a trap composed of 25 places in 244 ms of which 3 ms to minimize.
[2024-06-02 22:36:15] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 22:36:17] [INFO ] Deduced a trap composed of 39 places in 251 ms of which 3 ms to minimize.
[2024-06-02 22:36:18] [INFO ] Deduced a trap composed of 49 places in 249 ms of which 3 ms to minimize.
[2024-06-02 22:36:18] [INFO ] Deduced a trap composed of 33 places in 203 ms of which 3 ms to minimize.
[2024-06-02 22:36:18] [INFO ] Deduced a trap composed of 31 places in 237 ms of which 3 ms to minimize.
[2024-06-02 22:36:19] [INFO ] Deduced a trap composed of 47 places in 228 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 5/79 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 22:36:22] [INFO ] Deduced a trap composed of 35 places in 259 ms of which 3 ms to minimize.
[2024-06-02 22:36:23] [INFO ] Deduced a trap composed of 25 places in 249 ms of which 4 ms to minimize.
[2024-06-02 22:36:23] [INFO ] Deduced a trap composed of 115 places in 239 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 22:36:28] [INFO ] Deduced a trap composed of 25 places in 175 ms of which 3 ms to minimize.
[2024-06-02 22:36:28] [INFO ] Deduced a trap composed of 24 places in 249 ms of which 3 ms to minimize.
[2024-06-02 22:36:28] [INFO ] Deduced a trap composed of 34 places in 222 ms of which 3 ms to minimize.
[2024-06-02 22:36:29] [INFO ] Deduced a trap composed of 33 places in 170 ms of which 2 ms to minimize.
[2024-06-02 22:36:29] [INFO ] Deduced a trap composed of 35 places in 256 ms of which 3 ms to minimize.
[2024-06-02 22:36:29] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 3 ms to minimize.
[2024-06-02 22:36:29] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 2 ms to minimize.
[2024-06-02 22:36:30] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 8/90 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 22:36:34] [INFO ] Deduced a trap composed of 36 places in 243 ms of which 3 ms to minimize.
[2024-06-02 22:36:36] [INFO ] Deduced a trap composed of 33 places in 192 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 407 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 190/598 variables, and 92 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/190 constraints, PredecessorRefiner: 0/407 constraints, Known Traps: 85/85 constraints]
After SMT, in 60388ms problems are : Problem set: 0 solved, 407 unsolved
Search for dead transitions found 0 dead transitions in 60395ms
Starting structural reductions in LTL mode, iteration 1 : 190/197 places, 408/421 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61094 ms. Remains : 190/197 places, 408/421 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-13
Product exploration explored 100000 steps with 3447 reset in 309 ms.
Product exploration explored 100000 steps with 3447 reset in 353 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
RANDOM walk for 40000 steps (1376 resets) in 613 ms. (65 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (302 resets) in 155 ms. (256 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (301 resets) in 72 ms. (547 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (301 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 163532 steps, run visited all 3 properties in 1078 ms. (steps per millisecond=151 )
Probabilistic random walk after 163532 steps, saw 30106 distinct states, run finished after 1079 ms. (steps per millisecond=151 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 218 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Support contains 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 408/408 transitions.
Applied a total of 0 rules in 2 ms. Remains 190 /190 variables (removed 0) and now considering 408/408 (removed 0) transitions.
[2024-06-02 22:36:42] [INFO ] Invariant cache hit.
[2024-06-02 22:36:42] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-06-02 22:36:42] [INFO ] Invariant cache hit.
[2024-06-02 22:36:42] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
Running 407 sub problems to find dead transitions.
[2024-06-02 22:36:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 22:36:48] [INFO ] Deduced a trap composed of 17 places in 246 ms of which 4 ms to minimize.
[2024-06-02 22:36:48] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 2 ms to minimize.
[2024-06-02 22:36:49] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 3 ms to minimize.
[2024-06-02 22:36:49] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:36:49] [INFO ] Deduced a trap composed of 122 places in 237 ms of which 4 ms to minimize.
[2024-06-02 22:36:49] [INFO ] Deduced a trap composed of 112 places in 179 ms of which 2 ms to minimize.
[2024-06-02 22:36:49] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 3 ms to minimize.
[2024-06-02 22:36:49] [INFO ] Deduced a trap composed of 112 places in 137 ms of which 2 ms to minimize.
[2024-06-02 22:36:50] [INFO ] Deduced a trap composed of 112 places in 182 ms of which 3 ms to minimize.
[2024-06-02 22:36:50] [INFO ] Deduced a trap composed of 55 places in 172 ms of which 3 ms to minimize.
[2024-06-02 22:36:50] [INFO ] Deduced a trap composed of 114 places in 175 ms of which 2 ms to minimize.
[2024-06-02 22:36:50] [INFO ] Deduced a trap composed of 47 places in 171 ms of which 2 ms to minimize.
[2024-06-02 22:36:50] [INFO ] Deduced a trap composed of 35 places in 246 ms of which 3 ms to minimize.
[2024-06-02 22:36:51] [INFO ] Deduced a trap composed of 95 places in 240 ms of which 3 ms to minimize.
[2024-06-02 22:36:51] [INFO ] Deduced a trap composed of 113 places in 228 ms of which 3 ms to minimize.
[2024-06-02 22:36:52] [INFO ] Deduced a trap composed of 123 places in 220 ms of which 3 ms to minimize.
[2024-06-02 22:36:52] [INFO ] Deduced a trap composed of 113 places in 185 ms of which 3 ms to minimize.
[2024-06-02 22:36:53] [INFO ] Deduced a trap composed of 25 places in 228 ms of which 3 ms to minimize.
[2024-06-02 22:36:53] [INFO ] Deduced a trap composed of 24 places in 229 ms of which 4 ms to minimize.
[2024-06-02 22:36:53] [INFO ] Deduced a trap composed of 24 places in 226 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 22:36:55] [INFO ] Deduced a trap composed of 22 places in 277 ms of which 4 ms to minimize.
[2024-06-02 22:36:55] [INFO ] Deduced a trap composed of 36 places in 265 ms of which 3 ms to minimize.
[2024-06-02 22:36:55] [INFO ] Deduced a trap composed of 44 places in 253 ms of which 4 ms to minimize.
[2024-06-02 22:36:55] [INFO ] Deduced a trap composed of 25 places in 220 ms of which 3 ms to minimize.
[2024-06-02 22:36:56] [INFO ] Deduced a trap composed of 25 places in 221 ms of which 3 ms to minimize.
[2024-06-02 22:36:56] [INFO ] Deduced a trap composed of 25 places in 204 ms of which 3 ms to minimize.
[2024-06-02 22:36:56] [INFO ] Deduced a trap composed of 25 places in 195 ms of which 3 ms to minimize.
[2024-06-02 22:36:56] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 3 ms to minimize.
[2024-06-02 22:36:56] [INFO ] Deduced a trap composed of 21 places in 181 ms of which 2 ms to minimize.
[2024-06-02 22:36:57] [INFO ] Deduced a trap composed of 37 places in 212 ms of which 3 ms to minimize.
[2024-06-02 22:36:57] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 3 ms to minimize.
[2024-06-02 22:36:57] [INFO ] Deduced a trap composed of 40 places in 249 ms of which 3 ms to minimize.
[2024-06-02 22:36:58] [INFO ] Deduced a trap composed of 25 places in 246 ms of which 3 ms to minimize.
[2024-06-02 22:36:58] [INFO ] Deduced a trap composed of 24 places in 222 ms of which 3 ms to minimize.
[2024-06-02 22:36:58] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 2 ms to minimize.
[2024-06-02 22:36:58] [INFO ] Deduced a trap composed of 50 places in 140 ms of which 2 ms to minimize.
[2024-06-02 22:36:58] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 2 ms to minimize.
[2024-06-02 22:36:58] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 1 ms to minimize.
[2024-06-02 22:36:59] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 3 ms to minimize.
[2024-06-02 22:36:59] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 22:37:02] [INFO ] Deduced a trap composed of 33 places in 237 ms of which 3 ms to minimize.
[2024-06-02 22:37:03] [INFO ] Deduced a trap composed of 35 places in 262 ms of which 3 ms to minimize.
[2024-06-02 22:37:03] [INFO ] Deduced a trap composed of 21 places in 231 ms of which 3 ms to minimize.
[2024-06-02 22:37:03] [INFO ] Deduced a trap composed of 24 places in 244 ms of which 3 ms to minimize.
[2024-06-02 22:37:03] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 2 ms to minimize.
[2024-06-02 22:37:04] [INFO ] Deduced a trap composed of 39 places in 251 ms of which 3 ms to minimize.
[2024-06-02 22:37:04] [INFO ] Deduced a trap composed of 34 places in 246 ms of which 3 ms to minimize.
[2024-06-02 22:37:04] [INFO ] Deduced a trap composed of 35 places in 248 ms of which 3 ms to minimize.
[2024-06-02 22:37:04] [INFO ] Deduced a trap composed of 44 places in 212 ms of which 3 ms to minimize.
[2024-06-02 22:37:05] [INFO ] Deduced a trap composed of 35 places in 200 ms of which 4 ms to minimize.
[2024-06-02 22:37:05] [INFO ] Deduced a trap composed of 55 places in 259 ms of which 3 ms to minimize.
[2024-06-02 22:37:05] [INFO ] Deduced a trap composed of 33 places in 203 ms of which 3 ms to minimize.
[2024-06-02 22:37:05] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 2 ms to minimize.
[2024-06-02 22:37:06] [INFO ] Deduced a trap composed of 35 places in 242 ms of which 4 ms to minimize.
[2024-06-02 22:37:06] [INFO ] Deduced a trap composed of 31 places in 255 ms of which 3 ms to minimize.
[2024-06-02 22:37:06] [INFO ] Deduced a trap composed of 32 places in 208 ms of which 3 ms to minimize.
[2024-06-02 22:37:07] [INFO ] Deduced a trap composed of 133 places in 223 ms of which 3 ms to minimize.
[2024-06-02 22:37:07] [INFO ] Deduced a trap composed of 55 places in 247 ms of which 3 ms to minimize.
[2024-06-02 22:37:07] [INFO ] Deduced a trap composed of 51 places in 237 ms of which 3 ms to minimize.
[2024-06-02 22:37:08] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 22:37:09] [INFO ] Deduced a trap composed of 45 places in 260 ms of which 3 ms to minimize.
[2024-06-02 22:37:09] [INFO ] Deduced a trap composed of 24 places in 271 ms of which 3 ms to minimize.
[2024-06-02 22:37:09] [INFO ] Deduced a trap composed of 33 places in 258 ms of which 4 ms to minimize.
[2024-06-02 22:37:09] [INFO ] Deduced a trap composed of 38 places in 230 ms of which 3 ms to minimize.
[2024-06-02 22:37:10] [INFO ] Deduced a trap composed of 40 places in 223 ms of which 3 ms to minimize.
[2024-06-02 22:37:11] [INFO ] Deduced a trap composed of 39 places in 230 ms of which 3 ms to minimize.
[2024-06-02 22:37:11] [INFO ] Deduced a trap composed of 41 places in 247 ms of which 3 ms to minimize.
[2024-06-02 22:37:11] [INFO ] Deduced a trap composed of 32 places in 191 ms of which 3 ms to minimize.
[2024-06-02 22:37:12] [INFO ] Deduced a trap composed of 31 places in 184 ms of which 3 ms to minimize.
[2024-06-02 22:37:12] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 2 ms to minimize.
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 190/598 variables, and 77 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/190 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 70/70 constraints]
Escalating to Integer solving :Problem set: 0 solved, 407 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 70/77 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 22:37:16] [INFO ] Deduced a trap composed of 35 places in 251 ms of which 3 ms to minimize.
[2024-06-02 22:37:17] [INFO ] Deduced a trap composed of 35 places in 261 ms of which 3 ms to minimize.
[2024-06-02 22:37:18] [INFO ] Deduced a trap composed of 50 places in 214 ms of which 3 ms to minimize.
[2024-06-02 22:37:18] [INFO ] Deduced a trap composed of 36 places in 258 ms of which 4 ms to minimize.
[2024-06-02 22:37:20] [INFO ] Deduced a trap composed of 47 places in 240 ms of which 3 ms to minimize.
[2024-06-02 22:37:20] [INFO ] Deduced a trap composed of 31 places in 186 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 22:37:22] [INFO ] Deduced a trap composed of 103 places in 208 ms of which 3 ms to minimize.
[2024-06-02 22:37:23] [INFO ] Deduced a trap composed of 28 places in 250 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 22:37:25] [INFO ] Deduced a trap composed of 121 places in 138 ms of which 2 ms to minimize.
[2024-06-02 22:37:26] [INFO ] Deduced a trap composed of 95 places in 136 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 22:37:31] [INFO ] Deduced a trap composed of 45 places in 226 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 22:37:35] [INFO ] Deduced a trap composed of 39 places in 225 ms of which 3 ms to minimize.
[2024-06-02 22:37:35] [INFO ] Deduced a trap composed of 29 places in 252 ms of which 3 ms to minimize.
[2024-06-02 22:37:35] [INFO ] Deduced a trap composed of 30 places in 255 ms of which 3 ms to minimize.
[2024-06-02 22:37:36] [INFO ] Deduced a trap composed of 41 places in 213 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 190/598 variables, and 92 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/190 constraints, PredecessorRefiner: 0/407 constraints, Known Traps: 85/85 constraints]
After SMT, in 60371ms problems are : Problem set: 0 solved, 407 unsolved
Search for dead transitions found 0 dead transitions in 60378ms
Finished structural reductions in LTL mode , in 1 iterations and 61114 ms. Remains : 190/190 places, 408/408 transitions.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 132 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
RANDOM walk for 40000 steps (1376 resets) in 680 ms. (58 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (301 resets) in 202 ms. (197 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (298 resets) in 164 ms. (242 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (302 resets) in 133 ms. (298 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 163532 steps, run visited all 3 properties in 1371 ms. (steps per millisecond=119 )
Probabilistic random walk after 163532 steps, saw 30106 distinct states, run finished after 1371 ms. (steps per millisecond=119 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 223 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 3448 reset in 112 ms.
Product exploration explored 100000 steps with 3447 reset in 141 ms.
Applying partial POR strategy [false, true, false, true, true]
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Support contains 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 408/408 transitions.
Graph (trivial) has 187 edges and 190 vertex of which 9 / 190 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 184 transition count 402
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 28 place count 184 transition count 405
Deduced a syphon composed of 30 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 184 transition count 405
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 64 place count 184 transition count 409
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 81 place count 167 transition count 380
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 98 place count 167 transition count 380
Performed 28 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 126 place count 167 transition count 575
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 132 place count 167 transition count 569
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 144 place count 155 transition count 535
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 156 place count 155 transition count 535
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 161 place count 155 transition count 530
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 164 place count 152 transition count 525
Deduced a syphon composed of 62 places in 1 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 167 place count 152 transition count 525
Deduced a syphon composed of 62 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 3 with 33 rules applied. Total rules applied 200 place count 152 transition count 492
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 203 place count 149 transition count 487
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 206 place count 149 transition count 487
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 209 place count 149 transition count 487
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 212 place count 146 transition count 484
Deduced a syphon composed of 59 places in 1 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 215 place count 146 transition count 484
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 216 place count 146 transition count 499
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 217 place count 145 transition count 497
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 218 place count 145 transition count 497
Deduced a syphon composed of 59 places in 0 ms
Applied a total of 218 rules in 121 ms. Remains 145 /190 variables (removed 45) and now considering 497/408 (removed -89) transitions.
[2024-06-02 22:37:47] [INFO ] Redundant transitions in 9 ms returned []
Running 496 sub problems to find dead transitions.
[2024-06-02 22:37:47] [INFO ] Flow matrix only has 463 transitions (discarded 34 similar events)
// Phase 1: matrix 463 rows 145 cols
[2024-06-02 22:37:47] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 22:37:47] [INFO ] State equation strengthened by 95 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 496 unsolved
[2024-06-02 22:37:53] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 3 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-02 22:37:53] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
[2024-06-02 22:37:54] [INFO ] Deduced a trap composed of 23 places in 229 ms of which 3 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
[2024-06-02 22:37:54] [INFO ] Deduced a trap composed of 34 places in 201 ms of which 3 ms to minimize.
[2024-06-02 22:37:54] [INFO ] Deduced a trap composed of 10 places in 251 ms of which 2 ms to minimize.
[2024-06-02 22:37:54] [INFO ] Deduced a trap composed of 9 places in 217 ms of which 2 ms to minimize.
[2024-06-02 22:37:55] [INFO ] Deduced a trap composed of 19 places in 219 ms of which 2 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
[2024-06-02 22:37:55] [INFO ] Deduced a trap composed of 19 places in 236 ms of which 2 ms to minimize.
[2024-06-02 22:37:55] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:37:55] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 2 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
[2024-06-02 22:37:55] [INFO ] Deduced a trap composed of 33 places in 257 ms of which 3 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
[2024-06-02 22:37:56] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 1 ms to minimize.
[2024-06-02 22:37:56] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 2 ms to minimize.
[2024-06-02 22:37:56] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 1 ms to minimize.
Problem TDEAD110 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
[2024-06-02 22:37:56] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
Problem TDEAD119 is UNSAT
[2024-06-02 22:37:56] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 2 ms to minimize.
[2024-06-02 22:37:56] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 2 ms to minimize.
[2024-06-02 22:37:57] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 3 ms to minimize.
[2024-06-02 22:37:57] [INFO ] Deduced a trap composed of 14 places in 248 ms of which 3 ms to minimize.
[2024-06-02 22:37:57] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 20/27 constraints. Problems are: Problem set: 96 solved, 400 unsolved
[2024-06-02 22:37:58] [INFO ] Deduced a trap composed of 47 places in 190 ms of which 2 ms to minimize.
[2024-06-02 22:37:58] [INFO ] Deduced a trap composed of 23 places in 227 ms of which 2 ms to minimize.
[2024-06-02 22:37:58] [INFO ] Deduced a trap composed of 18 places in 226 ms of which 2 ms to minimize.
[2024-06-02 22:37:58] [INFO ] Deduced a trap composed of 17 places in 233 ms of which 3 ms to minimize.
[2024-06-02 22:37:59] [INFO ] Deduced a trap composed of 26 places in 214 ms of which 3 ms to minimize.
[2024-06-02 22:37:59] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 2 ms to minimize.
[2024-06-02 22:37:59] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 3 ms to minimize.
[2024-06-02 22:37:59] [INFO ] Deduced a trap composed of 26 places in 207 ms of which 3 ms to minimize.
[2024-06-02 22:38:02] [INFO ] Deduced a trap composed of 22 places in 168 ms of which 2 ms to minimize.
[2024-06-02 22:38:02] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 10/37 constraints. Problems are: Problem set: 96 solved, 400 unsolved
[2024-06-02 22:38:05] [INFO ] Deduced a trap composed of 34 places in 249 ms of which 3 ms to minimize.
[2024-06-02 22:38:05] [INFO ] Deduced a trap composed of 15 places in 198 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 2/39 constraints. Problems are: Problem set: 96 solved, 400 unsolved
[2024-06-02 22:38:08] [INFO ] Deduced a trap composed of 21 places in 169 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 1/40 constraints. Problems are: Problem set: 96 solved, 400 unsolved
[2024-06-02 22:38:11] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 2 ms to minimize.
[2024-06-02 22:38:11] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/42 constraints. Problems are: Problem set: 96 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/42 constraints. Problems are: Problem set: 96 solved, 400 unsolved
SMT process timed out in 30604ms, After SMT, problems are : Problem set: 96 solved, 400 unsolved
Search for dead transitions found 96 dead transitions in 30613ms
Found 96 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 96 transitions
Dead transitions reduction (with SMT) removed 96 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 145/190 places, 401/408 transitions.
Graph (complete) has 726 edges and 145 vertex of which 86 are kept as prefixes of interest. Removing 59 places using SCC suffix rule.4 ms
Discarding 59 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 27 ms. Remains 86 /145 variables (removed 59) and now considering 401/401 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 86/190 places, 401/408 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30791 ms. Remains : 86/190 places, 401/408 transitions.
Support contains 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 408/408 transitions.
Applied a total of 0 rules in 4 ms. Remains 190 /190 variables (removed 0) and now considering 408/408 (removed 0) transitions.
// Phase 1: matrix 408 rows 190 cols
[2024-06-02 22:38:18] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 22:38:18] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-06-02 22:38:18] [INFO ] Invariant cache hit.
[2024-06-02 22:38:18] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
Running 407 sub problems to find dead transitions.
[2024-06-02 22:38:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 22:38:23] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 2 ms to minimize.
[2024-06-02 22:38:23] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 2 ms to minimize.
[2024-06-02 22:38:23] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 2 ms to minimize.
[2024-06-02 22:38:23] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:38:24] [INFO ] Deduced a trap composed of 122 places in 124 ms of which 3 ms to minimize.
[2024-06-02 22:38:24] [INFO ] Deduced a trap composed of 112 places in 175 ms of which 2 ms to minimize.
[2024-06-02 22:38:24] [INFO ] Deduced a trap composed of 37 places in 239 ms of which 3 ms to minimize.
[2024-06-02 22:38:24] [INFO ] Deduced a trap composed of 112 places in 187 ms of which 3 ms to minimize.
[2024-06-02 22:38:24] [INFO ] Deduced a trap composed of 112 places in 189 ms of which 3 ms to minimize.
[2024-06-02 22:38:25] [INFO ] Deduced a trap composed of 55 places in 246 ms of which 4 ms to minimize.
[2024-06-02 22:38:25] [INFO ] Deduced a trap composed of 114 places in 237 ms of which 4 ms to minimize.
[2024-06-02 22:38:25] [INFO ] Deduced a trap composed of 47 places in 226 ms of which 3 ms to minimize.
[2024-06-02 22:38:25] [INFO ] Deduced a trap composed of 35 places in 256 ms of which 3 ms to minimize.
[2024-06-02 22:38:26] [INFO ] Deduced a trap composed of 95 places in 223 ms of which 3 ms to minimize.
[2024-06-02 22:38:26] [INFO ] Deduced a trap composed of 113 places in 227 ms of which 2 ms to minimize.
[2024-06-02 22:38:27] [INFO ] Deduced a trap composed of 123 places in 246 ms of which 3 ms to minimize.
[2024-06-02 22:38:27] [INFO ] Deduced a trap composed of 113 places in 243 ms of which 3 ms to minimize.
[2024-06-02 22:38:28] [INFO ] Deduced a trap composed of 25 places in 260 ms of which 3 ms to minimize.
[2024-06-02 22:38:28] [INFO ] Deduced a trap composed of 24 places in 239 ms of which 3 ms to minimize.
[2024-06-02 22:38:28] [INFO ] Deduced a trap composed of 24 places in 241 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 22:38:30] [INFO ] Deduced a trap composed of 22 places in 256 ms of which 4 ms to minimize.
[2024-06-02 22:38:30] [INFO ] Deduced a trap composed of 36 places in 243 ms of which 3 ms to minimize.
[2024-06-02 22:38:30] [INFO ] Deduced a trap composed of 44 places in 256 ms of which 4 ms to minimize.
[2024-06-02 22:38:31] [INFO ] Deduced a trap composed of 25 places in 253 ms of which 3 ms to minimize.
[2024-06-02 22:38:31] [INFO ] Deduced a trap composed of 25 places in 262 ms of which 3 ms to minimize.
[2024-06-02 22:38:31] [INFO ] Deduced a trap composed of 25 places in 264 ms of which 3 ms to minimize.
[2024-06-02 22:38:32] [INFO ] Deduced a trap composed of 25 places in 241 ms of which 3 ms to minimize.
[2024-06-02 22:38:32] [INFO ] Deduced a trap composed of 29 places in 186 ms of which 3 ms to minimize.
[2024-06-02 22:38:32] [INFO ] Deduced a trap composed of 21 places in 220 ms of which 3 ms to minimize.
[2024-06-02 22:38:32] [INFO ] Deduced a trap composed of 37 places in 264 ms of which 3 ms to minimize.
[2024-06-02 22:38:33] [INFO ] Deduced a trap composed of 23 places in 247 ms of which 4 ms to minimize.
[2024-06-02 22:38:33] [INFO ] Deduced a trap composed of 40 places in 249 ms of which 3 ms to minimize.
[2024-06-02 22:38:33] [INFO ] Deduced a trap composed of 25 places in 232 ms of which 3 ms to minimize.
[2024-06-02 22:38:33] [INFO ] Deduced a trap composed of 24 places in 222 ms of which 3 ms to minimize.
[2024-06-02 22:38:34] [INFO ] Deduced a trap composed of 42 places in 171 ms of which 2 ms to minimize.
[2024-06-02 22:38:34] [INFO ] Deduced a trap composed of 50 places in 244 ms of which 3 ms to minimize.
[2024-06-02 22:38:34] [INFO ] Deduced a trap composed of 27 places in 223 ms of which 3 ms to minimize.
[2024-06-02 22:38:34] [INFO ] Deduced a trap composed of 30 places in 229 ms of which 3 ms to minimize.
[2024-06-02 22:38:35] [INFO ] Deduced a trap composed of 23 places in 229 ms of which 3 ms to minimize.
[2024-06-02 22:38:35] [INFO ] Deduced a trap composed of 23 places in 221 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 22:38:39] [INFO ] Deduced a trap composed of 33 places in 258 ms of which 3 ms to minimize.
[2024-06-02 22:38:39] [INFO ] Deduced a trap composed of 35 places in 251 ms of which 4 ms to minimize.
[2024-06-02 22:38:40] [INFO ] Deduced a trap composed of 21 places in 245 ms of which 3 ms to minimize.
[2024-06-02 22:38:40] [INFO ] Deduced a trap composed of 24 places in 244 ms of which 3 ms to minimize.
[2024-06-02 22:38:40] [INFO ] Deduced a trap composed of 29 places in 183 ms of which 2 ms to minimize.
[2024-06-02 22:38:41] [INFO ] Deduced a trap composed of 39 places in 252 ms of which 4 ms to minimize.
[2024-06-02 22:38:41] [INFO ] Deduced a trap composed of 34 places in 243 ms of which 3 ms to minimize.
[2024-06-02 22:38:41] [INFO ] Deduced a trap composed of 35 places in 247 ms of which 3 ms to minimize.
[2024-06-02 22:38:42] [INFO ] Deduced a trap composed of 44 places in 248 ms of which 4 ms to minimize.
[2024-06-02 22:38:42] [INFO ] Deduced a trap composed of 35 places in 247 ms of which 3 ms to minimize.
[2024-06-02 22:38:42] [INFO ] Deduced a trap composed of 55 places in 244 ms of which 3 ms to minimize.
[2024-06-02 22:38:42] [INFO ] Deduced a trap composed of 33 places in 241 ms of which 3 ms to minimize.
[2024-06-02 22:38:43] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 2 ms to minimize.
[2024-06-02 22:38:43] [INFO ] Deduced a trap composed of 35 places in 248 ms of which 3 ms to minimize.
[2024-06-02 22:38:43] [INFO ] Deduced a trap composed of 31 places in 244 ms of which 4 ms to minimize.
[2024-06-02 22:38:43] [INFO ] Deduced a trap composed of 32 places in 207 ms of which 3 ms to minimize.
[2024-06-02 22:38:44] [INFO ] Deduced a trap composed of 133 places in 175 ms of which 3 ms to minimize.
[2024-06-02 22:38:45] [INFO ] Deduced a trap composed of 55 places in 208 ms of which 3 ms to minimize.
[2024-06-02 22:38:45] [INFO ] Deduced a trap composed of 51 places in 215 ms of which 3 ms to minimize.
[2024-06-02 22:38:45] [INFO ] Deduced a trap composed of 21 places in 189 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 22:38:46] [INFO ] Deduced a trap composed of 45 places in 251 ms of which 3 ms to minimize.
[2024-06-02 22:38:46] [INFO ] Deduced a trap composed of 24 places in 228 ms of which 3 ms to minimize.
[2024-06-02 22:38:46] [INFO ] Deduced a trap composed of 33 places in 253 ms of which 3 ms to minimize.
[2024-06-02 22:38:47] [INFO ] Deduced a trap composed of 38 places in 224 ms of which 3 ms to minimize.
[2024-06-02 22:38:47] [INFO ] Deduced a trap composed of 40 places in 225 ms of which 4 ms to minimize.
[2024-06-02 22:38:48] [INFO ] Deduced a trap composed of 39 places in 228 ms of which 3 ms to minimize.
[2024-06-02 22:38:48] [INFO ] Deduced a trap composed of 41 places in 234 ms of which 4 ms to minimize.
SMT process timed out in 30370ms, After SMT, problems are : Problem set: 0 solved, 407 unsolved
Search for dead transitions found 0 dead transitions in 30377ms
Finished structural reductions in LTL mode , in 1 iterations and 30958 ms. Remains : 190/190 places, 408/408 transitions.
Treatment of property MedleyA-PT-17-LTLFireability-13 finished in 191511 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&&(F(p1)||G(!p2))))))'
Support contains 3 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 421/421 transitions.
Graph (trivial) has 200 edges and 197 vertex of which 9 / 197 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 190 transition count 388
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 164 transition count 388
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 53 place count 164 transition count 372
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 85 place count 148 transition count 372
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 92 place count 141 transition count 359
Iterating global reduction 2 with 7 rules applied. Total rules applied 99 place count 141 transition count 359
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 140 transition count 351
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 140 transition count 351
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 145 place count 118 transition count 329
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 146 place count 117 transition count 323
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 117 transition count 323
Performed 27 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 201 place count 90 transition count 447
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 205 place count 90 transition count 443
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 207 place count 88 transition count 427
Iterating global reduction 3 with 2 rules applied. Total rules applied 209 place count 88 transition count 427
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 217 place count 88 transition count 419
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 4 with 24 rules applied. Total rules applied 241 place count 88 transition count 395
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 247 place count 85 transition count 392
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 249 place count 84 transition count 404
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 251 place count 84 transition count 404
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 258 place count 84 transition count 397
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 259 place count 83 transition count 396
Applied a total of 259 rules in 118 ms. Remains 83 /197 variables (removed 114) and now considering 396/421 (removed 25) transitions.
[2024-06-02 22:38:49] [INFO ] Flow matrix only has 358 transitions (discarded 38 similar events)
// Phase 1: matrix 358 rows 83 cols
[2024-06-02 22:38:49] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 22:38:49] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-06-02 22:38:49] [INFO ] Flow matrix only has 358 transitions (discarded 38 similar events)
[2024-06-02 22:38:49] [INFO ] Invariant cache hit.
[2024-06-02 22:38:49] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-06-02 22:38:49] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
[2024-06-02 22:38:49] [INFO ] Redundant transitions in 5 ms returned []
Running 387 sub problems to find dead transitions.
[2024-06-02 22:38:49] [INFO ] Flow matrix only has 358 transitions (discarded 38 similar events)
[2024-06-02 22:38:49] [INFO ] Invariant cache hit.
[2024-06-02 22:38:49] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 387 unsolved
[2024-06-02 22:38:52] [INFO ] Deduced a trap composed of 33 places in 167 ms of which 2 ms to minimize.
[2024-06-02 22:38:52] [INFO ] Deduced a trap composed of 30 places in 177 ms of which 2 ms to minimize.
[2024-06-02 22:38:52] [INFO ] Deduced a trap composed of 21 places in 185 ms of which 1 ms to minimize.
[2024-06-02 22:38:52] [INFO ] Deduced a trap composed of 32 places in 183 ms of which 1 ms to minimize.
[2024-06-02 22:38:52] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 2 ms to minimize.
[2024-06-02 22:38:53] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:38:53] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 1 ms to minimize.
[2024-06-02 22:38:53] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 2 ms to minimize.
[2024-06-02 22:38:53] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 1 ms to minimize.
[2024-06-02 22:38:53] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 1 ms to minimize.
[2024-06-02 22:38:53] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 2 ms to minimize.
[2024-06-02 22:38:53] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 1 ms to minimize.
[2024-06-02 22:38:54] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 2 ms to minimize.
[2024-06-02 22:38:54] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 1 ms to minimize.
[2024-06-02 22:38:54] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 1 ms to minimize.
[2024-06-02 22:38:56] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 1 ms to minimize.
[2024-06-02 22:38:56] [INFO ] Deduced a trap composed of 21 places in 179 ms of which 2 ms to minimize.
[2024-06-02 22:38:56] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 387 unsolved
[2024-06-02 22:38:56] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 4 (OVERLAPS) 357/440 variables, 83/109 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 72/181 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 7 (OVERLAPS) 1/441 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 387 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 441/441 variables, and 182 constraints, problems are : Problem set: 0 solved, 387 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 83/83 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 387/387 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 387 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 3 (OVERLAPS) 357/440 variables, 83/109 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 72/181 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 387/568 constraints. Problems are: Problem set: 0 solved, 387 unsolved
[2024-06-02 22:39:30] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 2 ms to minimize.
[2024-06-02 22:39:31] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 2/570 constraints. Problems are: Problem set: 0 solved, 387 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 440/441 variables, and 570 constraints, problems are : Problem set: 0 solved, 387 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 83/83 constraints, ReadFeed: 72/73 constraints, PredecessorRefiner: 387/387 constraints, Known Traps: 21/21 constraints]
After SMT, in 60629ms problems are : Problem set: 0 solved, 387 unsolved
Search for dead transitions found 0 dead transitions in 60636ms
Starting structural reductions in SI_LTL mode, iteration 1 : 83/197 places, 396/421 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61382 ms. Remains : 83/197 places, 396/421 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-14
Stuttering criterion allowed to conclude after 58602 steps with 10663 reset in 219 ms.
FORMULA MedleyA-PT-17-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLFireability-14 finished in 61815 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)||G((F(p1)&&F(G(p2)))))))'
Found a Lengthening insensitive property : MedleyA-PT-17-LTLFireability-10
Stuttering acceptance computed with spot in 270 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Support contains 5 out of 197 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 197/197 places, 421/421 transitions.
Graph (trivial) has 194 edges and 197 vertex of which 9 / 197 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 190 transition count 389
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 165 transition count 388
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 164 transition count 388
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 53 place count 164 transition count 372
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 85 place count 148 transition count 372
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 91 place count 142 transition count 360
Iterating global reduction 3 with 6 rules applied. Total rules applied 97 place count 142 transition count 360
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 98 place count 141 transition count 352
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 141 transition count 352
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 145 place count 118 transition count 329
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 146 place count 117 transition count 323
Iterating global reduction 3 with 1 rules applied. Total rules applied 147 place count 117 transition count 323
Performed 26 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 199 place count 91 transition count 444
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 203 place count 91 transition count 440
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 205 place count 89 transition count 424
Iterating global reduction 4 with 2 rules applied. Total rules applied 207 place count 89 transition count 424
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 211 place count 89 transition count 420
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 212 place count 88 transition count 419
Applied a total of 212 rules in 73 ms. Remains 88 /197 variables (removed 109) and now considering 419/421 (removed 2) transitions.
[2024-06-02 22:39:51] [INFO ] Flow matrix only has 387 transitions (discarded 32 similar events)
// Phase 1: matrix 387 rows 88 cols
[2024-06-02 22:39:51] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 22:39:51] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-06-02 22:39:51] [INFO ] Flow matrix only has 387 transitions (discarded 32 similar events)
[2024-06-02 22:39:51] [INFO ] Invariant cache hit.
[2024-06-02 22:39:51] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-06-02 22:39:51] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
Running 409 sub problems to find dead transitions.
[2024-06-02 22:39:51] [INFO ] Flow matrix only has 387 transitions (discarded 32 similar events)
[2024-06-02 22:39:51] [INFO ] Invariant cache hit.
[2024-06-02 22:39:51] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-02 22:39:54] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 1 ms to minimize.
[2024-06-02 22:39:54] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 2 ms to minimize.
[2024-06-02 22:39:54] [INFO ] Deduced a trap composed of 27 places in 194 ms of which 2 ms to minimize.
[2024-06-02 22:39:54] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 1 ms to minimize.
[2024-06-02 22:39:55] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 1 ms to minimize.
[2024-06-02 22:39:55] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 1 ms to minimize.
[2024-06-02 22:39:55] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 1 ms to minimize.
[2024-06-02 22:39:55] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 1 ms to minimize.
[2024-06-02 22:39:55] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 2 ms to minimize.
[2024-06-02 22:39:55] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 1 ms to minimize.
[2024-06-02 22:39:56] [INFO ] Deduced a trap composed of 9 places in 204 ms of which 1 ms to minimize.
[2024-06-02 22:39:56] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 1 ms to minimize.
[2024-06-02 22:39:56] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 2 ms to minimize.
[2024-06-02 22:39:57] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 2 ms to minimize.
[2024-06-02 22:39:57] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 1 ms to minimize.
[2024-06-02 22:39:57] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 2 ms to minimize.
[2024-06-02 22:39:57] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 1 ms to minimize.
[2024-06-02 22:39:58] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 1 ms to minimize.
[2024-06-02 22:39:58] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-02 22:39:59] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 1 ms to minimize.
[2024-06-02 22:39:59] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-02 22:40:02] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 1 ms to minimize.
[2024-06-02 22:40:02] [INFO ] Deduced a trap composed of 28 places in 203 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (OVERLAPS) 386/474 variables, 88/118 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 72/190 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-02 22:40:13] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 2 ms to minimize.
[2024-06-02 22:40:13] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 9 (OVERLAPS) 1/475 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 475/475 variables, and 193 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 88/88 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (OVERLAPS) 386/474 variables, 88/120 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 72/192 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 409/601 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 474/475 variables, and 601 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 88/88 constraints, ReadFeed: 72/73 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 25/25 constraints]
After SMT, in 60462ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60466ms
Starting structural reductions in LI_LTL mode, iteration 1 : 88/197 places, 419/421 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61046 ms. Remains : 88/197 places, 419/421 transitions.
Running random walk in product with property : MedleyA-PT-17-LTLFireability-10
Product exploration explored 100000 steps with 16349 reset in 170 ms.
Product exploration explored 100000 steps with 16218 reset in 194 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) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 162 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 211 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (6686 resets) in 325 ms. (122 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (1157 resets) in 113 ms. (350 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1166 resets) in 223 ms. (178 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1135 resets) in 127 ms. (312 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1129 resets) in 137 ms. (289 steps per ms) remains 4/4 properties
[2024-06-02 22:40:53] [INFO ] Flow matrix only has 387 transitions (discarded 32 similar events)
[2024-06-02 22:40:53] [INFO ] Invariant cache hit.
[2024-06-02 22:40:53] [INFO ] State equation strengthened by 73 read => feed constraints.
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) 43/48 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 342/390 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 84/474 variables, 40/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 70/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/475 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/475 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/475 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 475/475 variables, and 168 constraints, problems are : Problem set: 0 solved, 4 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 88/88 constraints, ReadFeed: 73/73 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) 43/48 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 342/390 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 84/474 variables, 40/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 70/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 22:40:54] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 1 ms to minimize.
[2024-06-02 22:40:54] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 1 ms to minimize.
[2024-06-02 22:40:54] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:40:54] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-06-02 22:40:54] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/474 variables, 5/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 22:40:55] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:40:55] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/474 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/474 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/475 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/475 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/475 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 475/475 variables, and 179 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1673 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 88/88 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints]
After SMT, in 1961ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1430 ms.
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 419/419 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 88 transition count 416
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 86 transition count 450
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 21 place count 86 transition count 436
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 2 with 19 rules applied. Total rules applied 40 place count 86 transition count 417
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 46 place count 83 transition count 414
Free-agglomeration rule applied 27 times.
Iterating global reduction 2 with 27 rules applied. Total rules applied 73 place count 83 transition count 387
Reduce places removed 27 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 44 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 2 with 79 rules applied. Total rules applied 152 place count 56 transition count 335
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 3 with 34 rules applied. Total rules applied 186 place count 56 transition count 301
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 190 place count 56 transition count 297
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 194 place count 52 transition count 297
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 226 place count 52 transition count 265
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 230 place count 52 transition count 261
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 234 place count 48 transition count 261
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 242 place count 48 transition count 253
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 244 place count 48 transition count 281
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 246 place count 46 transition count 281
Applied a total of 246 rules in 66 ms. Remains 46 /88 variables (removed 42) and now considering 281/419 (removed 138) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 46/88 places, 281/419 transitions.
RANDOM walk for 40000 steps (2299 resets) in 246 ms. (161 steps per ms) remains 1/4 properties
BEST_FIRST walk for 23252 steps (232 resets) in 66 ms. (347 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR p2 p0))), (F p2)]
Knowledge based reduction with 11 factoid took 364 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 133 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 419/419 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 0 with 33 rules applied. Total rules applied 33 place count 88 transition count 386
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 39 place count 85 transition count 383
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 43 place count 83 transition count 417
Applied a total of 43 rules in 16 ms. Remains 83 /88 variables (removed 5) and now considering 417/419 (removed 2) transitions.
[2024-06-02 22:40:57] [INFO ] Flow matrix only has 373 transitions (discarded 44 similar events)
// Phase 1: matrix 373 rows 83 cols
[2024-06-02 22:40:57] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:40:57] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 22:40:57] [INFO ] Flow matrix only has 373 transitions (discarded 44 similar events)
[2024-06-02 22:40:57] [INFO ] Invariant cache hit.
[2024-06-02 22:40:58] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-02 22:40:58] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2024-06-02 22:40:58] [INFO ] Redundant transitions in 4 ms returned []
Running 408 sub problems to find dead transitions.
[2024-06-02 22:40:58] [INFO ] Flow matrix only has 373 transitions (discarded 44 similar events)
[2024-06-02 22:40:58] [INFO ] Invariant cache hit.
[2024-06-02 22:40:58] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 22:41:00] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 2 ms to minimize.
[2024-06-02 22:41:00] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 1 ms to minimize.
[2024-06-02 22:41:00] [INFO ] Deduced a trap composed of 33 places in 179 ms of which 2 ms to minimize.
[2024-06-02 22:41:00] [INFO ] Deduced a trap composed of 22 places in 185 ms of which 2 ms to minimize.
[2024-06-02 22:41:01] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-06-02 22:41:01] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 2 ms to minimize.
[2024-06-02 22:41:01] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 1 ms to minimize.
[2024-06-02 22:41:01] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 2 ms to minimize.
[2024-06-02 22:41:01] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 2 ms to minimize.
[2024-06-02 22:41:01] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 2 ms to minimize.
[2024-06-02 22:41:02] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 2 ms to minimize.
[2024-06-02 22:41:02] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:41:02] [INFO ] Deduced a trap composed of 22 places in 170 ms of which 2 ms to minimize.
[2024-06-02 22:41:02] [INFO ] Deduced a trap composed of 49 places in 187 ms of which 2 ms to minimize.
[2024-06-02 22:41:02] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 1 ms to minimize.
[2024-06-02 22:41:02] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 2 ms to minimize.
[2024-06-02 22:41:03] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 2 ms to minimize.
[2024-06-02 22:41:03] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:41:04] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 2 ms to minimize.
[2024-06-02 22:41:04] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 22:41:04] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 2 ms to minimize.
[2024-06-02 22:41:05] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 2 ms to minimize.
[2024-06-02 22:41:05] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 2 ms to minimize.
[2024-06-02 22:41:05] [INFO ] Deduced a trap composed of 22 places in 168 ms of which 2 ms to minimize.
[2024-06-02 22:41:05] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 2 ms to minimize.
[2024-06-02 22:41:05] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 1 ms to minimize.
[2024-06-02 22:41:06] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 2 ms to minimize.
[2024-06-02 22:41:07] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 2 ms to minimize.
[2024-06-02 22:41:07] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 22:41:08] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (OVERLAPS) 372/455 variables, 83/120 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 78/198 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 22:41:19] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 9 (OVERLAPS) 1/456 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 456/456 variables, and 200 constraints, problems are : Problem set: 0 solved, 408 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 83/83 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 408 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 31/38 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 3 (OVERLAPS) 372/455 variables, 83/121 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 78/199 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 408/607 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 408 unsolved
SMT process timed out in 60397ms, After SMT, problems are : Problem set: 0 solved, 408 unsolved
Search for dead transitions found 0 dead transitions in 60402ms
Starting structural reductions in SI_LTL mode, iteration 1 : 83/88 places, 417/419 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60887 ms. Remains : 83/88 places, 417/419 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 p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 129 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 179 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (7429 resets) in 817 ms. (48 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1355 resets) in 316 ms. (126 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1379 resets) in 249 ms. (160 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1372 resets) in 309 ms. (129 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1373 resets) in 165 ms. (240 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1376 resets) in 229 ms. (173 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 319143 steps, run visited all 5 properties in 1654 ms. (steps per millisecond=192 )
Probabilistic random walk after 319143 steps, saw 72073 distinct states, run finished after 1657 ms. (steps per millisecond=192 ) properties seen :5
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR p2 p0))), (F p2)]
Knowledge based reduction with 11 factoid took 285 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 173 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 206 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 206 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 18247 reset in 282 ms.
Product exploration explored 100000 steps with 18199 reset in 299 ms.
Support contains 5 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 417/417 transitions.
Applied a total of 0 rules in 8 ms. Remains 83 /83 variables (removed 0) and now considering 417/417 (removed 0) transitions.
[2024-06-02 22:42:02] [INFO ] Flow matrix only has 373 transitions (discarded 44 similar events)
[2024-06-02 22:42:02] [INFO ] Invariant cache hit.
[2024-06-02 22:42:03] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-06-02 22:42:03] [INFO ] Flow matrix only has 373 transitions (discarded 44 similar events)
[2024-06-02 22:42:03] [INFO ] Invariant cache hit.
[2024-06-02 22:42:03] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-02 22:42:03] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
[2024-06-02 22:42:03] [INFO ] Redundant transitions in 5 ms returned []
Running 408 sub problems to find dead transitions.
[2024-06-02 22:42:03] [INFO ] Flow matrix only has 373 transitions (discarded 44 similar events)
[2024-06-02 22:42:03] [INFO ] Invariant cache hit.
[2024-06-02 22:42:03] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 22:42:06] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 2 ms to minimize.
[2024-06-02 22:42:06] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 2 ms to minimize.
[2024-06-02 22:42:06] [INFO ] Deduced a trap composed of 33 places in 178 ms of which 2 ms to minimize.
[2024-06-02 22:42:07] [INFO ] Deduced a trap composed of 22 places in 199 ms of which 2 ms to minimize.
[2024-06-02 22:42:07] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-06-02 22:42:07] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 2 ms to minimize.
[2024-06-02 22:42:07] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 2 ms to minimize.
[2024-06-02 22:42:07] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 2 ms to minimize.
[2024-06-02 22:42:07] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 1 ms to minimize.
[2024-06-02 22:42:07] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 1 ms to minimize.
[2024-06-02 22:42:08] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 2 ms to minimize.
[2024-06-02 22:42:08] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:42:08] [INFO ] Deduced a trap composed of 22 places in 170 ms of which 3 ms to minimize.
[2024-06-02 22:42:08] [INFO ] Deduced a trap composed of 49 places in 191 ms of which 2 ms to minimize.
[2024-06-02 22:42:08] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 2 ms to minimize.
[2024-06-02 22:42:08] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 2 ms to minimize.
[2024-06-02 22:42:09] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 2 ms to minimize.
[2024-06-02 22:42:09] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2024-06-02 22:42:10] [INFO ] Deduced a trap composed of 22 places in 165 ms of which 2 ms to minimize.
[2024-06-02 22:42:10] [INFO ] Deduced a trap composed of 34 places in 167 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 22:42:11] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 2 ms to minimize.
[2024-06-02 22:42:11] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 2 ms to minimize.
[2024-06-02 22:42:11] [INFO ] Deduced a trap composed of 31 places in 177 ms of which 1 ms to minimize.
[2024-06-02 22:42:11] [INFO ] Deduced a trap composed of 22 places in 168 ms of which 2 ms to minimize.
[2024-06-02 22:42:12] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 2 ms to minimize.
[2024-06-02 22:42:12] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 2 ms to minimize.
[2024-06-02 22:42:12] [INFO ] Deduced a trap composed of 10 places in 255 ms of which 2 ms to minimize.
[2024-06-02 22:42:13] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 1 ms to minimize.
[2024-06-02 22:42:14] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 22:42:14] [INFO ] Deduced a trap composed of 33 places in 165 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (OVERLAPS) 372/455 variables, 83/120 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 78/198 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 22:42:28] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/456 variables, and 199 constraints, problems are : Problem set: 0 solved, 408 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 83/83 constraints, ReadFeed: 78/79 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 408 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 31/38 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 3 (OVERLAPS) 372/455 variables, 83/121 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 78/199 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 408/607 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 408 unsolved
SMT process timed out in 60643ms, After SMT, problems are : Problem set: 0 solved, 408 unsolved
Search for dead transitions found 0 dead transitions in 60650ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61339 ms. Remains : 83/83 places, 417/417 transitions.
Treatment of property MedleyA-PT-17-LTLFireability-10 finished in 193498 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((p0||(F(p1)&&X(X(G(p0)))))))'
Found a Lengthening insensitive property : MedleyA-PT-17-LTLFireability-13
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 197/197 places, 421/421 transitions.
Graph (trivial) has 198 edges and 197 vertex of which 9 / 197 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 190 transition count 388
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 164 transition count 388
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 53 place count 164 transition count 373
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 83 place count 149 transition count 373
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 90 place count 142 transition count 360
Iterating global reduction 2 with 7 rules applied. Total rules applied 97 place count 142 transition count 360
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 141 transition count 352
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 141 transition count 352
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 145 place count 118 transition count 329
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 146 place count 118 transition count 328
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 147 place count 117 transition count 322
Iterating global reduction 3 with 1 rules applied. Total rules applied 148 place count 117 transition count 322
Performed 26 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 200 place count 91 transition count 435
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 203 place count 91 transition count 432
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 204 place count 90 transition count 424
Iterating global reduction 4 with 1 rules applied. Total rules applied 205 place count 90 transition count 424
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 209 place count 90 transition count 420
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 210 place count 89 transition count 419
Applied a total of 210 rules in 46 ms. Remains 89 /197 variables (removed 108) and now considering 419/421 (removed 2) transitions.
[2024-06-02 22:43:04] [INFO ] Flow matrix only has 387 transitions (discarded 32 similar events)
// Phase 1: matrix 387 rows 89 cols
[2024-06-02 22:43:04] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 22:43:04] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-06-02 22:43:04] [INFO ] Flow matrix only has 387 transitions (discarded 32 similar events)
[2024-06-02 22:43:04] [INFO ] Invariant cache hit.
[2024-06-02 22:43:05] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-06-02 22:43:05] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 709 ms to find 0 implicit places.
Running 409 sub problems to find dead transitions.
[2024-06-02 22:43:05] [INFO ] Flow matrix only has 387 transitions (discarded 32 similar events)
[2024-06-02 22:43:05] [INFO ] Invariant cache hit.
[2024-06-02 22:43:05] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-02 22:43:08] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 2 ms to minimize.
[2024-06-02 22:43:08] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 2 ms to minimize.
[2024-06-02 22:43:08] [INFO ] Deduced a trap composed of 27 places in 203 ms of which 2 ms to minimize.
[2024-06-02 22:43:08] [INFO ] Deduced a trap composed of 27 places in 199 ms of which 2 ms to minimize.
[2024-06-02 22:43:09] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 2 ms to minimize.
[2024-06-02 22:43:09] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 1 ms to minimize.
[2024-06-02 22:43:09] [INFO ] Deduced a trap composed of 23 places in 206 ms of which 2 ms to minimize.
[2024-06-02 22:43:09] [INFO ] Deduced a trap composed of 22 places in 189 ms of which 2 ms to minimize.
[2024-06-02 22:43:09] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 2 ms to minimize.
[2024-06-02 22:43:10] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 2 ms to minimize.
[2024-06-02 22:43:10] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 1 ms to minimize.
[2024-06-02 22:43:10] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 2 ms to minimize.
[2024-06-02 22:43:10] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 2 ms to minimize.
[2024-06-02 22:43:10] [INFO ] Deduced a trap composed of 24 places in 191 ms of which 2 ms to minimize.
[2024-06-02 22:43:10] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 1 ms to minimize.
[2024-06-02 22:43:11] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 2 ms to minimize.
[2024-06-02 22:43:11] [INFO ] Deduced a trap composed of 22 places in 185 ms of which 2 ms to minimize.
[2024-06-02 22:43:11] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 1 ms to minimize.
[2024-06-02 22:43:12] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 1 ms to minimize.
[2024-06-02 22:43:12] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-02 22:43:12] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 2 ms to minimize.
[2024-06-02 22:43:12] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 1 ms to minimize.
[2024-06-02 22:43:12] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 386/475 variables, 89/119 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 72/191 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (OVERLAPS) 1/476 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 476/476 variables, and 192 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 89/89 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-02 22:43:37] [INFO ] Deduced a trap composed of 50 places in 167 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 386/475 variables, 89/120 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 72/192 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 409/601 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/475 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 409 unsolved
SMT process timed out in 60677ms, After SMT, problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60683ms
Starting structural reductions in LI_LTL mode, iteration 1 : 89/197 places, 419/421 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61442 ms. Remains : 89/197 places, 419/421 transitions.
Running random walk in product with property : MedleyA-PT-17-LTLFireability-13
Product exploration explored 100000 steps with 16246 reset in 175 ms.
Product exploration explored 100000 steps with 16230 reset in 249 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 (NOT p1)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
RANDOM walk for 40000 steps (6720 resets) in 737 ms. (54 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1161 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1168 resets) in 91 ms. (434 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1182 resets) in 96 ms. (412 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 23987 steps, run visited all 3 properties in 192 ms. (steps per millisecond=124 )
Probabilistic random walk after 23987 steps, saw 6190 distinct states, run finished after 192 ms. (steps per millisecond=124 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 164 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 419/419 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 419/419 (removed 0) transitions.
[2024-06-02 22:44:08] [INFO ] Flow matrix only has 387 transitions (discarded 32 similar events)
[2024-06-02 22:44:08] [INFO ] Invariant cache hit.
[2024-06-02 22:44:08] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-02 22:44:08] [INFO ] Flow matrix only has 387 transitions (discarded 32 similar events)
[2024-06-02 22:44:08] [INFO ] Invariant cache hit.
[2024-06-02 22:44:08] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-06-02 22:44:08] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
Running 409 sub problems to find dead transitions.
[2024-06-02 22:44:08] [INFO ] Flow matrix only has 387 transitions (discarded 32 similar events)
[2024-06-02 22:44:08] [INFO ] Invariant cache hit.
[2024-06-02 22:44:08] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-02 22:44:11] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 2 ms to minimize.
[2024-06-02 22:44:11] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 1 ms to minimize.
[2024-06-02 22:44:11] [INFO ] Deduced a trap composed of 27 places in 196 ms of which 2 ms to minimize.
[2024-06-02 22:44:11] [INFO ] Deduced a trap composed of 27 places in 206 ms of which 2 ms to minimize.
[2024-06-02 22:44:12] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-06-02 22:44:12] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 1 ms to minimize.
[2024-06-02 22:44:12] [INFO ] Deduced a trap composed of 23 places in 212 ms of which 2 ms to minimize.
[2024-06-02 22:44:12] [INFO ] Deduced a trap composed of 22 places in 190 ms of which 2 ms to minimize.
[2024-06-02 22:44:12] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 2 ms to minimize.
[2024-06-02 22:44:13] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 2 ms to minimize.
[2024-06-02 22:44:13] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 1 ms to minimize.
[2024-06-02 22:44:13] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 1 ms to minimize.
[2024-06-02 22:44:13] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 1 ms to minimize.
[2024-06-02 22:44:13] [INFO ] Deduced a trap composed of 24 places in 194 ms of which 1 ms to minimize.
[2024-06-02 22:44:13] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 2 ms to minimize.
[2024-06-02 22:44:14] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 2 ms to minimize.
[2024-06-02 22:44:14] [INFO ] Deduced a trap composed of 22 places in 175 ms of which 2 ms to minimize.
[2024-06-02 22:44:14] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 1 ms to minimize.
[2024-06-02 22:44:15] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 1 ms to minimize.
[2024-06-02 22:44:15] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-02 22:44:15] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 1 ms to minimize.
[2024-06-02 22:44:15] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 1 ms to minimize.
[2024-06-02 22:44:15] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 386/475 variables, 89/119 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 72/191 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (OVERLAPS) 1/476 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 476/476 variables, and 192 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 89/89 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-02 22:44:40] [INFO ] Deduced a trap composed of 50 places in 145 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 386/475 variables, 89/120 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 72/192 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 409/601 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-02 22:45:01] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 475/476 variables, and 602 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 89/89 constraints, ReadFeed: 72/73 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 25/25 constraints]
After SMT, in 60640ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60646ms
Finished structural reductions in LTL mode , in 1 iterations and 61211 ms. Remains : 89/89 places, 419/419 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 p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
RANDOM walk for 40000 steps (6613 resets) in 619 ms. (64 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1192 resets) in 109 ms. (363 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1147 resets) in 171 ms. (232 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1159 resets) in 216 ms. (184 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 23987 steps, run visited all 3 properties in 306 ms. (steps per millisecond=78 )
Probabilistic random walk after 23987 steps, saw 6190 distinct states, run finished after 306 ms. (steps per millisecond=78 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 231 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 16187 reset in 262 ms.
Stack based approach found an accepted trace after 52436 steps with 8499 reset with depth 31 and stack size 28 in 148 ms.
Treatment of property MedleyA-PT-17-LTLFireability-13 finished in 127322 ms.
FORMULA MedleyA-PT-17-LTLFireability-13 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-06-02 22:45:11] [INFO ] Flatten gal took : 63 ms
[2024-06-02 22:45:11] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-06-02 22:45:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 197 places, 421 transitions and 1828 arcs took 10 ms.
Total runtime 1086395 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running MedleyA-PT-17
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 197
TRANSITIONS: 421
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.021s, Sys 0.000s]
SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.003s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 4653
MODEL NAME: /home/mcc/execution/413/model
197 places, 421 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.
Building monolithic NSF...
FORMULA MedleyA-PT-17-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-17-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1717368464117
--------------------
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 LTLFireability -timeout 360 -rebuildPNML
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="MedleyA-PT-17"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is MedleyA-PT-17, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r575-smll-171734919700132"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-17.tgz
mv MedleyA-PT-17 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;