About the Execution of GreatSPN+red for PolyORBLF-PT-S02J06T06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8302.092 | 2001997.00 | 3510962.00 | 321.30 | FFFFTTTFTFFFTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445500243.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-PT-S02J06T06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445500243
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 22K Apr 11 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 11 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 11 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 11 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.9K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 43K Apr 11 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 216K Apr 11 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 601K May 18 16:43 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 PolyORBLF-PT-S02J06T06-LTLCardinality-00
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLCardinality-01
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLCardinality-02
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLCardinality-03
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLCardinality-04
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLCardinality-05
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLCardinality-06
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLCardinality-07
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLCardinality-08
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLCardinality-09
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLCardinality-10
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLCardinality-11
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLCardinality-12
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLCardinality-13
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLCardinality-14
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716862083001
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 02:08:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 02:08:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:08:04] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2024-05-28 02:08:04] [INFO ] Transformed 536 places.
[2024-05-28 02:08:04] [INFO ] Transformed 1064 transitions.
[2024-05-28 02:08:04] [INFO ] Parsed PT model containing 536 places and 1064 transitions and 4866 arcs in 282 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
FORMULA PolyORBLF-PT-S02J06T06-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T06-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T06-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T06-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T06-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 149 out of 536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 534 transition count 968
Applied a total of 2 rules in 51 ms. Remains 534 /536 variables (removed 2) and now considering 968/968 (removed 0) transitions.
Running 966 sub problems to find dead transitions.
[2024-05-28 02:08:04] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 534 cols
[2024-05-28 02:08:04] [INFO ] Computed 48 invariants in 64 ms
[2024-05-28 02:08:04] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 02:08:13] [INFO ] Deduced a trap composed of 74 places in 230 ms of which 28 ms to minimize.
[2024-05-28 02:08:13] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 3 ms to minimize.
[2024-05-28 02:08:13] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 1 ms to minimize.
[2024-05-28 02:08:14] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 2 ms to minimize.
[2024-05-28 02:08:14] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 1 ms to minimize.
[2024-05-28 02:08:14] [INFO ] Deduced a trap composed of 73 places in 47 ms of which 1 ms to minimize.
[2024-05-28 02:08:14] [INFO ] Deduced a trap composed of 73 places in 44 ms of which 9 ms to minimize.
[2024-05-28 02:08:14] [INFO ] Deduced a trap composed of 75 places in 44 ms of which 1 ms to minimize.
[2024-05-28 02:08:15] [INFO ] Deduced a trap composed of 258 places in 253 ms of which 3 ms to minimize.
[2024-05-28 02:08:15] [INFO ] Deduced a trap composed of 98 places in 207 ms of which 3 ms to minimize.
[2024-05-28 02:08:15] [INFO ] Deduced a trap composed of 136 places in 235 ms of which 3 ms to minimize.
[2024-05-28 02:08:18] [INFO ] Deduced a trap composed of 266 places in 261 ms of which 4 ms to minimize.
[2024-05-28 02:08:18] [INFO ] Deduced a trap composed of 247 places in 215 ms of which 4 ms to minimize.
[2024-05-28 02:08:19] [INFO ] Deduced a trap composed of 267 places in 179 ms of which 3 ms to minimize.
[2024-05-28 02:08:20] [INFO ] Deduced a trap composed of 270 places in 237 ms of which 3 ms to minimize.
[2024-05-28 02:08:20] [INFO ] Deduced a trap composed of 236 places in 186 ms of which 3 ms to minimize.
[2024-05-28 02:08:21] [INFO ] Deduced a trap composed of 289 places in 224 ms of which 3 ms to minimize.
[2024-05-28 02:08:24] [INFO ] Deduced a trap composed of 45 places in 206 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/1490 variables, and 64 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20084 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/534 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 02:08:41] [INFO ] Deduced a trap composed of 259 places in 264 ms of which 3 ms to minimize.
[2024-05-28 02:08:46] [INFO ] Deduced a trap composed of 289 places in 255 ms of which 3 ms to minimize.
SMT process timed out in 41611ms, After SMT, problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 41655ms
[2024-05-28 02:08:46] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 02:08:46] [INFO ] Invariant cache hit.
[2024-05-28 02:08:46] [INFO ] Implicit Places using invariants in 400 ms returned [96, 111, 240, 253, 306, 495]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 409 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 528/536 places, 968/968 transitions.
Applied a total of 0 rules in 16 ms. Remains 528 /528 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42180 ms. Remains : 528/536 places, 968/968 transitions.
Support contains 149 out of 528 places after structural reductions.
[2024-05-28 02:08:47] [INFO ] Flatten gal took : 121 ms
[2024-05-28 02:08:47] [INFO ] Flatten gal took : 64 ms
[2024-05-28 02:08:47] [INFO ] Input system was already deterministic with 968 transitions.
RANDOM walk for 40000 steps (19 resets) in 1730 ms. (23 steps per ms) remains 9/25 properties
BEST_FIRST walk for 40001 steps (10 resets) in 514 ms. (77 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (10 resets) in 260 ms. (153 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (10 resets) in 272 ms. (146 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (8 resets) in 353 ms. (112 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 230 ms. (173 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (10 resets) in 307 ms. (129 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (15 resets) in 203 ms. (196 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 202 ms. (197 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (9 resets) in 190 ms. (209 steps per ms) remains 9/9 properties
[2024-05-28 02:08:48] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 528 cols
[2024-05-28 02:08:48] [INFO ] Computed 42 invariants in 23 ms
[2024-05-28 02:08:48] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp13 is UNSAT
At refinement iteration 1 (OVERLAPS) 311/390 variables, 10/10 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 13/403 variables, 5/15 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp17 is UNSAT
At refinement iteration 5 (OVERLAPS) 121/524 variables, 24/39 constraints. Problems are: Problem set: 6 solved, 3 unsolved
[2024-05-28 02:08:49] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 1 ms to minimize.
[2024-05-28 02:08:49] [INFO ] Deduced a trap composed of 74 places in 156 ms of which 2 ms to minimize.
[2024-05-28 02:08:49] [INFO ] Deduced a trap composed of 75 places in 52 ms of which 0 ms to minimize.
[2024-05-28 02:08:49] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 1 ms to minimize.
[2024-05-28 02:08:50] [INFO ] Deduced a trap composed of 74 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 5/44 constraints. Problems are: Problem set: 6 solved, 3 unsolved
[2024-05-28 02:08:50] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 1/45 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/524 variables, 0/45 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/526 variables, 2/47 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/526 variables, 0/47 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 956/1482 variables, 526/573 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1482 variables, 72/645 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1482 variables, 0/645 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/1484 variables, 2/647 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1484 variables, 1/648 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1484 variables, 0/648 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1484 variables, 0/648 constraints. Problems are: Problem set: 6 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1484/1484 variables, and 648 constraints, problems are : Problem set: 6 solved, 3 unsolved in 3615 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 528/528 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 6 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 253/256 variables, 1/1 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 127/383 variables, 9/10 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/10 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 12/395 variables, 3/13 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 0/13 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 127/522 variables, 24/37 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/522 variables, 6/43 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/522 variables, 0/43 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 4/526 variables, 4/47 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/526 variables, 0/47 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 956/1482 variables, 526/573 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1482 variables, 72/645 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1482 variables, 3/648 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1482 variables, 0/648 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/1484 variables, 2/650 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1484 variables, 1/651 constraints. Problems are: Problem set: 6 solved, 3 unsolved
[2024-05-28 02:08:55] [INFO ] Deduced a trap composed of 15 places in 290 ms of which 3 ms to minimize.
[2024-05-28 02:08:56] [INFO ] Deduced a trap composed of 239 places in 195 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1484 variables, 2/653 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1484 variables, 0/653 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/1484 variables, 0/653 constraints. Problems are: Problem set: 6 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1484/1484 variables, and 653 constraints, problems are : Problem set: 6 solved, 3 unsolved in 4202 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 528/528 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/9 constraints, Known Traps: 8/8 constraints]
After SMT, in 7880ms problems are : Problem set: 6 solved, 3 unsolved
Parikh walk visited 0 properties in 4821 ms.
Support contains 3 out of 528 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 528/528 places, 968/968 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 528 transition count 916
Reduce places removed 52 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 53 rules applied. Total rules applied 105 place count 476 transition count 915
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 106 place count 475 transition count 915
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 106 place count 475 transition count 855
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 226 place count 415 transition count 855
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 229 place count 412 transition count 852
Iterating global reduction 3 with 3 rules applied. Total rules applied 232 place count 412 transition count 852
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 326 place count 365 transition count 805
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 338 place count 365 transition count 793
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 350 place count 353 transition count 793
Applied a total of 350 rules in 247 ms. Remains 353 /528 variables (removed 175) and now considering 793/968 (removed 175) transitions.
Running 791 sub problems to find dead transitions.
[2024-05-28 02:09:01] [INFO ] Flow matrix only has 781 transitions (discarded 12 similar events)
// Phase 1: matrix 781 rows 353 cols
[2024-05-28 02:09:01] [INFO ] Computed 42 invariants in 13 ms
[2024-05-28 02:09:01] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 791 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 791 unsolved
[2024-05-28 02:09:07] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-05-28 02:09:07] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 0 ms to minimize.
[2024-05-28 02:09:07] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 2 ms to minimize.
[2024-05-28 02:09:07] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 1 ms to minimize.
[2024-05-28 02:09:07] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-05-28 02:09:08] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 2 ms to minimize.
[2024-05-28 02:09:08] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 6 ms to minimize.
[2024-05-28 02:09:08] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 0 ms to minimize.
[2024-05-28 02:09:08] [INFO ] Deduced a trap composed of 126 places in 166 ms of which 3 ms to minimize.
[2024-05-28 02:09:10] [INFO ] Deduced a trap composed of 114 places in 181 ms of which 2 ms to minimize.
[2024-05-28 02:09:10] [INFO ] Deduced a trap composed of 50 places in 166 ms of which 3 ms to minimize.
[2024-05-28 02:09:11] [INFO ] Deduced a trap composed of 132 places in 160 ms of which 3 ms to minimize.
[2024-05-28 02:09:11] [INFO ] Deduced a trap composed of 214 places in 158 ms of which 2 ms to minimize.
[2024-05-28 02:09:12] [INFO ] Deduced a trap composed of 138 places in 179 ms of which 2 ms to minimize.
[2024-05-28 02:09:12] [INFO ] Deduced a trap composed of 129 places in 156 ms of which 3 ms to minimize.
[2024-05-28 02:09:14] [INFO ] Deduced a trap composed of 153 places in 186 ms of which 2 ms to minimize.
[2024-05-28 02:09:14] [INFO ] Deduced a trap composed of 137 places in 172 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 791 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 9.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 2.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 2.0)
(s266 9.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/351 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 791 unsolved
SMT process timed out in 21150ms, After SMT, problems are : Problem set: 0 solved, 791 unsolved
Search for dead transitions found 0 dead transitions in 21160ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21411 ms. Remains : 353/528 places, 793/968 transitions.
RANDOM walk for 40000 steps (24 resets) in 647 ms. (61 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (10 resets) in 200 ms. (199 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 141 ms. (281 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (11 resets) in 186 ms. (213 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 184579 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 3
Probabilistic random walk after 184579 steps, saw 107369 distinct states, run finished after 3005 ms. (steps per millisecond=61 ) properties seen :0
[2024-05-28 02:09:26] [INFO ] Flow matrix only has 781 transitions (discarded 12 similar events)
[2024-05-28 02:09:26] [INFO ] Invariant cache hit.
[2024-05-28 02:09:26] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 213/216 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 66/282 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 69/351 variables, 21/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 02:09:26] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2024-05-28 02:09:26] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-05-28 02:09:26] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-05-28 02:09:26] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 781/1132 variables, 351/396 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1132 variables, 72/468 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1132 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/1134 variables, 2/470 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1134 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1134 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1134 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1134/1134 variables, and 471 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2186 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 353/353 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 213/216 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 66/282 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 69/351 variables, 21/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 781/1132 variables, 351/396 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1132 variables, 72/468 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1132 variables, 3/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 02:09:33] [INFO ] Deduced a trap composed of 44 places in 201 ms of which 2 ms to minimize.
[2024-05-28 02:09:33] [INFO ] Deduced a trap composed of 148 places in 232 ms of which 3 ms to minimize.
[2024-05-28 02:09:34] [INFO ] Deduced a trap composed of 118 places in 185 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1132 variables, 3/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1132 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/1134 variables, 2/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1134 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1134 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/1134 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1134/1134 variables, and 477 constraints, problems are : Problem set: 0 solved, 3 unsolved in 7583 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 353/353 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 7/7 constraints]
After SMT, in 9779ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2054 ms.
Support contains 3 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 793/793 transitions.
Applied a total of 0 rules in 21 ms. Remains 353 /353 variables (removed 0) and now considering 793/793 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 353/353 places, 793/793 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 793/793 transitions.
Applied a total of 0 rules in 19 ms. Remains 353 /353 variables (removed 0) and now considering 793/793 (removed 0) transitions.
[2024-05-28 02:09:38] [INFO ] Flow matrix only has 781 transitions (discarded 12 similar events)
[2024-05-28 02:09:38] [INFO ] Invariant cache hit.
[2024-05-28 02:09:38] [INFO ] Implicit Places using invariants in 534 ms returned []
[2024-05-28 02:09:38] [INFO ] Flow matrix only has 781 transitions (discarded 12 similar events)
[2024-05-28 02:09:38] [INFO ] Invariant cache hit.
[2024-05-28 02:09:39] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 02:09:43] [INFO ] Implicit Places using invariants and state equation in 4410 ms returned []
Implicit Place search using SMT with State Equation took 4948 ms to find 0 implicit places.
[2024-05-28 02:09:43] [INFO ] Redundant transitions in 47 ms returned []
Running 791 sub problems to find dead transitions.
[2024-05-28 02:09:43] [INFO ] Flow matrix only has 781 transitions (discarded 12 similar events)
[2024-05-28 02:09:43] [INFO ] Invariant cache hit.
[2024-05-28 02:09:43] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 791 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 791 unsolved
[2024-05-28 02:09:49] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2024-05-28 02:09:49] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2024-05-28 02:09:49] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2024-05-28 02:09:49] [INFO ] Deduced a trap composed of 44 places in 30 ms of which 1 ms to minimize.
[2024-05-28 02:09:49] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 11 ms to minimize.
[2024-05-28 02:09:49] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-05-28 02:09:50] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 2 ms to minimize.
[2024-05-28 02:09:50] [INFO ] Deduced a trap composed of 26 places in 195 ms of which 3 ms to minimize.
[2024-05-28 02:09:50] [INFO ] Deduced a trap composed of 52 places in 167 ms of which 3 ms to minimize.
[2024-05-28 02:09:54] [INFO ] Deduced a trap composed of 114 places in 206 ms of which 3 ms to minimize.
[2024-05-28 02:09:54] [INFO ] Deduced a trap composed of 138 places in 179 ms of which 3 ms to minimize.
[2024-05-28 02:09:55] [INFO ] Deduced a trap composed of 129 places in 175 ms of which 4 ms to minimize.
[2024-05-28 02:09:55] [INFO ] Deduced a trap composed of 129 places in 186 ms of which 2 ms to minimize.
[2024-05-28 02:09:55] [INFO ] Deduced a trap composed of 129 places in 191 ms of which 3 ms to minimize.
[2024-05-28 02:09:56] [INFO ] Deduced a trap composed of 106 places in 145 ms of which 2 ms to minimize.
[2024-05-28 02:09:56] [INFO ] Deduced a trap composed of 129 places in 152 ms of which 2 ms to minimize.
[2024-05-28 02:09:57] [INFO ] Deduced a trap composed of 171 places in 156 ms of which 2 ms to minimize.
[2024-05-28 02:09:58] [INFO ] Deduced a trap composed of 134 places in 151 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 791 unsolved
[2024-05-28 02:09:58] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 2 ms to minimize.
[2024-05-28 02:10:01] [INFO ] Deduced a trap composed of 129 places in 206 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/351 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 791 unsolved
[2024-05-28 02:10:12] [INFO ] Deduced a trap composed of 116 places in 205 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 791 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 351/1134 variables, and 61 constraints, problems are : Problem set: 0 solved, 791 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/353 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 791/791 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 791 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 791 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 791 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 21/61 constraints. Problems are: Problem set: 0 solved, 791 unsolved
[2024-05-28 02:10:20] [INFO ] Deduced a trap composed of 206 places in 160 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/351 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 791 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 791 unsolved
At refinement iteration 5 (OVERLAPS) 2/353 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 791 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 353/1134 variables, and 64 constraints, problems are : Problem set: 0 solved, 791 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/353 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/791 constraints, Known Traps: 22/22 constraints]
After SMT, in 61306ms problems are : Problem set: 0 solved, 791 unsolved
Search for dead transitions found 0 dead transitions in 61315ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66345 ms. Remains : 353/353 places, 793/793 transitions.
Successfully simplified 6 atomic propositions for a total of 11 simplifications.
FORMULA PolyORBLF-PT-S02J06T06-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 13 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 522 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 522 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 516 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 516 transition count 956
Applied a total of 24 rules in 22 ms. Remains 516 /528 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-05-28 02:10:44] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 516 cols
[2024-05-28 02:10:44] [INFO ] Computed 42 invariants in 14 ms
[2024-05-28 02:10:45] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 02:10:52] [INFO ] Deduced a trap composed of 20 places in 179 ms of which 3 ms to minimize.
[2024-05-28 02:10:53] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 2 ms to minimize.
[2024-05-28 02:10:53] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 2 ms to minimize.
[2024-05-28 02:10:53] [INFO ] Deduced a trap composed of 73 places in 40 ms of which 1 ms to minimize.
[2024-05-28 02:10:53] [INFO ] Deduced a trap composed of 73 places in 48 ms of which 1 ms to minimize.
[2024-05-28 02:10:53] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2024-05-28 02:10:53] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 3 ms to minimize.
[2024-05-28 02:10:53] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 2 ms to minimize.
[2024-05-28 02:10:53] [INFO ] Deduced a trap composed of 246 places in 262 ms of which 4 ms to minimize.
[2024-05-28 02:10:54] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 2 ms to minimize.
[2024-05-28 02:10:55] [INFO ] Deduced a trap composed of 176 places in 178 ms of which 4 ms to minimize.
[2024-05-28 02:10:55] [INFO ] Deduced a trap composed of 121 places in 173 ms of which 2 ms to minimize.
[2024-05-28 02:10:56] [INFO ] Deduced a trap composed of 161 places in 185 ms of which 3 ms to minimize.
[2024-05-28 02:10:59] [INFO ] Deduced a trap composed of 277 places in 181 ms of which 2 ms to minimize.
[2024-05-28 02:11:01] [INFO ] Deduced a trap composed of 106 places in 178 ms of which 3 ms to minimize.
[2024-05-28 02:11:03] [INFO ] Deduced a trap composed of 255 places in 188 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 56 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 02:11:23] [INFO ] Deduced a trap composed of 158 places in 267 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 57 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 17/17 constraints]
After SMT, in 40996ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 41007ms
[2024-05-28 02:11:25] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 02:11:25] [INFO ] Invariant cache hit.
[2024-05-28 02:11:26] [INFO ] Implicit Places using invariants in 500 ms returned []
[2024-05-28 02:11:26] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 02:11:26] [INFO ] Invariant cache hit.
[2024-05-28 02:11:26] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 02:11:33] [INFO ] Implicit Places using invariants and state equation in 7149 ms returned []
Implicit Place search using SMT with State Equation took 7653 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2024-05-28 02:11:33] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 02:11:33] [INFO ] Invariant cache hit.
[2024-05-28 02:11:33] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 02:11:41] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 3 ms to minimize.
[2024-05-28 02:11:41] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 2 ms to minimize.
[2024-05-28 02:11:41] [INFO ] Deduced a trap composed of 73 places in 54 ms of which 1 ms to minimize.
[2024-05-28 02:11:42] [INFO ] Deduced a trap composed of 72 places in 34 ms of which 1 ms to minimize.
[2024-05-28 02:11:42] [INFO ] Deduced a trap composed of 72 places in 34 ms of which 0 ms to minimize.
[2024-05-28 02:11:42] [INFO ] Deduced a trap composed of 72 places in 38 ms of which 1 ms to minimize.
[2024-05-28 02:11:42] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 2 ms to minimize.
[2024-05-28 02:11:42] [INFO ] Deduced a trap composed of 72 places in 35 ms of which 0 ms to minimize.
[2024-05-28 02:11:42] [INFO ] Deduced a trap composed of 246 places in 185 ms of which 3 ms to minimize.
[2024-05-28 02:11:42] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 2 ms to minimize.
[2024-05-28 02:11:43] [INFO ] Deduced a trap composed of 243 places in 182 ms of which 3 ms to minimize.
[2024-05-28 02:11:44] [INFO ] Deduced a trap composed of 173 places in 180 ms of which 3 ms to minimize.
[2024-05-28 02:11:47] [INFO ] Deduced a trap composed of 42 places in 225 ms of which 3 ms to minimize.
[2024-05-28 02:11:50] [INFO ] Deduced a trap composed of 258 places in 264 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 02:12:00] [INFO ] Deduced a trap composed of 233 places in 223 ms of which 3 ms to minimize.
[2024-05-28 02:12:04] [INFO ] Deduced a trap composed of 251 places in 240 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 56 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 02:12:24] [INFO ] Deduced a trap composed of 86 places in 241 ms of which 4 ms to minimize.
[2024-05-28 02:12:25] [INFO ] Deduced a trap composed of 277 places in 230 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 58 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 18/18 constraints]
After SMT, in 60931ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 60950ms
Starting structural reductions in LTL mode, iteration 1 : 516/528 places, 956/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109638 ms. Remains : 516/528 places, 956/968 transitions.
Stuttering acceptance computed with spot in 226 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 2 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLCardinality-00 finished in 109922 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 528 transition count 914
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 474 transition count 914
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 108 place count 474 transition count 854
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 228 place count 414 transition count 854
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 231 place count 411 transition count 851
Iterating global reduction 2 with 3 rules applied. Total rules applied 234 place count 411 transition count 851
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 306 place count 375 transition count 815
Applied a total of 306 rules in 57 ms. Remains 375 /528 variables (removed 153) and now considering 815/968 (removed 153) transitions.
Running 813 sub problems to find dead transitions.
[2024-05-28 02:12:34] [INFO ] Flow matrix only has 803 transitions (discarded 12 similar events)
// Phase 1: matrix 803 rows 375 cols
[2024-05-28 02:12:34] [INFO ] Computed 42 invariants in 11 ms
[2024-05-28 02:12:34] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/373 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/373 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 813 unsolved
[2024-05-28 02:12:40] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 3 ms to minimize.
[2024-05-28 02:12:40] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 2 ms to minimize.
[2024-05-28 02:12:40] [INFO ] Deduced a trap composed of 138 places in 126 ms of which 2 ms to minimize.
[2024-05-28 02:12:41] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 2 ms to minimize.
[2024-05-28 02:12:41] [INFO ] Deduced a trap composed of 67 places in 102 ms of which 2 ms to minimize.
[2024-05-28 02:12:42] [INFO ] Deduced a trap composed of 118 places in 157 ms of which 2 ms to minimize.
[2024-05-28 02:12:43] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-28 02:12:45] [INFO ] Deduced a trap composed of 127 places in 108 ms of which 2 ms to minimize.
[2024-05-28 02:12:46] [INFO ] Deduced a trap composed of 134 places in 124 ms of which 1 ms to minimize.
[2024-05-28 02:12:46] [INFO ] Deduced a trap composed of 132 places in 116 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 10/49 constraints. Problems are: Problem set: 0 solved, 813 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 813 unsolved
SMT process timed out in 20948ms, After SMT, problems are : Problem set: 0 solved, 813 unsolved
Search for dead transitions found 0 dead transitions in 20956ms
[2024-05-28 02:12:55] [INFO ] Flow matrix only has 803 transitions (discarded 12 similar events)
[2024-05-28 02:12:55] [INFO ] Invariant cache hit.
[2024-05-28 02:12:56] [INFO ] Implicit Places using invariants in 559 ms returned []
[2024-05-28 02:12:56] [INFO ] Flow matrix only has 803 transitions (discarded 12 similar events)
[2024-05-28 02:12:56] [INFO ] Invariant cache hit.
[2024-05-28 02:12:56] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 02:13:00] [INFO ] Implicit Places using invariants and state equation in 4032 ms returned []
Implicit Place search using SMT with State Equation took 4592 ms to find 0 implicit places.
[2024-05-28 02:13:00] [INFO ] Redundant transitions in 23 ms returned []
Running 813 sub problems to find dead transitions.
[2024-05-28 02:13:00] [INFO ] Flow matrix only has 803 transitions (discarded 12 similar events)
[2024-05-28 02:13:00] [INFO ] Invariant cache hit.
[2024-05-28 02:13:00] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/373 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/373 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 813 unsolved
[2024-05-28 02:13:06] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 2 ms to minimize.
[2024-05-28 02:13:06] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-28 02:13:06] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-05-28 02:13:06] [INFO ] Deduced a trap composed of 133 places in 144 ms of which 3 ms to minimize.
[2024-05-28 02:13:07] [INFO ] Deduced a trap composed of 45 places in 146 ms of which 2 ms to minimize.
[2024-05-28 02:13:07] [INFO ] Deduced a trap composed of 67 places in 122 ms of which 2 ms to minimize.
[2024-05-28 02:13:08] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-28 02:13:08] [INFO ] Deduced a trap composed of 118 places in 207 ms of which 3 ms to minimize.
[2024-05-28 02:13:11] [INFO ] Deduced a trap composed of 136 places in 124 ms of which 2 ms to minimize.
[2024-05-28 02:13:11] [INFO ] Deduced a trap composed of 132 places in 136 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 10/49 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 813 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/375 variables, 3/52 constraints. Problems are: Problem set: 66 solved, 747 unsolved
[2024-05-28 02:13:26] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 0 ms to minimize.
[2024-05-28 02:13:26] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 1 ms to minimize.
[2024-05-28 02:13:26] [INFO ] Deduced a trap composed of 48 places in 32 ms of which 1 ms to minimize.
[2024-05-28 02:13:26] [INFO ] Deduced a trap composed of 49 places in 31 ms of which 0 ms to minimize.
[2024-05-28 02:13:26] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 1 ms to minimize.
[2024-05-28 02:13:26] [INFO ] Deduced a trap composed of 48 places in 28 ms of which 0 ms to minimize.
[2024-05-28 02:13:26] [INFO ] Deduced a trap composed of 66 places in 161 ms of which 2 ms to minimize.
[2024-05-28 02:13:27] [INFO ] Deduced a trap composed of 151 places in 149 ms of which 2 ms to minimize.
[2024-05-28 02:13:27] [INFO ] Deduced a trap composed of 161 places in 148 ms of which 3 ms to minimize.
[2024-05-28 02:13:28] [INFO ] Deduced a trap composed of 52 places in 148 ms of which 2 ms to minimize.
[2024-05-28 02:13:28] [INFO ] Deduced a trap composed of 168 places in 181 ms of which 3 ms to minimize.
[2024-05-28 02:13:28] [INFO ] Deduced a trap composed of 143 places in 147 ms of which 2 ms to minimize.
[2024-05-28 02:13:29] [INFO ] Deduced a trap composed of 74 places in 172 ms of which 3 ms to minimize.
[2024-05-28 02:13:31] [INFO ] Deduced a trap composed of 72 places in 214 ms of which 3 ms to minimize.
SMT process timed out in 31048ms, After SMT, problems are : Problem set: 66 solved, 747 unsolved
Search for dead transitions found 66 dead transitions in 31060ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 375/528 places, 749/968 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 361 transition count 725
Applied a total of 12 rules in 22 ms. Remains 361 /375 variables (removed 14) and now considering 725/749 (removed 24) transitions.
[2024-05-28 02:13:31] [INFO ] Flow matrix only has 713 transitions (discarded 12 similar events)
// Phase 1: matrix 713 rows 361 cols
[2024-05-28 02:13:31] [INFO ] Computed 42 invariants in 9 ms
[2024-05-28 02:13:31] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-28 02:13:31] [INFO ] Flow matrix only has 713 transitions (discarded 12 similar events)
[2024-05-28 02:13:31] [INFO ] Invariant cache hit.
[2024-05-28 02:13:32] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 02:13:37] [INFO ] Implicit Places using invariants and state equation in 5120 ms returned []
Implicit Place search using SMT with State Equation took 5472 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 361/528 places, 725/968 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62194 ms. Remains : 361/528 places, 725/968 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLCardinality-01
Stuttering criterion allowed to conclude after 1683 steps with 0 reset in 17 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLCardinality-01 finished in 62275 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(!p0)) U p1))))'
Support contains 21 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Applied a total of 0 rules in 7 ms. Remains 528 /528 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Running 966 sub problems to find dead transitions.
[2024-05-28 02:13:37] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 528 cols
[2024-05-28 02:13:37] [INFO ] Computed 42 invariants in 15 ms
[2024-05-28 02:13:37] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 02:13:46] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-28 02:13:47] [INFO ] Deduced a trap composed of 133 places in 154 ms of which 2 ms to minimize.
[2024-05-28 02:13:48] [INFO ] Deduced a trap composed of 253 places in 175 ms of which 3 ms to minimize.
[2024-05-28 02:13:48] [INFO ] Deduced a trap composed of 269 places in 145 ms of which 3 ms to minimize.
[2024-05-28 02:13:48] [INFO ] Deduced a trap composed of 275 places in 157 ms of which 3 ms to minimize.
[2024-05-28 02:13:48] [INFO ] Deduced a trap composed of 247 places in 159 ms of which 3 ms to minimize.
[2024-05-28 02:13:50] [INFO ] Deduced a trap composed of 266 places in 146 ms of which 3 ms to minimize.
[2024-05-28 02:13:50] [INFO ] Deduced a trap composed of 259 places in 148 ms of which 2 ms to minimize.
[2024-05-28 02:13:50] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 1 ms to minimize.
[2024-05-28 02:13:51] [INFO ] Deduced a trap composed of 260 places in 159 ms of which 3 ms to minimize.
[2024-05-28 02:13:52] [INFO ] Deduced a trap composed of 262 places in 146 ms of which 2 ms to minimize.
[2024-05-28 02:13:52] [INFO ] Deduced a trap composed of 258 places in 146 ms of which 2 ms to minimize.
[2024-05-28 02:13:55] [INFO ] Deduced a trap composed of 264 places in 143 ms of which 3 ms to minimize.
[2024-05-28 02:13:56] [INFO ] Deduced a trap composed of 98 places in 185 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/1484 variables, and 53 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 14/53 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 02:14:04] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 2 ms to minimize.
[2024-05-28 02:14:04] [INFO ] Deduced a trap composed of 74 places in 50 ms of which 1 ms to minimize.
[2024-05-28 02:14:04] [INFO ] Deduced a trap composed of 74 places in 92 ms of which 1 ms to minimize.
[2024-05-28 02:14:04] [INFO ] Deduced a trap composed of 74 places in 60 ms of which 1 ms to minimize.
[2024-05-28 02:14:12] [INFO ] Deduced a trap composed of 74 places in 62 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1484 variables, and 58 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 19/19 constraints]
After SMT, in 40939ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 40950ms
[2024-05-28 02:14:18] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 02:14:18] [INFO ] Invariant cache hit.
[2024-05-28 02:14:18] [INFO ] Implicit Places using invariants in 381 ms returned []
[2024-05-28 02:14:18] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 02:14:18] [INFO ] Invariant cache hit.
[2024-05-28 02:14:19] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 02:14:26] [INFO ] Implicit Places using invariants and state equation in 7617 ms returned []
Implicit Place search using SMT with State Equation took 7998 ms to find 0 implicit places.
Running 966 sub problems to find dead transitions.
[2024-05-28 02:14:26] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 02:14:26] [INFO ] Invariant cache hit.
[2024-05-28 02:14:26] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 02:14:34] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2024-05-28 02:14:36] [INFO ] Deduced a trap composed of 133 places in 164 ms of which 3 ms to minimize.
[2024-05-28 02:14:36] [INFO ] Deduced a trap composed of 253 places in 213 ms of which 3 ms to minimize.
[2024-05-28 02:14:36] [INFO ] Deduced a trap composed of 263 places in 182 ms of which 4 ms to minimize.
[2024-05-28 02:14:37] [INFO ] Deduced a trap composed of 250 places in 197 ms of which 3 ms to minimize.
[2024-05-28 02:14:37] [INFO ] Deduced a trap composed of 258 places in 185 ms of which 3 ms to minimize.
[2024-05-28 02:14:38] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 2 ms to minimize.
[2024-05-28 02:14:39] [INFO ] Deduced a trap composed of 98 places in 160 ms of which 3 ms to minimize.
[2024-05-28 02:14:40] [INFO ] Deduced a trap composed of 266 places in 208 ms of which 3 ms to minimize.
[2024-05-28 02:14:40] [INFO ] Deduced a trap composed of 260 places in 156 ms of which 3 ms to minimize.
[2024-05-28 02:14:44] [INFO ] Deduced a trap composed of 253 places in 191 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 02:14:56] [INFO ] Deduced a trap composed of 42 places in 229 ms of which 4 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 526/1484 variables, and 51 constraints, problems are : Problem set: 0 solved, 966 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 02:15:11] [INFO ] Deduced a trap composed of 74 places in 51 ms of which 2 ms to minimize.
[2024-05-28 02:15:11] [INFO ] Deduced a trap composed of 74 places in 84 ms of which 2 ms to minimize.
[2024-05-28 02:15:12] [INFO ] Deduced a trap composed of 74 places in 41 ms of which 1 ms to minimize.
[2024-05-28 02:15:13] [INFO ] Deduced a trap composed of 74 places in 44 ms of which 1 ms to minimize.
[2024-05-28 02:15:19] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 2 ms to minimize.
[2024-05-28 02:15:19] [INFO ] Deduced a trap composed of 74 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1484 variables, and 57 constraints, problems are : Problem set: 0 solved, 966 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 18/18 constraints]
After SMT, in 61131ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 61146ms
Finished structural reductions in LTL mode , in 1 iterations and 110106 ms. Remains : 528/528 places, 968/968 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1), (NOT p1), p0]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLCardinality-02
Product exploration explored 100000 steps with 25 reset in 422 ms.
Stack based approach found an accepted trace after 1124 steps with 0 reset with depth 1125 and stack size 1125 in 6 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLCardinality-02 finished in 110697 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 18 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 522 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 522 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 516 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 516 transition count 956
Applied a total of 24 rules in 37 ms. Remains 516 /528 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-05-28 02:15:27] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 516 cols
[2024-05-28 02:15:27] [INFO ] Computed 42 invariants in 15 ms
[2024-05-28 02:15:27] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 02:15:35] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 2 ms to minimize.
[2024-05-28 02:15:35] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 1 ms to minimize.
[2024-05-28 02:15:36] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-05-28 02:15:36] [INFO ] Deduced a trap composed of 73 places in 34 ms of which 0 ms to minimize.
[2024-05-28 02:15:36] [INFO ] Deduced a trap composed of 73 places in 33 ms of which 1 ms to minimize.
[2024-05-28 02:15:36] [INFO ] Deduced a trap composed of 72 places in 34 ms of which 0 ms to minimize.
[2024-05-28 02:15:36] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-05-28 02:15:36] [INFO ] Deduced a trap composed of 72 places in 35 ms of which 1 ms to minimize.
[2024-05-28 02:15:36] [INFO ] Deduced a trap composed of 246 places in 212 ms of which 3 ms to minimize.
[2024-05-28 02:15:36] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 2 ms to minimize.
[2024-05-28 02:15:37] [INFO ] Deduced a trap composed of 176 places in 219 ms of which 4 ms to minimize.
[2024-05-28 02:15:37] [INFO ] Deduced a trap composed of 121 places in 168 ms of which 3 ms to minimize.
[2024-05-28 02:15:39] [INFO ] Deduced a trap composed of 161 places in 252 ms of which 4 ms to minimize.
[2024-05-28 02:15:41] [INFO ] Deduced a trap composed of 277 places in 176 ms of which 2 ms to minimize.
[2024-05-28 02:15:44] [INFO ] Deduced a trap composed of 106 places in 254 ms of which 3 ms to minimize.
[2024-05-28 02:15:46] [INFO ] Deduced a trap composed of 255 places in 187 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 56 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 02:16:03] [INFO ] Deduced a trap composed of 158 places in 204 ms of which 3 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 Int declared 514/1460 variables, and 57 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 17/17 constraints]
After SMT, in 41120ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 41134ms
[2024-05-28 02:16:08] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 02:16:08] [INFO ] Invariant cache hit.
[2024-05-28 02:16:09] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-05-28 02:16:09] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 02:16:09] [INFO ] Invariant cache hit.
[2024-05-28 02:16:09] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 02:16:17] [INFO ] Implicit Places using invariants and state equation in 8012 ms returned []
Implicit Place search using SMT with State Equation took 8384 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2024-05-28 02:16:17] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 02:16:17] [INFO ] Invariant cache hit.
[2024-05-28 02:16:17] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 02:16:25] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 2 ms to minimize.
[2024-05-28 02:16:25] [INFO ] Deduced a trap composed of 72 places in 83 ms of which 2 ms to minimize.
[2024-05-28 02:16:25] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 2 ms to minimize.
[2024-05-28 02:16:25] [INFO ] Deduced a trap composed of 72 places in 33 ms of which 0 ms to minimize.
[2024-05-28 02:16:25] [INFO ] Deduced a trap composed of 72 places in 33 ms of which 1 ms to minimize.
[2024-05-28 02:16:25] [INFO ] Deduced a trap composed of 72 places in 35 ms of which 0 ms to minimize.
[2024-05-28 02:16:26] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 3 ms to minimize.
[2024-05-28 02:16:26] [INFO ] Deduced a trap composed of 72 places in 35 ms of which 0 ms to minimize.
[2024-05-28 02:16:26] [INFO ] Deduced a trap composed of 246 places in 181 ms of which 3 ms to minimize.
[2024-05-28 02:16:26] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 2 ms to minimize.
[2024-05-28 02:16:27] [INFO ] Deduced a trap composed of 243 places in 188 ms of which 3 ms to minimize.
[2024-05-28 02:16:27] [INFO ] Deduced a trap composed of 173 places in 154 ms of which 3 ms to minimize.
[2024-05-28 02:16:30] [INFO ] Deduced a trap composed of 42 places in 238 ms of which 3 ms to minimize.
[2024-05-28 02:16:33] [INFO ] Deduced a trap composed of 258 places in 222 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 02:16:43] [INFO ] Deduced a trap composed of 233 places in 265 ms of which 4 ms to minimize.
[2024-05-28 02:16:46] [INFO ] Deduced a trap composed of 251 places in 179 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 56 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 02:17:05] [INFO ] Deduced a trap composed of 86 places in 175 ms of which 3 ms to minimize.
[2024-05-28 02:17:07] [INFO ] Deduced a trap composed of 277 places in 233 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 58 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 18/18 constraints]
After SMT, in 61114ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 61126ms
Starting structural reductions in LTL mode, iteration 1 : 516/528 places, 956/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110691 ms. Remains : 516/528 places, 956/968 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLCardinality-05
Product exploration explored 100000 steps with 33333 reset in 379 ms.
Product exploration explored 100000 steps with 33333 reset in 363 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 21 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S02J06T06-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S02J06T06-LTLCardinality-05 finished in 111653 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||X(F(p1)))))'
Support contains 2 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 528 transition count 915
Reduce places removed 53 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 54 rules applied. Total rules applied 107 place count 475 transition count 914
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 474 transition count 914
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 108 place count 474 transition count 854
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 228 place count 414 transition count 854
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 231 place count 411 transition count 851
Iterating global reduction 3 with 3 rules applied. Total rules applied 234 place count 411 transition count 851
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 328 place count 364 transition count 804
Applied a total of 328 rules in 86 ms. Remains 364 /528 variables (removed 164) and now considering 804/968 (removed 164) transitions.
Running 802 sub problems to find dead transitions.
[2024-05-28 02:17:19] [INFO ] Flow matrix only has 792 transitions (discarded 12 similar events)
// Phase 1: matrix 792 rows 364 cols
[2024-05-28 02:17:19] [INFO ] Computed 42 invariants in 8 ms
[2024-05-28 02:17:19] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 802 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-05-28 02:17:24] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 3 ms to minimize.
[2024-05-28 02:17:25] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 1 ms to minimize.
[2024-05-28 02:17:25] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-05-28 02:17:25] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-05-28 02:17:25] [INFO ] Deduced a trap composed of 47 places in 26 ms of which 0 ms to minimize.
[2024-05-28 02:17:25] [INFO ] Deduced a trap composed of 46 places in 25 ms of which 1 ms to minimize.
[2024-05-28 02:17:25] [INFO ] Deduced a trap composed of 121 places in 150 ms of which 2 ms to minimize.
[2024-05-28 02:17:25] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-05-28 02:17:25] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 1 ms to minimize.
[2024-05-28 02:17:26] [INFO ] Deduced a trap composed of 33 places in 144 ms of which 2 ms to minimize.
[2024-05-28 02:17:26] [INFO ] Deduced a trap composed of 60 places in 142 ms of which 2 ms to minimize.
[2024-05-28 02:17:30] [INFO ] Deduced a trap composed of 135 places in 119 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 12/46 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-05-28 02:17:32] [INFO ] Deduced a trap composed of 129 places in 123 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")
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 802 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 362/1156 variables, and 47 constraints, problems are : Problem set: 0 solved, 802 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/364 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 802/802 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 802 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 802 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 802 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 13/47 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-05-28 02:17:43] [INFO ] Deduced a trap composed of 2 places in 172 ms of which 3 ms to minimize.
[2024-05-28 02:17:43] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 3 ms to minimize.
[2024-05-28 02:17:43] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-28 02:17:43] [INFO ] Deduced a trap composed of 98 places in 135 ms of which 3 ms to minimize.
[2024-05-28 02:17:43] [INFO ] Deduced a trap composed of 157 places in 158 ms of which 3 ms to minimize.
[2024-05-28 02:17:43] [INFO ] Deduced a trap composed of 173 places in 148 ms of which 2 ms to minimize.
[2024-05-28 02:17:43] [INFO ] Deduced a trap composed of 161 places in 152 ms of which 2 ms to minimize.
[2024-05-28 02:17:44] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-05-28 02:17:44] [INFO ] Deduced a trap composed of 156 places in 125 ms of which 1 ms to minimize.
[2024-05-28 02:17:44] [INFO ] Deduced a trap composed of 148 places in 125 ms of which 2 ms to minimize.
[2024-05-28 02:17:44] [INFO ] Deduced a trap composed of 152 places in 123 ms of which 2 ms to minimize.
[2024-05-28 02:17:44] [INFO ] Deduced a trap composed of 151 places in 120 ms of which 2 ms to minimize.
[2024-05-28 02:17:44] [INFO ] Deduced a trap composed of 155 places in 123 ms of which 2 ms to minimize.
[2024-05-28 02:17:45] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 2 ms to minimize.
[2024-05-28 02:17:45] [INFO ] Deduced a trap composed of 171 places in 162 ms of which 2 ms to minimize.
[2024-05-28 02:17:45] [INFO ] Deduced a trap composed of 172 places in 184 ms of which 3 ms to minimize.
[2024-05-28 02:17:46] [INFO ] Deduced a trap composed of 203 places in 168 ms of which 2 ms to minimize.
[2024-05-28 02:17:46] [INFO ] Deduced a trap composed of 222 places in 179 ms of which 2 ms to minimize.
[2024-05-28 02:17:46] [INFO ] Deduced a trap composed of 214 places in 154 ms of which 2 ms to minimize.
[2024-05-28 02:17:46] [INFO ] Deduced a trap composed of 214 places in 163 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-05-28 02:17:48] [INFO ] Deduced a trap composed of 217 places in 132 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 802 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 362/1156 variables, and 68 constraints, problems are : Problem set: 0 solved, 802 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/364 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/802 constraints, Known Traps: 34/34 constraints]
After SMT, in 41015ms problems are : Problem set: 0 solved, 802 unsolved
Search for dead transitions found 0 dead transitions in 41026ms
[2024-05-28 02:18:00] [INFO ] Flow matrix only has 792 transitions (discarded 12 similar events)
[2024-05-28 02:18:00] [INFO ] Invariant cache hit.
[2024-05-28 02:18:00] [INFO ] Implicit Places using invariants in 416 ms returned []
[2024-05-28 02:18:00] [INFO ] Flow matrix only has 792 transitions (discarded 12 similar events)
[2024-05-28 02:18:00] [INFO ] Invariant cache hit.
[2024-05-28 02:18:01] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 02:18:05] [INFO ] Implicit Places using invariants and state equation in 4645 ms returned []
Implicit Place search using SMT with State Equation took 5064 ms to find 0 implicit places.
[2024-05-28 02:18:05] [INFO ] Redundant transitions in 24 ms returned []
Running 802 sub problems to find dead transitions.
[2024-05-28 02:18:05] [INFO ] Flow matrix only has 792 transitions (discarded 12 similar events)
[2024-05-28 02:18:05] [INFO ] Invariant cache hit.
[2024-05-28 02:18:05] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 802 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-05-28 02:18:11] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 2 ms to minimize.
[2024-05-28 02:18:11] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 2 ms to minimize.
[2024-05-28 02:18:11] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-05-28 02:18:11] [INFO ] Deduced a trap composed of 47 places in 32 ms of which 1 ms to minimize.
[2024-05-28 02:18:11] [INFO ] Deduced a trap composed of 47 places in 34 ms of which 1 ms to minimize.
[2024-05-28 02:18:11] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 2 ms to minimize.
[2024-05-28 02:18:11] [INFO ] Deduced a trap composed of 227 places in 163 ms of which 2 ms to minimize.
[2024-05-28 02:18:11] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 0 ms to minimize.
[2024-05-28 02:18:12] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 2 ms to minimize.
[2024-05-28 02:18:12] [INFO ] Deduced a trap composed of 226 places in 193 ms of which 3 ms to minimize.
[2024-05-28 02:18:13] [INFO ] Deduced a trap composed of 60 places in 218 ms of which 4 ms to minimize.
[2024-05-28 02:18:13] [INFO ] Deduced a trap composed of 60 places in 182 ms of which 3 ms to minimize.
[2024-05-28 02:18:18] [INFO ] Deduced a trap composed of 140 places in 138 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 13/47 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-05-28 02:18:19] [INFO ] Deduced a trap composed of 122 places in 125 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 802 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 802 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/364 variables, 8/56 constraints. Problems are: Problem set: 66 solved, 736 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 364/1156 variables, and 56 constraints, problems are : Problem set: 66 solved, 736 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/364 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 802/802 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 66 solved, 736 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 16/16 constraints. Problems are: Problem set: 66 solved, 736 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 18/34 constraints. Problems are: Problem set: 66 solved, 736 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 14/48 constraints. Problems are: Problem set: 66 solved, 736 unsolved
[2024-05-28 02:18:39] [INFO ] Deduced a trap composed of 98 places in 166 ms of which 2 ms to minimize.
[2024-05-28 02:18:39] [INFO ] Deduced a trap composed of 164 places in 146 ms of which 2 ms to minimize.
[2024-05-28 02:18:39] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 2 ms to minimize.
[2024-05-28 02:18:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-28 02:18:39] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-05-28 02:18:39] [INFO ] Deduced a trap composed of 154 places in 194 ms of which 2 ms to minimize.
[2024-05-28 02:18:39] [INFO ] Deduced a trap composed of 161 places in 145 ms of which 2 ms to minimize.
[2024-05-28 02:18:40] [INFO ] Deduced a trap composed of 184 places in 200 ms of which 2 ms to minimize.
[2024-05-28 02:18:44] [INFO ] Deduced a trap composed of 2 places in 171 ms of which 2 ms to minimize.
[2024-05-28 02:18:44] [INFO ] Deduced a trap composed of 152 places in 159 ms of which 2 ms to minimize.
[2024-05-28 02:18:44] [INFO ] Deduced a trap composed of 156 places in 155 ms of which 2 ms to minimize.
[2024-05-28 02:18:44] [INFO ] Deduced a trap composed of 157 places in 147 ms of which 2 ms to minimize.
[2024-05-28 02:18:44] [INFO ] Deduced a trap composed of 161 places in 129 ms of which 2 ms to minimize.
[2024-05-28 02:18:45] [INFO ] Deduced a trap composed of 144 places in 201 ms of which 3 ms to minimize.
[2024-05-28 02:18:45] [INFO ] Deduced a trap composed of 157 places in 167 ms of which 2 ms to minimize.
[2024-05-28 02:18:45] [INFO ] Deduced a trap composed of 150 places in 146 ms of which 2 ms to minimize.
[2024-05-28 02:18:46] [INFO ] Deduced a trap composed of 137 places in 195 ms of which 3 ms to minimize.
[2024-05-28 02:18:46] [INFO ] Deduced a trap composed of 150 places in 145 ms of which 2 ms to minimize.
[2024-05-28 02:18:46] [INFO ] Deduced a trap composed of 154 places in 150 ms of which 2 ms to minimize.
[2024-05-28 02:18:46] [INFO ] Deduced a trap composed of 156 places in 150 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 20/68 constraints. Problems are: Problem set: 66 solved, 736 unsolved
[2024-05-28 02:18:48] [INFO ] Deduced a trap composed of 225 places in 145 ms of which 2 ms to minimize.
[2024-05-28 02:18:56] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 2/70 constraints. Problems are: Problem set: 66 solved, 736 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 362/1156 variables, and 70 constraints, problems are : Problem set: 66 solved, 736 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/364 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/802 constraints, Known Traps: 36/36 constraints]
After SMT, in 61002ms problems are : Problem set: 66 solved, 736 unsolved
Search for dead transitions found 66 dead transitions in 61015ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 364/528 places, 738/968 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 350 transition count 714
Applied a total of 12 rules in 16 ms. Remains 350 /364 variables (removed 14) and now considering 714/738 (removed 24) transitions.
[2024-05-28 02:19:06] [INFO ] Flow matrix only has 702 transitions (discarded 12 similar events)
// Phase 1: matrix 702 rows 350 cols
[2024-05-28 02:19:06] [INFO ] Computed 42 invariants in 18 ms
[2024-05-28 02:19:07] [INFO ] Implicit Places using invariants in 401 ms returned []
[2024-05-28 02:19:07] [INFO ] Flow matrix only has 702 transitions (discarded 12 similar events)
[2024-05-28 02:19:07] [INFO ] Invariant cache hit.
[2024-05-28 02:19:07] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 02:19:11] [INFO ] Implicit Places using invariants and state equation in 4600 ms returned []
Implicit Place search using SMT with State Equation took 5002 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 350/528 places, 714/968 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 112246 ms. Remains : 350/528 places, 714/968 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLCardinality-08
Product exploration explored 100000 steps with 33152 reset in 216 ms.
Product exploration explored 100000 steps with 33136 reset in 270 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 1263 steps (1 resets) in 13 ms. (90 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 350 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 350/350 places, 714/714 transitions.
Applied a total of 0 rules in 16 ms. Remains 350 /350 variables (removed 0) and now considering 714/714 (removed 0) transitions.
Running 712 sub problems to find dead transitions.
[2024-05-28 02:19:12] [INFO ] Flow matrix only has 702 transitions (discarded 12 similar events)
[2024-05-28 02:19:12] [INFO ] Invariant cache hit.
[2024-05-28 02:19:12] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 712 unsolved
[2024-05-28 02:19:16] [INFO ] Deduced a trap composed of 45 places in 122 ms of which 2 ms to minimize.
[2024-05-28 02:19:17] [INFO ] Deduced a trap composed of 44 places in 170 ms of which 3 ms to minimize.
[2024-05-28 02:19:17] [INFO ] Deduced a trap composed of 45 places in 136 ms of which 2 ms to minimize.
[2024-05-28 02:19:17] [INFO ] Deduced a trap composed of 117 places in 135 ms of which 2 ms to minimize.
[2024-05-28 02:19:17] [INFO ] Deduced a trap composed of 45 places in 31 ms of which 1 ms to minimize.
[2024-05-28 02:19:17] [INFO ] Deduced a trap composed of 45 places in 35 ms of which 0 ms to minimize.
[2024-05-28 02:19:17] [INFO ] Deduced a trap composed of 168 places in 166 ms of which 3 ms to minimize.
[2024-05-28 02:19:17] [INFO ] Deduced a trap composed of 170 places in 139 ms of which 2 ms to minimize.
[2024-05-28 02:19:18] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2024-05-28 02:19:18] [INFO ] Deduced a trap composed of 122 places in 137 ms of which 2 ms to minimize.
[2024-05-28 02:19:18] [INFO ] Deduced a trap composed of 44 places in 29 ms of which 1 ms to minimize.
[2024-05-28 02:19:18] [INFO ] Deduced a trap composed of 180 places in 138 ms of which 3 ms to minimize.
[2024-05-28 02:19:18] [INFO ] Deduced a trap composed of 168 places in 136 ms of which 3 ms to minimize.
[2024-05-28 02:19:18] [INFO ] Deduced a trap composed of 155 places in 119 ms of which 2 ms to minimize.
[2024-05-28 02:19:18] [INFO ] Deduced a trap composed of 123 places in 120 ms of which 2 ms to minimize.
[2024-05-28 02:19:18] [INFO ] Deduced a trap composed of 172 places in 119 ms of which 2 ms to minimize.
[2024-05-28 02:19:19] [INFO ] Deduced a trap composed of 112 places in 122 ms of which 2 ms to minimize.
[2024-05-28 02:19:19] [INFO ] Deduced a trap composed of 135 places in 121 ms of which 2 ms to minimize.
[2024-05-28 02:19:19] [INFO ] Deduced a trap composed of 172 places in 120 ms of which 2 ms to minimize.
[2024-05-28 02:19:19] [INFO ] Deduced a trap composed of 122 places in 121 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 712 unsolved
[2024-05-28 02:19:20] [INFO ] Deduced a trap composed of 122 places in 124 ms of which 2 ms to minimize.
[2024-05-28 02:19:20] [INFO ] Deduced a trap composed of 169 places in 121 ms of which 2 ms to minimize.
[2024-05-28 02:19:20] [INFO ] Deduced a trap composed of 176 places in 121 ms of which 2 ms to minimize.
[2024-05-28 02:19:20] [INFO ] Deduced a trap composed of 193 places in 119 ms of which 2 ms to minimize.
[2024-05-28 02:19:20] [INFO ] Deduced a trap composed of 174 places in 120 ms of which 2 ms to minimize.
[2024-05-28 02:19:20] [INFO ] Deduced a trap composed of 183 places in 120 ms of which 2 ms to minimize.
[2024-05-28 02:19:20] [INFO ] Deduced a trap composed of 153 places in 121 ms of which 2 ms to minimize.
[2024-05-28 02:19:20] [INFO ] Deduced a trap composed of 172 places in 120 ms of which 2 ms to minimize.
[2024-05-28 02:19:21] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2024-05-28 02:19:21] [INFO ] Deduced a trap composed of 107 places in 125 ms of which 2 ms to minimize.
[2024-05-28 02:19:21] [INFO ] Deduced a trap composed of 112 places in 179 ms of which 2 ms to minimize.
[2024-05-28 02:19:21] [INFO ] Deduced a trap composed of 196 places in 122 ms of which 2 ms to minimize.
[2024-05-28 02:19:21] [INFO ] Deduced a trap composed of 186 places in 120 ms of which 2 ms to minimize.
[2024-05-28 02:19:22] [INFO ] Deduced a trap composed of 46 places in 124 ms of which 2 ms to minimize.
[2024-05-28 02:19:22] [INFO ] Deduced a trap composed of 184 places in 121 ms of which 2 ms to minimize.
[2024-05-28 02:19:22] [INFO ] Deduced a trap composed of 217 places in 119 ms of which 2 ms to minimize.
[2024-05-28 02:19:22] [INFO ] Deduced a trap composed of 206 places in 121 ms of which 2 ms to minimize.
[2024-05-28 02:19:22] [INFO ] Deduced a trap composed of 209 places in 117 ms of which 2 ms to minimize.
[2024-05-28 02:19:23] [INFO ] Deduced a trap composed of 122 places in 121 ms of which 2 ms to minimize.
[2024-05-28 02:19:23] [INFO ] Deduced a trap composed of 180 places in 134 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 712 unsolved
[2024-05-28 02:19:27] [INFO ] Deduced a trap composed of 168 places in 120 ms of which 2 ms to minimize.
[2024-05-28 02:19:27] [INFO ] Deduced a trap composed of 167 places in 123 ms of which 2 ms to minimize.
[2024-05-28 02:19:27] [INFO ] Deduced a trap composed of 175 places in 121 ms of which 2 ms to minimize.
[2024-05-28 02:19:27] [INFO ] Deduced a trap composed of 199 places in 120 ms of which 2 ms to minimize.
[2024-05-28 02:19:28] [INFO ] Deduced a trap composed of 180 places in 120 ms of which 2 ms to minimize.
[2024-05-28 02:19:28] [INFO ] Deduced a trap composed of 177 places in 122 ms of which 2 ms to minimize.
[2024-05-28 02:19:28] [INFO ] Deduced a trap composed of 167 places in 124 ms of which 2 ms to minimize.
[2024-05-28 02:19:28] [INFO ] Deduced a trap composed of 184 places in 123 ms of which 2 ms to minimize.
[2024-05-28 02:19:28] [INFO ] Deduced a trap composed of 158 places in 139 ms of which 2 ms to minimize.
[2024-05-28 02:19:28] [INFO ] Deduced a trap composed of 182 places in 122 ms of which 2 ms to minimize.
[2024-05-28 02:19:28] [INFO ] Deduced a trap composed of 172 places in 120 ms of which 2 ms to minimize.
[2024-05-28 02:19:29] [INFO ] Deduced a trap composed of 168 places in 122 ms of which 2 ms to minimize.
[2024-05-28 02:19:29] [INFO ] Deduced a trap composed of 178 places in 118 ms of which 2 ms to minimize.
[2024-05-28 02:19:29] [INFO ] Deduced a trap composed of 181 places in 115 ms of which 2 ms to minimize.
[2024-05-28 02:19:29] [INFO ] Deduced a trap composed of 181 places in 118 ms of which 2 ms to minimize.
[2024-05-28 02:19:30] [INFO ] Deduced a trap composed of 158 places in 118 ms of which 2 ms to minimize.
[2024-05-28 02:19:30] [INFO ] Deduced a trap composed of 169 places in 129 ms of which 2 ms to minimize.
[2024-05-28 02:19:30] [INFO ] Deduced a trap composed of 188 places in 125 ms of which 2 ms to minimize.
[2024-05-28 02:19:30] [INFO ] Deduced a trap composed of 181 places in 130 ms of which 2 ms to minimize.
[2024-05-28 02:19:30] [INFO ] Deduced a trap composed of 176 places in 121 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 712 unsolved
[2024-05-28 02:19:31] [INFO ] Deduced a trap composed of 177 places in 119 ms of which 2 ms to minimize.
[2024-05-28 02:19:31] [INFO ] Deduced a trap composed of 191 places in 118 ms of which 2 ms to minimize.
[2024-05-28 02:19:31] [INFO ] Deduced a trap composed of 170 places in 120 ms of which 2 ms to minimize.
[2024-05-28 02:19:31] [INFO ] Deduced a trap composed of 172 places in 118 ms of which 2 ms to minimize.
[2024-05-28 02:19:32] [INFO ] Deduced a trap composed of 180 places in 120 ms of which 2 ms to minimize.
[2024-05-28 02:19:32] [INFO ] Deduced a trap composed of 165 places in 116 ms of which 2 ms to minimize.
[2024-05-28 02:19:32] [INFO ] Deduced a trap composed of 162 places in 120 ms of which 2 ms to minimize.
[2024-05-28 02:19:32] [INFO ] Deduced a trap composed of 187 places in 147 ms of which 2 ms to minimize.
[2024-05-28 02:19:33] [INFO ] Deduced a trap composed of 174 places in 123 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 348/1052 variables, and 103 constraints, problems are : Problem set: 0 solved, 712 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/350 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 712/712 constraints, Known Traps: 69/69 constraints]
Escalating to Integer solving :Problem set: 0 solved, 712 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 69/103 constraints. Problems are: Problem set: 0 solved, 712 unsolved
[2024-05-28 02:19:38] [INFO ] Deduced a trap composed of 175 places in 151 ms of which 2 ms to minimize.
[2024-05-28 02:19:38] [INFO ] Deduced a trap composed of 182 places in 145 ms of which 2 ms to minimize.
[2024-05-28 02:19:38] [INFO ] Deduced a trap composed of 177 places in 135 ms of which 2 ms to minimize.
[2024-05-28 02:19:38] [INFO ] Deduced a trap composed of 177 places in 116 ms of which 2 ms to minimize.
[2024-05-28 02:19:38] [INFO ] Deduced a trap composed of 182 places in 128 ms of which 2 ms to minimize.
[2024-05-28 02:19:38] [INFO ] Deduced a trap composed of 175 places in 117 ms of which 2 ms to minimize.
[2024-05-28 02:19:38] [INFO ] Deduced a trap composed of 185 places in 127 ms of which 2 ms to minimize.
[2024-05-28 02:19:39] [INFO ] Deduced a trap composed of 177 places in 129 ms of which 2 ms to minimize.
[2024-05-28 02:19:39] [INFO ] Deduced a trap composed of 178 places in 128 ms of which 2 ms to minimize.
[2024-05-28 02:19:39] [INFO ] Deduced a trap composed of 176 places in 127 ms of which 2 ms to minimize.
[2024-05-28 02:19:39] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 2 ms to minimize.
[2024-05-28 02:19:39] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 2 ms to minimize.
[2024-05-28 02:19:39] [INFO ] Deduced a trap composed of 140 places in 125 ms of which 2 ms to minimize.
[2024-05-28 02:19:39] [INFO ] Deduced a trap composed of 141 places in 121 ms of which 1 ms to minimize.
[2024-05-28 02:19:40] [INFO ] Deduced a trap composed of 137 places in 125 ms of which 2 ms to minimize.
[2024-05-28 02:19:40] [INFO ] Deduced a trap composed of 169 places in 122 ms of which 2 ms to minimize.
[2024-05-28 02:19:40] [INFO ] Deduced a trap composed of 146 places in 119 ms of which 2 ms to minimize.
[2024-05-28 02:19:40] [INFO ] Deduced a trap composed of 161 places in 122 ms of which 2 ms to minimize.
[2024-05-28 02:19:40] [INFO ] Deduced a trap composed of 172 places in 122 ms of which 2 ms to minimize.
[2024-05-28 02:19:40] [INFO ] Deduced a trap composed of 137 places in 127 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 20/123 constraints. Problems are: Problem set: 0 solved, 712 unsolved
[2024-05-28 02:19:43] [INFO ] Deduced a trap composed of 188 places in 144 ms of which 3 ms to minimize.
[2024-05-28 02:19:45] [INFO ] Deduced a trap composed of 213 places in 163 ms of which 2 ms to minimize.
[2024-05-28 02:19:46] [INFO ] Deduced a trap composed of 168 places in 172 ms of which 2 ms to minimize.
[2024-05-28 02:19:46] [INFO ] Deduced a trap composed of 162 places in 147 ms of which 3 ms to minimize.
[2024-05-28 02:19:46] [INFO ] Deduced a trap composed of 123 places in 147 ms of which 3 ms to minimize.
[2024-05-28 02:19:46] [INFO ] Deduced a trap composed of 166 places in 131 ms of which 3 ms to minimize.
[2024-05-28 02:19:47] [INFO ] Deduced a trap composed of 164 places in 129 ms of which 2 ms to minimize.
[2024-05-28 02:19:47] [INFO ] Deduced a trap composed of 145 places in 129 ms of which 2 ms to minimize.
[2024-05-28 02:19:47] [INFO ] Deduced a trap composed of 153 places in 129 ms of which 2 ms to minimize.
[2024-05-28 02:19:47] [INFO ] Deduced a trap composed of 150 places in 130 ms of which 2 ms to minimize.
[2024-05-28 02:19:47] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 2 ms to minimize.
[2024-05-28 02:19:47] [INFO ] Deduced a trap composed of 142 places in 140 ms of which 2 ms to minimize.
[2024-05-28 02:19:48] [INFO ] Deduced a trap composed of 175 places in 140 ms of which 2 ms to minimize.
[2024-05-28 02:19:48] [INFO ] Deduced a trap composed of 139 places in 139 ms of which 2 ms to minimize.
[2024-05-28 02:19:48] [INFO ] Deduced a trap composed of 172 places in 127 ms of which 2 ms to minimize.
[2024-05-28 02:19:48] [INFO ] Deduced a trap composed of 136 places in 123 ms of which 2 ms to minimize.
[2024-05-28 02:19:48] [INFO ] Deduced a trap composed of 175 places in 127 ms of which 2 ms to minimize.
[2024-05-28 02:19:48] [INFO ] Deduced a trap composed of 186 places in 127 ms of which 2 ms to minimize.
[2024-05-28 02:19:48] [INFO ] Deduced a trap composed of 172 places in 123 ms of which 2 ms to minimize.
[2024-05-28 02:19:48] [INFO ] Deduced a trap composed of 171 places in 120 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 712 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 348/1052 variables, and 143 constraints, problems are : Problem set: 0 solved, 712 unsolved in 20012 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/350 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/712 constraints, Known Traps: 109/109 constraints]
After SMT, in 40723ms problems are : Problem set: 0 solved, 712 unsolved
Search for dead transitions found 0 dead transitions in 40731ms
[2024-05-28 02:19:53] [INFO ] Flow matrix only has 702 transitions (discarded 12 similar events)
[2024-05-28 02:19:53] [INFO ] Invariant cache hit.
[2024-05-28 02:19:53] [INFO ] Implicit Places using invariants in 309 ms returned []
[2024-05-28 02:19:53] [INFO ] Flow matrix only has 702 transitions (discarded 12 similar events)
[2024-05-28 02:19:53] [INFO ] Invariant cache hit.
[2024-05-28 02:19:54] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 02:19:58] [INFO ] Implicit Places using invariants and state equation in 4549 ms returned []
Implicit Place search using SMT with State Equation took 4859 ms to find 0 implicit places.
[2024-05-28 02:19:58] [INFO ] Redundant transitions in 15 ms returned []
Running 712 sub problems to find dead transitions.
[2024-05-28 02:19:58] [INFO ] Flow matrix only has 702 transitions (discarded 12 similar events)
[2024-05-28 02:19:58] [INFO ] Invariant cache hit.
[2024-05-28 02:19:58] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 712 unsolved
[2024-05-28 02:20:02] [INFO ] Deduced a trap composed of 45 places in 127 ms of which 2 ms to minimize.
[2024-05-28 02:20:02] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 2 ms to minimize.
[2024-05-28 02:20:03] [INFO ] Deduced a trap composed of 45 places in 181 ms of which 2 ms to minimize.
[2024-05-28 02:20:03] [INFO ] Deduced a trap composed of 117 places in 136 ms of which 2 ms to minimize.
[2024-05-28 02:20:03] [INFO ] Deduced a trap composed of 45 places in 27 ms of which 1 ms to minimize.
[2024-05-28 02:20:03] [INFO ] Deduced a trap composed of 45 places in 25 ms of which 1 ms to minimize.
[2024-05-28 02:20:03] [INFO ] Deduced a trap composed of 168 places in 120 ms of which 2 ms to minimize.
[2024-05-28 02:20:03] [INFO ] Deduced a trap composed of 170 places in 128 ms of which 2 ms to minimize.
[2024-05-28 02:20:03] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 2 ms to minimize.
[2024-05-28 02:20:03] [INFO ] Deduced a trap composed of 122 places in 117 ms of which 2 ms to minimize.
[2024-05-28 02:20:03] [INFO ] Deduced a trap composed of 44 places in 27 ms of which 1 ms to minimize.
[2024-05-28 02:20:04] [INFO ] Deduced a trap composed of 180 places in 121 ms of which 2 ms to minimize.
[2024-05-28 02:20:04] [INFO ] Deduced a trap composed of 168 places in 123 ms of which 2 ms to minimize.
[2024-05-28 02:20:04] [INFO ] Deduced a trap composed of 155 places in 122 ms of which 2 ms to minimize.
[2024-05-28 02:20:04] [INFO ] Deduced a trap composed of 123 places in 117 ms of which 2 ms to minimize.
[2024-05-28 02:20:04] [INFO ] Deduced a trap composed of 172 places in 120 ms of which 1 ms to minimize.
[2024-05-28 02:20:04] [INFO ] Deduced a trap composed of 112 places in 118 ms of which 2 ms to minimize.
[2024-05-28 02:20:04] [INFO ] Deduced a trap composed of 135 places in 120 ms of which 2 ms to minimize.
[2024-05-28 02:20:05] [INFO ] Deduced a trap composed of 172 places in 117 ms of which 2 ms to minimize.
[2024-05-28 02:20:05] [INFO ] Deduced a trap composed of 122 places in 127 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 712 unsolved
[2024-05-28 02:20:05] [INFO ] Deduced a trap composed of 122 places in 145 ms of which 2 ms to minimize.
[2024-05-28 02:20:05] [INFO ] Deduced a trap composed of 169 places in 128 ms of which 2 ms to minimize.
[2024-05-28 02:20:05] [INFO ] Deduced a trap composed of 176 places in 131 ms of which 2 ms to minimize.
[2024-05-28 02:20:06] [INFO ] Deduced a trap composed of 193 places in 119 ms of which 2 ms to minimize.
[2024-05-28 02:20:06] [INFO ] Deduced a trap composed of 174 places in 118 ms of which 2 ms to minimize.
[2024-05-28 02:20:06] [INFO ] Deduced a trap composed of 183 places in 117 ms of which 2 ms to minimize.
[2024-05-28 02:20:06] [INFO ] Deduced a trap composed of 153 places in 118 ms of which 2 ms to minimize.
[2024-05-28 02:20:06] [INFO ] Deduced a trap composed of 172 places in 121 ms of which 2 ms to minimize.
[2024-05-28 02:20:06] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-05-28 02:20:06] [INFO ] Deduced a trap composed of 107 places in 124 ms of which 2 ms to minimize.
[2024-05-28 02:20:07] [INFO ] Deduced a trap composed of 112 places in 125 ms of which 2 ms to minimize.
[2024-05-28 02:20:07] [INFO ] Deduced a trap composed of 196 places in 120 ms of which 2 ms to minimize.
[2024-05-28 02:20:07] [INFO ] Deduced a trap composed of 186 places in 129 ms of which 2 ms to minimize.
[2024-05-28 02:20:07] [INFO ] Deduced a trap composed of 46 places in 177 ms of which 2 ms to minimize.
[2024-05-28 02:20:08] [INFO ] Deduced a trap composed of 184 places in 178 ms of which 2 ms to minimize.
[2024-05-28 02:20:08] [INFO ] Deduced a trap composed of 217 places in 153 ms of which 2 ms to minimize.
[2024-05-28 02:20:08] [INFO ] Deduced a trap composed of 206 places in 180 ms of which 2 ms to minimize.
[2024-05-28 02:20:08] [INFO ] Deduced a trap composed of 209 places in 150 ms of which 3 ms to minimize.
[2024-05-28 02:20:09] [INFO ] Deduced a trap composed of 122 places in 178 ms of which 2 ms to minimize.
[2024-05-28 02:20:09] [INFO ] Deduced a trap composed of 180 places in 142 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 712 unsolved
[2024-05-28 02:20:14] [INFO ] Deduced a trap composed of 168 places in 121 ms of which 2 ms to minimize.
[2024-05-28 02:20:14] [INFO ] Deduced a trap composed of 167 places in 115 ms of which 2 ms to minimize.
[2024-05-28 02:20:14] [INFO ] Deduced a trap composed of 175 places in 139 ms of which 2 ms to minimize.
[2024-05-28 02:20:14] [INFO ] Deduced a trap composed of 199 places in 143 ms of which 2 ms to minimize.
[2024-05-28 02:20:14] [INFO ] Deduced a trap composed of 180 places in 118 ms of which 2 ms to minimize.
[2024-05-28 02:20:14] [INFO ] Deduced a trap composed of 177 places in 137 ms of which 2 ms to minimize.
[2024-05-28 02:20:15] [INFO ] Deduced a trap composed of 167 places in 119 ms of which 2 ms to minimize.
[2024-05-28 02:20:15] [INFO ] Deduced a trap composed of 184 places in 114 ms of which 2 ms to minimize.
[2024-05-28 02:20:15] [INFO ] Deduced a trap composed of 158 places in 120 ms of which 2 ms to minimize.
[2024-05-28 02:20:15] [INFO ] Deduced a trap composed of 182 places in 128 ms of which 2 ms to minimize.
[2024-05-28 02:20:15] [INFO ] Deduced a trap composed of 172 places in 117 ms of which 2 ms to minimize.
[2024-05-28 02:20:15] [INFO ] Deduced a trap composed of 168 places in 118 ms of which 2 ms to minimize.
[2024-05-28 02:20:16] [INFO ] Deduced a trap composed of 178 places in 170 ms of which 2 ms to minimize.
[2024-05-28 02:20:16] [INFO ] Deduced a trap composed of 181 places in 117 ms of which 2 ms to minimize.
[2024-05-28 02:20:16] [INFO ] Deduced a trap composed of 181 places in 117 ms of which 2 ms to minimize.
[2024-05-28 02:20:16] [INFO ] Deduced a trap composed of 158 places in 117 ms of which 2 ms to minimize.
[2024-05-28 02:20:17] [INFO ] Deduced a trap composed of 169 places in 136 ms of which 2 ms to minimize.
[2024-05-28 02:20:17] [INFO ] Deduced a trap composed of 188 places in 128 ms of which 2 ms to minimize.
[2024-05-28 02:20:17] [INFO ] Deduced a trap composed of 181 places in 140 ms of which 2 ms to minimize.
[2024-05-28 02:20:17] [INFO ] Deduced a trap composed of 176 places in 141 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 712 unsolved
[2024-05-28 02:20:18] [INFO ] Deduced a trap composed of 177 places in 163 ms of which 2 ms to minimize.
[2024-05-28 02:20:18] [INFO ] Deduced a trap composed of 191 places in 139 ms of which 2 ms to minimize.
[2024-05-28 02:20:18] [INFO ] Deduced a trap composed of 170 places in 120 ms of which 2 ms to minimize.
[2024-05-28 02:20:18] [INFO ] Deduced a trap composed of 172 places in 120 ms of which 2 ms to minimize.
[2024-05-28 02:20:19] [INFO ] Deduced a trap composed of 180 places in 118 ms of which 2 ms to minimize.
[2024-05-28 02:20:19] [INFO ] Deduced a trap composed of 165 places in 178 ms of which 2 ms to minimize.
[2024-05-28 02:20:19] [INFO ] Deduced a trap composed of 162 places in 136 ms of which 2 ms to minimize.
[2024-05-28 02:20:19] [INFO ] Deduced a trap composed of 187 places in 137 ms of which 2 ms to minimize.
[2024-05-28 02:20:20] [INFO ] Deduced a trap composed of 174 places in 143 ms of which 2 ms to minimize.
[2024-05-28 02:20:20] [INFO ] Deduced a trap composed of 173 places in 161 ms of which 2 ms to minimize.
[2024-05-28 02:20:21] [INFO ] Deduced a trap composed of 192 places in 159 ms of which 3 ms to minimize.
[2024-05-28 02:20:21] [INFO ] Deduced a trap composed of 112 places in 156 ms of which 2 ms to minimize.
[2024-05-28 02:20:21] [INFO ] Deduced a trap composed of 175 places in 204 ms of which 3 ms to minimize.
[2024-05-28 02:20:21] [INFO ] Deduced a trap composed of 168 places in 161 ms of which 3 ms to minimize.
[2024-05-28 02:20:21] [INFO ] Deduced a trap composed of 181 places in 153 ms of which 2 ms to minimize.
[2024-05-28 02:20:22] [INFO ] Deduced a trap composed of 189 places in 154 ms of which 2 ms to minimize.
[2024-05-28 02:20:22] [INFO ] Deduced a trap composed of 170 places in 127 ms of which 2 ms to minimize.
[2024-05-28 02:20:22] [INFO ] Deduced a trap composed of 159 places in 138 ms of which 2 ms to minimize.
[2024-05-28 02:20:22] [INFO ] Deduced a trap composed of 181 places in 136 ms of which 2 ms to minimize.
[2024-05-28 02:20:22] [INFO ] Deduced a trap composed of 173 places in 184 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 712 unsolved
[2024-05-28 02:20:24] [INFO ] Deduced a trap composed of 172 places in 164 ms of which 2 ms to minimize.
[2024-05-28 02:20:24] [INFO ] Deduced a trap composed of 181 places in 141 ms of which 2 ms to minimize.
[2024-05-28 02:20:24] [INFO ] Deduced a trap composed of 157 places in 168 ms of which 3 ms to minimize.
[2024-05-28 02:20:25] [INFO ] Deduced a trap composed of 167 places in 134 ms of which 2 ms to minimize.
[2024-05-28 02:20:25] [INFO ] Deduced a trap composed of 182 places in 115 ms of which 2 ms to minimize.
[2024-05-28 02:20:25] [INFO ] Deduced a trap composed of 172 places in 117 ms of which 2 ms to minimize.
[2024-05-28 02:20:25] [INFO ] Deduced a trap composed of 174 places in 152 ms of which 2 ms to minimize.
[2024-05-28 02:20:26] [INFO ] Deduced a trap composed of 173 places in 168 ms of which 2 ms to minimize.
[2024-05-28 02:20:26] [INFO ] Deduced a trap composed of 195 places in 160 ms of which 3 ms to minimize.
[2024-05-28 02:20:26] [INFO ] Deduced a trap composed of 177 places in 152 ms of which 3 ms to minimize.
[2024-05-28 02:20:26] [INFO ] Deduced a trap composed of 169 places in 138 ms of which 3 ms to minimize.
[2024-05-28 02:20:27] [INFO ] Deduced a trap composed of 179 places in 121 ms of which 2 ms to minimize.
[2024-05-28 02:20:27] [INFO ] Deduced a trap composed of 175 places in 133 ms of which 2 ms to minimize.
[2024-05-28 02:20:27] [INFO ] Deduced a trap composed of 185 places in 128 ms of which 2 ms to minimize.
[2024-05-28 02:20:27] [INFO ] Deduced a trap composed of 187 places in 116 ms of which 2 ms to minimize.
[2024-05-28 02:20:27] [INFO ] Deduced a trap composed of 177 places in 117 ms of which 2 ms to minimize.
[2024-05-28 02:20:27] [INFO ] Deduced a trap composed of 158 places in 116 ms of which 2 ms to minimize.
[2024-05-28 02:20:27] [INFO ] Deduced a trap composed of 175 places in 115 ms of which 2 ms to minimize.
[2024-05-28 02:20:27] [INFO ] Deduced a trap composed of 170 places in 116 ms of which 2 ms to minimize.
[2024-05-28 02:20:28] [INFO ] Deduced a trap composed of 193 places in 118 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 712 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 348/1052 variables, and 134 constraints, problems are : Problem set: 0 solved, 712 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/350 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 712/712 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 712 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 100/134 constraints. Problems are: Problem set: 0 solved, 712 unsolved
[2024-05-28 02:20:34] [INFO ] Deduced a trap composed of 180 places in 177 ms of which 2 ms to minimize.
[2024-05-28 02:20:34] [INFO ] Deduced a trap composed of 178 places in 156 ms of which 3 ms to minimize.
[2024-05-28 02:20:35] [INFO ] Deduced a trap composed of 183 places in 153 ms of which 3 ms to minimize.
[2024-05-28 02:20:35] [INFO ] Deduced a trap composed of 192 places in 153 ms of which 3 ms to minimize.
[2024-05-28 02:20:35] [INFO ] Deduced a trap composed of 170 places in 154 ms of which 2 ms to minimize.
[2024-05-28 02:20:35] [INFO ] Deduced a trap composed of 184 places in 137 ms of which 3 ms to minimize.
[2024-05-28 02:20:35] [INFO ] Deduced a trap composed of 180 places in 118 ms of which 2 ms to minimize.
[2024-05-28 02:20:35] [INFO ] Deduced a trap composed of 176 places in 119 ms of which 2 ms to minimize.
[2024-05-28 02:20:35] [INFO ] Deduced a trap composed of 184 places in 140 ms of which 2 ms to minimize.
[2024-05-28 02:20:36] [INFO ] Deduced a trap composed of 169 places in 132 ms of which 2 ms to minimize.
[2024-05-28 02:20:36] [INFO ] Deduced a trap composed of 185 places in 118 ms of which 2 ms to minimize.
[2024-05-28 02:20:36] [INFO ] Deduced a trap composed of 183 places in 117 ms of which 2 ms to minimize.
[2024-05-28 02:20:36] [INFO ] Deduced a trap composed of 178 places in 116 ms of which 2 ms to minimize.
[2024-05-28 02:20:36] [INFO ] Deduced a trap composed of 173 places in 121 ms of which 2 ms to minimize.
[2024-05-28 02:20:36] [INFO ] Deduced a trap composed of 175 places in 119 ms of which 2 ms to minimize.
[2024-05-28 02:20:36] [INFO ] Deduced a trap composed of 169 places in 122 ms of which 2 ms to minimize.
[2024-05-28 02:20:37] [INFO ] Deduced a trap composed of 188 places in 129 ms of which 3 ms to minimize.
[2024-05-28 02:20:37] [INFO ] Deduced a trap composed of 181 places in 138 ms of which 6 ms to minimize.
[2024-05-28 02:20:37] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 2 ms to minimize.
[2024-05-28 02:20:37] [INFO ] Deduced a trap composed of 170 places in 167 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 712 unsolved
[2024-05-28 02:20:45] [INFO ] Deduced a trap composed of 198 places in 147 ms of which 2 ms to minimize.
[2024-05-28 02:20:45] [INFO ] Deduced a trap composed of 183 places in 129 ms of which 2 ms to minimize.
[2024-05-28 02:20:46] [INFO ] Deduced a trap composed of 169 places in 161 ms of which 2 ms to minimize.
[2024-05-28 02:20:46] [INFO ] Deduced a trap composed of 192 places in 117 ms of which 2 ms to minimize.
[2024-05-28 02:20:46] [INFO ] Deduced a trap composed of 176 places in 112 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 5/159 constraints. Problems are: Problem set: 0 solved, 712 unsolved
[2024-05-28 02:20:55] [INFO ] Deduced a trap composed of 185 places in 115 ms of which 2 ms to minimize.
[2024-05-28 02:20:56] [INFO ] Deduced a trap composed of 185 places in 200 ms of which 2 ms to minimize.
[2024-05-28 02:20:56] [INFO ] Deduced a trap composed of 159 places in 175 ms of which 2 ms to minimize.
[2024-05-28 02:20:56] [INFO ] Deduced a trap composed of 177 places in 177 ms of which 3 ms to minimize.
[2024-05-28 02:20:57] [INFO ] Deduced a trap composed of 163 places in 182 ms of which 3 ms to minimize.
[2024-05-28 02:20:57] [INFO ] Deduced a trap composed of 171 places in 155 ms of which 2 ms to minimize.
[2024-05-28 02:20:57] [INFO ] Deduced a trap composed of 188 places in 170 ms of which 3 ms to minimize.
[2024-05-28 02:20:57] [INFO ] Deduced a trap composed of 3 places in 193 ms of which 3 ms to minimize.
[2024-05-28 02:20:57] [INFO ] Deduced a trap composed of 164 places in 169 ms of which 2 ms to minimize.
[2024-05-28 02:20:58] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 2 ms to minimize.
[2024-05-28 02:20:58] [INFO ] Deduced a trap composed of 166 places in 126 ms of which 2 ms to minimize.
[2024-05-28 02:20:58] [INFO ] Deduced a trap composed of 172 places in 141 ms of which 2 ms to minimize.
[2024-05-28 02:20:58] [INFO ] Deduced a trap composed of 170 places in 210 ms of which 3 ms to minimize.
[2024-05-28 02:20:58] [INFO ] Deduced a trap composed of 149 places in 142 ms of which 2 ms to minimize.
[2024-05-28 02:20:59] [INFO ] Deduced a trap composed of 167 places in 142 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 348/1052 variables, and 174 constraints, problems are : Problem set: 0 solved, 712 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/350 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/712 constraints, Known Traps: 140/140 constraints]
After SMT, in 60710ms problems are : Problem set: 0 solved, 712 unsolved
Search for dead transitions found 0 dead transitions in 60721ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 106353 ms. Remains : 350/350 places, 714/714 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 722 steps (0 resets) in 9 ms. (72 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 33219 reset in 188 ms.
Product exploration explored 100000 steps with 33125 reset in 200 ms.
Support contains 2 out of 350 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 350/350 places, 714/714 transitions.
Applied a total of 0 rules in 11 ms. Remains 350 /350 variables (removed 0) and now considering 714/714 (removed 0) transitions.
Running 712 sub problems to find dead transitions.
[2024-05-28 02:20:59] [INFO ] Flow matrix only has 702 transitions (discarded 12 similar events)
[2024-05-28 02:20:59] [INFO ] Invariant cache hit.
[2024-05-28 02:20:59] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 712 unsolved
[2024-05-28 02:21:04] [INFO ] Deduced a trap composed of 45 places in 115 ms of which 2 ms to minimize.
[2024-05-28 02:21:04] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 2 ms to minimize.
[2024-05-28 02:21:04] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 2 ms to minimize.
[2024-05-28 02:21:04] [INFO ] Deduced a trap composed of 117 places in 120 ms of which 2 ms to minimize.
[2024-05-28 02:21:04] [INFO ] Deduced a trap composed of 45 places in 28 ms of which 1 ms to minimize.
[2024-05-28 02:21:04] [INFO ] Deduced a trap composed of 45 places in 28 ms of which 1 ms to minimize.
[2024-05-28 02:21:04] [INFO ] Deduced a trap composed of 168 places in 152 ms of which 2 ms to minimize.
[2024-05-28 02:21:05] [INFO ] Deduced a trap composed of 170 places in 127 ms of which 2 ms to minimize.
[2024-05-28 02:21:05] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 3 ms to minimize.
[2024-05-28 02:21:05] [INFO ] Deduced a trap composed of 122 places in 154 ms of which 2 ms to minimize.
[2024-05-28 02:21:05] [INFO ] Deduced a trap composed of 44 places in 27 ms of which 0 ms to minimize.
[2024-05-28 02:21:05] [INFO ] Deduced a trap composed of 180 places in 144 ms of which 2 ms to minimize.
[2024-05-28 02:21:05] [INFO ] Deduced a trap composed of 168 places in 130 ms of which 2 ms to minimize.
[2024-05-28 02:21:06] [INFO ] Deduced a trap composed of 155 places in 181 ms of which 2 ms to minimize.
[2024-05-28 02:21:06] [INFO ] Deduced a trap composed of 123 places in 140 ms of which 3 ms to minimize.
[2024-05-28 02:21:06] [INFO ] Deduced a trap composed of 172 places in 140 ms of which 2 ms to minimize.
[2024-05-28 02:21:06] [INFO ] Deduced a trap composed of 112 places in 150 ms of which 3 ms to minimize.
[2024-05-28 02:21:06] [INFO ] Deduced a trap composed of 135 places in 147 ms of which 2 ms to minimize.
[2024-05-28 02:21:06] [INFO ] Deduced a trap composed of 172 places in 120 ms of which 1 ms to minimize.
[2024-05-28 02:21:06] [INFO ] Deduced a trap composed of 122 places in 117 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 712 unsolved
[2024-05-28 02:21:07] [INFO ] Deduced a trap composed of 122 places in 122 ms of which 2 ms to minimize.
[2024-05-28 02:21:07] [INFO ] Deduced a trap composed of 169 places in 127 ms of which 2 ms to minimize.
[2024-05-28 02:21:07] [INFO ] Deduced a trap composed of 176 places in 115 ms of which 2 ms to minimize.
[2024-05-28 02:21:07] [INFO ] Deduced a trap composed of 193 places in 117 ms of which 2 ms to minimize.
[2024-05-28 02:21:07] [INFO ] Deduced a trap composed of 174 places in 114 ms of which 2 ms to minimize.
[2024-05-28 02:21:08] [INFO ] Deduced a trap composed of 183 places in 119 ms of which 2 ms to minimize.
[2024-05-28 02:21:08] [INFO ] Deduced a trap composed of 153 places in 128 ms of which 2 ms to minimize.
[2024-05-28 02:21:08] [INFO ] Deduced a trap composed of 172 places in 119 ms of which 2 ms to minimize.
[2024-05-28 02:21:08] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2024-05-28 02:21:08] [INFO ] Deduced a trap composed of 107 places in 123 ms of which 1 ms to minimize.
[2024-05-28 02:21:08] [INFO ] Deduced a trap composed of 112 places in 123 ms of which 2 ms to minimize.
[2024-05-28 02:21:09] [INFO ] Deduced a trap composed of 196 places in 166 ms of which 2 ms to minimize.
[2024-05-28 02:21:09] [INFO ] Deduced a trap composed of 186 places in 125 ms of which 2 ms to minimize.
[2024-05-28 02:21:09] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 2 ms to minimize.
[2024-05-28 02:21:09] [INFO ] Deduced a trap composed of 184 places in 121 ms of which 2 ms to minimize.
[2024-05-28 02:21:09] [INFO ] Deduced a trap composed of 217 places in 118 ms of which 2 ms to minimize.
[2024-05-28 02:21:10] [INFO ] Deduced a trap composed of 206 places in 152 ms of which 2 ms to minimize.
[2024-05-28 02:21:10] [INFO ] Deduced a trap composed of 209 places in 119 ms of which 2 ms to minimize.
[2024-05-28 02:21:10] [INFO ] Deduced a trap composed of 122 places in 164 ms of which 3 ms to minimize.
[2024-05-28 02:21:10] [INFO ] Deduced a trap composed of 180 places in 178 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 712 unsolved
[2024-05-28 02:21:15] [INFO ] Deduced a trap composed of 168 places in 180 ms of which 3 ms to minimize.
[2024-05-28 02:21:15] [INFO ] Deduced a trap composed of 167 places in 180 ms of which 3 ms to minimize.
[2024-05-28 02:21:16] [INFO ] Deduced a trap composed of 175 places in 155 ms of which 2 ms to minimize.
[2024-05-28 02:21:16] [INFO ] Deduced a trap composed of 199 places in 156 ms of which 2 ms to minimize.
[2024-05-28 02:21:16] [INFO ] Deduced a trap composed of 180 places in 153 ms of which 2 ms to minimize.
[2024-05-28 02:21:16] [INFO ] Deduced a trap composed of 177 places in 152 ms of which 2 ms to minimize.
[2024-05-28 02:21:16] [INFO ] Deduced a trap composed of 167 places in 128 ms of which 2 ms to minimize.
[2024-05-28 02:21:16] [INFO ] Deduced a trap composed of 184 places in 136 ms of which 2 ms to minimize.
[2024-05-28 02:21:17] [INFO ] Deduced a trap composed of 158 places in 164 ms of which 2 ms to minimize.
[2024-05-28 02:21:17] [INFO ] Deduced a trap composed of 182 places in 121 ms of which 2 ms to minimize.
[2024-05-28 02:21:17] [INFO ] Deduced a trap composed of 172 places in 122 ms of which 2 ms to minimize.
[2024-05-28 02:21:17] [INFO ] Deduced a trap composed of 168 places in 119 ms of which 2 ms to minimize.
[2024-05-28 02:21:18] [INFO ] Deduced a trap composed of 178 places in 134 ms of which 2 ms to minimize.
[2024-05-28 02:21:18] [INFO ] Deduced a trap composed of 181 places in 116 ms of which 2 ms to minimize.
[2024-05-28 02:21:18] [INFO ] Deduced a trap composed of 181 places in 121 ms of which 2 ms to minimize.
[2024-05-28 02:21:18] [INFO ] Deduced a trap composed of 158 places in 122 ms of which 2 ms to minimize.
[2024-05-28 02:21:18] [INFO ] Deduced a trap composed of 169 places in 120 ms of which 2 ms to minimize.
[2024-05-28 02:21:19] [INFO ] Deduced a trap composed of 188 places in 157 ms of which 2 ms to minimize.
[2024-05-28 02:21:19] [INFO ] Deduced a trap composed of 181 places in 118 ms of which 2 ms to minimize.
[2024-05-28 02:21:19] [INFO ] Deduced a trap composed of 176 places in 119 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 712 unsolved
[2024-05-28 02:21:20] [INFO ] Deduced a trap composed of 177 places in 156 ms of which 2 ms to minimize.
[2024-05-28 02:21:20] [INFO ] Deduced a trap composed of 191 places in 138 ms of which 3 ms to minimize.
[2024-05-28 02:21:20] [INFO ] Deduced a trap composed of 170 places in 136 ms of which 3 ms to minimize.
[2024-05-28 02:21:20] [INFO ] Deduced a trap composed of 172 places in 139 ms of which 2 ms to minimize.
[2024-05-28 02:21:20] [INFO ] Deduced a trap composed of 180 places in 136 ms of which 2 ms to minimize.
SMT process timed out in 20863ms, After SMT, problems are : Problem set: 0 solved, 712 unsolved
Search for dead transitions found 0 dead transitions in 20870ms
[2024-05-28 02:21:20] [INFO ] Flow matrix only has 702 transitions (discarded 12 similar events)
[2024-05-28 02:21:20] [INFO ] Invariant cache hit.
[2024-05-28 02:21:21] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-28 02:21:21] [INFO ] Flow matrix only has 702 transitions (discarded 12 similar events)
[2024-05-28 02:21:21] [INFO ] Invariant cache hit.
[2024-05-28 02:21:21] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 02:21:25] [INFO ] Implicit Places using invariants and state equation in 4220 ms returned []
Implicit Place search using SMT with State Equation took 4515 ms to find 0 implicit places.
[2024-05-28 02:21:25] [INFO ] Redundant transitions in 10 ms returned []
Running 712 sub problems to find dead transitions.
[2024-05-28 02:21:25] [INFO ] Flow matrix only has 702 transitions (discarded 12 similar events)
[2024-05-28 02:21:25] [INFO ] Invariant cache hit.
[2024-05-28 02:21:25] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 712 unsolved
[2024-05-28 02:21:29] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 2 ms to minimize.
[2024-05-28 02:21:30] [INFO ] Deduced a trap composed of 44 places in 180 ms of which 2 ms to minimize.
[2024-05-28 02:21:30] [INFO ] Deduced a trap composed of 45 places in 127 ms of which 2 ms to minimize.
[2024-05-28 02:21:30] [INFO ] Deduced a trap composed of 117 places in 133 ms of which 2 ms to minimize.
[2024-05-28 02:21:30] [INFO ] Deduced a trap composed of 45 places in 29 ms of which 1 ms to minimize.
[2024-05-28 02:21:30] [INFO ] Deduced a trap composed of 45 places in 24 ms of which 1 ms to minimize.
[2024-05-28 02:21:30] [INFO ] Deduced a trap composed of 168 places in 124 ms of which 2 ms to minimize.
[2024-05-28 02:21:30] [INFO ] Deduced a trap composed of 170 places in 130 ms of which 2 ms to minimize.
[2024-05-28 02:21:30] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 2 ms to minimize.
[2024-05-28 02:21:31] [INFO ] Deduced a trap composed of 122 places in 136 ms of which 3 ms to minimize.
[2024-05-28 02:21:31] [INFO ] Deduced a trap composed of 44 places in 30 ms of which 1 ms to minimize.
[2024-05-28 02:21:31] [INFO ] Deduced a trap composed of 180 places in 168 ms of which 3 ms to minimize.
[2024-05-28 02:21:31] [INFO ] Deduced a trap composed of 168 places in 119 ms of which 2 ms to minimize.
[2024-05-28 02:21:31] [INFO ] Deduced a trap composed of 155 places in 121 ms of which 2 ms to minimize.
[2024-05-28 02:21:31] [INFO ] Deduced a trap composed of 123 places in 117 ms of which 2 ms to minimize.
[2024-05-28 02:21:31] [INFO ] Deduced a trap composed of 172 places in 115 ms of which 1 ms to minimize.
[2024-05-28 02:21:32] [INFO ] Deduced a trap composed of 112 places in 122 ms of which 2 ms to minimize.
[2024-05-28 02:21:32] [INFO ] Deduced a trap composed of 135 places in 120 ms of which 2 ms to minimize.
[2024-05-28 02:21:32] [INFO ] Deduced a trap composed of 172 places in 117 ms of which 2 ms to minimize.
[2024-05-28 02:21:32] [INFO ] Deduced a trap composed of 122 places in 116 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 712 unsolved
[2024-05-28 02:21:32] [INFO ] Deduced a trap composed of 122 places in 153 ms of which 3 ms to minimize.
[2024-05-28 02:21:33] [INFO ] Deduced a trap composed of 169 places in 137 ms of which 2 ms to minimize.
[2024-05-28 02:21:33] [INFO ] Deduced a trap composed of 176 places in 137 ms of which 2 ms to minimize.
[2024-05-28 02:21:33] [INFO ] Deduced a trap composed of 193 places in 118 ms of which 2 ms to minimize.
[2024-05-28 02:21:33] [INFO ] Deduced a trap composed of 174 places in 120 ms of which 2 ms to minimize.
[2024-05-28 02:21:33] [INFO ] Deduced a trap composed of 183 places in 134 ms of which 2 ms to minimize.
[2024-05-28 02:21:33] [INFO ] Deduced a trap composed of 153 places in 134 ms of which 2 ms to minimize.
[2024-05-28 02:21:34] [INFO ] Deduced a trap composed of 172 places in 128 ms of which 2 ms to minimize.
[2024-05-28 02:21:34] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2024-05-28 02:21:34] [INFO ] Deduced a trap composed of 107 places in 118 ms of which 2 ms to minimize.
[2024-05-28 02:21:34] [INFO ] Deduced a trap composed of 112 places in 169 ms of which 2 ms to minimize.
[2024-05-28 02:21:34] [INFO ] Deduced a trap composed of 196 places in 166 ms of which 3 ms to minimize.
[2024-05-28 02:21:35] [INFO ] Deduced a trap composed of 186 places in 117 ms of which 2 ms to minimize.
[2024-05-28 02:21:35] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 2 ms to minimize.
[2024-05-28 02:21:35] [INFO ] Deduced a trap composed of 184 places in 167 ms of which 2 ms to minimize.
[2024-05-28 02:21:35] [INFO ] Deduced a trap composed of 217 places in 118 ms of which 3 ms to minimize.
[2024-05-28 02:21:35] [INFO ] Deduced a trap composed of 206 places in 136 ms of which 3 ms to minimize.
[2024-05-28 02:21:35] [INFO ] Deduced a trap composed of 209 places in 132 ms of which 2 ms to minimize.
[2024-05-28 02:21:36] [INFO ] Deduced a trap composed of 122 places in 135 ms of which 2 ms to minimize.
[2024-05-28 02:21:36] [INFO ] Deduced a trap composed of 180 places in 128 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 712 unsolved
[2024-05-28 02:21:41] [INFO ] Deduced a trap composed of 168 places in 164 ms of which 2 ms to minimize.
[2024-05-28 02:21:41] [INFO ] Deduced a trap composed of 167 places in 143 ms of which 2 ms to minimize.
[2024-05-28 02:21:41] [INFO ] Deduced a trap composed of 175 places in 150 ms of which 2 ms to minimize.
[2024-05-28 02:21:41] [INFO ] Deduced a trap composed of 199 places in 144 ms of which 3 ms to minimize.
[2024-05-28 02:21:41] [INFO ] Deduced a trap composed of 180 places in 135 ms of which 3 ms to minimize.
[2024-05-28 02:21:41] [INFO ] Deduced a trap composed of 177 places in 132 ms of which 2 ms to minimize.
[2024-05-28 02:21:42] [INFO ] Deduced a trap composed of 167 places in 130 ms of which 2 ms to minimize.
[2024-05-28 02:21:42] [INFO ] Deduced a trap composed of 184 places in 138 ms of which 3 ms to minimize.
[2024-05-28 02:21:42] [INFO ] Deduced a trap composed of 158 places in 152 ms of which 3 ms to minimize.
[2024-05-28 02:21:42] [INFO ] Deduced a trap composed of 182 places in 138 ms of which 3 ms to minimize.
[2024-05-28 02:21:42] [INFO ] Deduced a trap composed of 172 places in 136 ms of which 2 ms to minimize.
[2024-05-28 02:21:42] [INFO ] Deduced a trap composed of 168 places in 119 ms of which 2 ms to minimize.
[2024-05-28 02:21:43] [INFO ] Deduced a trap composed of 178 places in 171 ms of which 3 ms to minimize.
[2024-05-28 02:21:43] [INFO ] Deduced a trap composed of 181 places in 115 ms of which 2 ms to minimize.
[2024-05-28 02:21:43] [INFO ] Deduced a trap composed of 181 places in 164 ms of which 2 ms to minimize.
[2024-05-28 02:21:44] [INFO ] Deduced a trap composed of 158 places in 138 ms of which 2 ms to minimize.
[2024-05-28 02:21:44] [INFO ] Deduced a trap composed of 169 places in 133 ms of which 2 ms to minimize.
[2024-05-28 02:21:44] [INFO ] Deduced a trap composed of 188 places in 197 ms of which 3 ms to minimize.
[2024-05-28 02:21:44] [INFO ] Deduced a trap composed of 181 places in 154 ms of which 3 ms to minimize.
[2024-05-28 02:21:45] [INFO ] Deduced a trap composed of 176 places in 125 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 712 unsolved
[2024-05-28 02:21:45] [INFO ] Deduced a trap composed of 177 places in 133 ms of which 2 ms to minimize.
[2024-05-28 02:21:46] [INFO ] Deduced a trap composed of 191 places in 133 ms of which 2 ms to minimize.
[2024-05-28 02:21:46] [INFO ] Deduced a trap composed of 170 places in 139 ms of which 3 ms to minimize.
[2024-05-28 02:21:46] [INFO ] Deduced a trap composed of 172 places in 140 ms of which 3 ms to minimize.
[2024-05-28 02:21:46] [INFO ] Deduced a trap composed of 180 places in 138 ms of which 2 ms to minimize.
[2024-05-28 02:21:46] [INFO ] Deduced a trap composed of 165 places in 153 ms of which 2 ms to minimize.
[2024-05-28 02:21:46] [INFO ] Deduced a trap composed of 162 places in 153 ms of which 3 ms to minimize.
[2024-05-28 02:21:47] [INFO ] Deduced a trap composed of 187 places in 160 ms of which 2 ms to minimize.
[2024-05-28 02:21:47] [INFO ] Deduced a trap composed of 174 places in 150 ms of which 3 ms to minimize.
[2024-05-28 02:21:48] [INFO ] Deduced a trap composed of 173 places in 166 ms of which 2 ms to minimize.
[2024-05-28 02:21:48] [INFO ] Deduced a trap composed of 192 places in 147 ms of which 2 ms to minimize.
[2024-05-28 02:21:48] [INFO ] Deduced a trap composed of 112 places in 138 ms of which 2 ms to minimize.
[2024-05-28 02:21:48] [INFO ] Deduced a trap composed of 175 places in 137 ms of which 2 ms to minimize.
[2024-05-28 02:21:49] [INFO ] Deduced a trap composed of 168 places in 144 ms of which 2 ms to minimize.
[2024-05-28 02:21:49] [INFO ] Deduced a trap composed of 181 places in 159 ms of which 2 ms to minimize.
[2024-05-28 02:21:49] [INFO ] Deduced a trap composed of 189 places in 123 ms of which 2 ms to minimize.
[2024-05-28 02:21:49] [INFO ] Deduced a trap composed of 170 places in 140 ms of which 2 ms to minimize.
[2024-05-28 02:21:49] [INFO ] Deduced a trap composed of 159 places in 139 ms of which 3 ms to minimize.
[2024-05-28 02:21:49] [INFO ] Deduced a trap composed of 181 places in 166 ms of which 3 ms to minimize.
[2024-05-28 02:21:50] [INFO ] Deduced a trap composed of 173 places in 156 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 712 unsolved
[2024-05-28 02:21:51] [INFO ] Deduced a trap composed of 172 places in 161 ms of which 2 ms to minimize.
[2024-05-28 02:21:51] [INFO ] Deduced a trap composed of 181 places in 168 ms of which 2 ms to minimize.
[2024-05-28 02:21:52] [INFO ] Deduced a trap composed of 157 places in 178 ms of which 2 ms to minimize.
[2024-05-28 02:21:52] [INFO ] Deduced a trap composed of 167 places in 176 ms of which 3 ms to minimize.
[2024-05-28 02:21:52] [INFO ] Deduced a trap composed of 182 places in 152 ms of which 3 ms to minimize.
[2024-05-28 02:21:52] [INFO ] Deduced a trap composed of 172 places in 136 ms of which 2 ms to minimize.
[2024-05-28 02:21:53] [INFO ] Deduced a trap composed of 174 places in 185 ms of which 3 ms to minimize.
[2024-05-28 02:21:53] [INFO ] Deduced a trap composed of 173 places in 139 ms of which 2 ms to minimize.
[2024-05-28 02:21:53] [INFO ] Deduced a trap composed of 195 places in 136 ms of which 2 ms to minimize.
[2024-05-28 02:21:54] [INFO ] Deduced a trap composed of 177 places in 139 ms of which 3 ms to minimize.
[2024-05-28 02:21:54] [INFO ] Deduced a trap composed of 169 places in 138 ms of which 3 ms to minimize.
[2024-05-28 02:21:54] [INFO ] Deduced a trap composed of 179 places in 140 ms of which 2 ms to minimize.
[2024-05-28 02:21:54] [INFO ] Deduced a trap composed of 175 places in 136 ms of which 2 ms to minimize.
[2024-05-28 02:21:54] [INFO ] Deduced a trap composed of 185 places in 141 ms of which 2 ms to minimize.
[2024-05-28 02:21:54] [INFO ] Deduced a trap composed of 187 places in 134 ms of which 2 ms to minimize.
[2024-05-28 02:21:54] [INFO ] Deduced a trap composed of 177 places in 115 ms of which 2 ms to minimize.
[2024-05-28 02:21:55] [INFO ] Deduced a trap composed of 158 places in 125 ms of which 2 ms to minimize.
[2024-05-28 02:21:55] [INFO ] Deduced a trap composed of 175 places in 118 ms of which 2 ms to minimize.
[2024-05-28 02:21:55] [INFO ] Deduced a trap composed of 170 places in 116 ms of which 2 ms to minimize.
[2024-05-28 02:21:55] [INFO ] Deduced a trap composed of 193 places in 121 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 712 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 348/1052 variables, and 134 constraints, problems are : Problem set: 0 solved, 712 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/350 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 712/712 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 712 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 100/134 constraints. Problems are: Problem set: 0 solved, 712 unsolved
[2024-05-28 02:22:01] [INFO ] Deduced a trap composed of 180 places in 163 ms of which 2 ms to minimize.
[2024-05-28 02:22:01] [INFO ] Deduced a trap composed of 178 places in 171 ms of which 3 ms to minimize.
[2024-05-28 02:22:02] [INFO ] Deduced a trap composed of 183 places in 156 ms of which 2 ms to minimize.
[2024-05-28 02:22:02] [INFO ] Deduced a trap composed of 192 places in 152 ms of which 3 ms to minimize.
[2024-05-28 02:22:02] [INFO ] Deduced a trap composed of 170 places in 151 ms of which 3 ms to minimize.
[2024-05-28 02:22:02] [INFO ] Deduced a trap composed of 184 places in 150 ms of which 2 ms to minimize.
[2024-05-28 02:22:02] [INFO ] Deduced a trap composed of 180 places in 127 ms of which 2 ms to minimize.
[2024-05-28 02:22:02] [INFO ] Deduced a trap composed of 176 places in 117 ms of which 2 ms to minimize.
[2024-05-28 02:22:02] [INFO ] Deduced a trap composed of 184 places in 119 ms of which 1 ms to minimize.
[2024-05-28 02:22:03] [INFO ] Deduced a trap composed of 169 places in 127 ms of which 2 ms to minimize.
[2024-05-28 02:22:03] [INFO ] Deduced a trap composed of 185 places in 116 ms of which 2 ms to minimize.
[2024-05-28 02:22:03] [INFO ] Deduced a trap composed of 183 places in 134 ms of which 2 ms to minimize.
[2024-05-28 02:22:03] [INFO ] Deduced a trap composed of 178 places in 130 ms of which 2 ms to minimize.
[2024-05-28 02:22:03] [INFO ] Deduced a trap composed of 173 places in 118 ms of which 2 ms to minimize.
[2024-05-28 02:22:03] [INFO ] Deduced a trap composed of 175 places in 113 ms of which 2 ms to minimize.
[2024-05-28 02:22:03] [INFO ] Deduced a trap composed of 169 places in 119 ms of which 2 ms to minimize.
[2024-05-28 02:22:04] [INFO ] Deduced a trap composed of 188 places in 119 ms of which 2 ms to minimize.
[2024-05-28 02:22:04] [INFO ] Deduced a trap composed of 181 places in 115 ms of which 2 ms to minimize.
[2024-05-28 02:22:04] [INFO ] Deduced a trap composed of 3 places in 184 ms of which 3 ms to minimize.
[2024-05-28 02:22:04] [INFO ] Deduced a trap composed of 170 places in 128 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 712 unsolved
[2024-05-28 02:22:12] [INFO ] Deduced a trap composed of 198 places in 180 ms of which 2 ms to minimize.
[2024-05-28 02:22:13] [INFO ] Deduced a trap composed of 183 places in 188 ms of which 2 ms to minimize.
[2024-05-28 02:22:13] [INFO ] Deduced a trap composed of 169 places in 144 ms of which 2 ms to minimize.
[2024-05-28 02:22:13] [INFO ] Deduced a trap composed of 192 places in 141 ms of which 2 ms to minimize.
[2024-05-28 02:22:13] [INFO ] Deduced a trap composed of 176 places in 138 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 5/159 constraints. Problems are: Problem set: 0 solved, 712 unsolved
[2024-05-28 02:22:23] [INFO ] Deduced a trap composed of 185 places in 186 ms of which 2 ms to minimize.
[2024-05-28 02:22:23] [INFO ] Deduced a trap composed of 185 places in 175 ms of which 2 ms to minimize.
[2024-05-28 02:22:24] [INFO ] Deduced a trap composed of 159 places in 154 ms of which 2 ms to minimize.
[2024-05-28 02:22:24] [INFO ] Deduced a trap composed of 177 places in 153 ms of which 2 ms to minimize.
[2024-05-28 02:22:25] [INFO ] Deduced a trap composed of 163 places in 158 ms of which 2 ms to minimize.
[2024-05-28 02:22:25] [INFO ] Deduced a trap composed of 171 places in 142 ms of which 2 ms to minimize.
[2024-05-28 02:22:25] [INFO ] Deduced a trap composed of 188 places in 134 ms of which 2 ms to minimize.
[2024-05-28 02:22:25] [INFO ] Deduced a trap composed of 3 places in 164 ms of which 2 ms to minimize.
[2024-05-28 02:22:25] [INFO ] Deduced a trap composed of 164 places in 163 ms of which 2 ms to minimize.
[2024-05-28 02:22:25] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 2 ms to minimize.
[2024-05-28 02:22:26] [INFO ] Deduced a trap composed of 166 places in 146 ms of which 2 ms to minimize.
SMT process timed out in 60807ms, After SMT, problems are : Problem set: 0 solved, 712 unsolved
Search for dead transitions found 0 dead transitions in 60815ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 86227 ms. Remains : 350/350 places, 714/714 transitions.
Treatment of property PolyORBLF-PT-S02J06T06-LTLCardinality-08 finished in 306761 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 528 transition count 914
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 474 transition count 914
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 108 place count 474 transition count 854
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 228 place count 414 transition count 854
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 231 place count 411 transition count 851
Iterating global reduction 2 with 3 rules applied. Total rules applied 234 place count 411 transition count 851
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 328 place count 364 transition count 804
Applied a total of 328 rules in 69 ms. Remains 364 /528 variables (removed 164) and now considering 804/968 (removed 164) transitions.
Running 802 sub problems to find dead transitions.
[2024-05-28 02:22:26] [INFO ] Flow matrix only has 792 transitions (discarded 12 similar events)
// Phase 1: matrix 792 rows 364 cols
[2024-05-28 02:22:26] [INFO ] Computed 42 invariants in 8 ms
[2024-05-28 02:22:26] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 802 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-05-28 02:22:31] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 2 ms to minimize.
[2024-05-28 02:22:31] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 2 ms to minimize.
[2024-05-28 02:22:32] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 1 ms to minimize.
[2024-05-28 02:22:32] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-05-28 02:22:32] [INFO ] Deduced a trap composed of 46 places in 32 ms of which 1 ms to minimize.
[2024-05-28 02:22:32] [INFO ] Deduced a trap composed of 46 places in 30 ms of which 1 ms to minimize.
[2024-05-28 02:22:32] [INFO ] Deduced a trap composed of 130 places in 159 ms of which 3 ms to minimize.
[2024-05-28 02:22:32] [INFO ] Deduced a trap composed of 119 places in 174 ms of which 2 ms to minimize.
[2024-05-28 02:22:32] [INFO ] Deduced a trap composed of 115 places in 168 ms of which 2 ms to minimize.
[2024-05-28 02:22:32] [INFO ] Deduced a trap composed of 120 places in 130 ms of which 2 ms to minimize.
[2024-05-28 02:22:32] [INFO ] Deduced a trap composed of 47 places in 25 ms of which 0 ms to minimize.
[2024-05-28 02:22:33] [INFO ] Deduced a trap composed of 61 places in 148 ms of which 2 ms to minimize.
[2024-05-28 02:22:33] [INFO ] Deduced a trap composed of 69 places in 89 ms of which 2 ms to minimize.
[2024-05-28 02:22:37] [INFO ] Deduced a trap composed of 106 places in 143 ms of which 2 ms to minimize.
[2024-05-28 02:22:37] [INFO ] Deduced a trap composed of 159 places in 189 ms of which 2 ms to minimize.
[2024-05-28 02:22:37] [INFO ] Deduced a trap composed of 139 places in 149 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 802 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 9.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 (/ 3.0 4.0))
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 3.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 802 unsolved
SMT process timed out in 20862ms, After SMT, problems are : Problem set: 0 solved, 802 unsolved
Search for dead transitions found 0 dead transitions in 20869ms
[2024-05-28 02:22:47] [INFO ] Flow matrix only has 792 transitions (discarded 12 similar events)
[2024-05-28 02:22:47] [INFO ] Invariant cache hit.
[2024-05-28 02:22:47] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-05-28 02:22:47] [INFO ] Flow matrix only has 792 transitions (discarded 12 similar events)
[2024-05-28 02:22:47] [INFO ] Invariant cache hit.
[2024-05-28 02:22:47] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 02:22:52] [INFO ] Implicit Places using invariants and state equation in 4664 ms returned []
Implicit Place search using SMT with State Equation took 5013 ms to find 0 implicit places.
[2024-05-28 02:22:52] [INFO ] Redundant transitions in 21 ms returned []
Running 802 sub problems to find dead transitions.
[2024-05-28 02:22:52] [INFO ] Flow matrix only has 792 transitions (discarded 12 similar events)
[2024-05-28 02:22:52] [INFO ] Invariant cache hit.
[2024-05-28 02:22:52] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 802 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-05-28 02:22:57] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 1 ms to minimize.
[2024-05-28 02:22:57] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 1 ms to minimize.
[2024-05-28 02:22:58] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
[2024-05-28 02:22:58] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2024-05-28 02:22:58] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 1 ms to minimize.
[2024-05-28 02:22:58] [INFO ] Deduced a trap composed of 124 places in 177 ms of which 2 ms to minimize.
[2024-05-28 02:22:58] [INFO ] Deduced a trap composed of 115 places in 149 ms of which 2 ms to minimize.
[2024-05-28 02:22:58] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-05-28 02:22:58] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-05-28 02:22:58] [INFO ] Deduced a trap composed of 120 places in 168 ms of which 3 ms to minimize.
[2024-05-28 02:22:59] [INFO ] Deduced a trap composed of 28 places in 183 ms of which 2 ms to minimize.
[2024-05-28 02:23:01] [INFO ] Deduced a trap composed of 57 places in 173 ms of which 3 ms to minimize.
[2024-05-28 02:23:04] [INFO ] Deduced a trap composed of 139 places in 162 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-05-28 02:23:11] [INFO ] Deduced a trap composed of 144 places in 219 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-05-28 02:23:18] [INFO ] Deduced a trap composed of 217 places in 147 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 802 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 9.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)timeout
(s11 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 362/1156 variables, and 55 constraints, problems are : Problem set: 0 solved, 802 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/364 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 802/802 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 802 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 802 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 802 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-05-28 02:23:48] [INFO ] Deduced a trap composed of 137 places in 191 ms of which 2 ms to minimize.
[2024-05-28 02:23:50] [INFO ] Deduced a trap composed of 32 places in 197 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 802 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 362/1156 variables, and 57 constraints, problems are : Problem set: 0 solved, 802 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/364 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/802 constraints, Known Traps: 17/17 constraints]
After SMT, in 61110ms problems are : Problem set: 0 solved, 802 unsolved
Search for dead transitions found 0 dead transitions in 61122ms
Starting structural reductions in SI_LTL mode, iteration 1 : 364/528 places, 804/968 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 87102 ms. Remains : 364/528 places, 804/968 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLCardinality-09
Stuttering criterion allowed to conclude after 376 steps with 0 reset in 3 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLCardinality-09 finished in 87172 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 522 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 522 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 516 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 516 transition count 956
Applied a total of 24 rules in 29 ms. Remains 516 /528 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-05-28 02:23:53] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 516 cols
[2024-05-28 02:23:53] [INFO ] Computed 42 invariants in 11 ms
[2024-05-28 02:23:53] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 02:24:01] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 2 ms to minimize.
[2024-05-28 02:24:01] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 1 ms to minimize.
[2024-05-28 02:24:01] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 1 ms to minimize.
[2024-05-28 02:24:01] [INFO ] Deduced a trap composed of 73 places in 44 ms of which 1 ms to minimize.
[2024-05-28 02:24:01] [INFO ] Deduced a trap composed of 73 places in 42 ms of which 1 ms to minimize.
[2024-05-28 02:24:01] [INFO ] Deduced a trap composed of 72 places in 36 ms of which 1 ms to minimize.
[2024-05-28 02:24:01] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 2 ms to minimize.
[2024-05-28 02:24:02] [INFO ] Deduced a trap composed of 72 places in 124 ms of which 1 ms to minimize.
[2024-05-28 02:24:02] [INFO ] Deduced a trap composed of 246 places in 232 ms of which 4 ms to minimize.
[2024-05-28 02:24:02] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 2 ms to minimize.
[2024-05-28 02:24:03] [INFO ] Deduced a trap composed of 176 places in 202 ms of which 3 ms to minimize.
[2024-05-28 02:24:03] [INFO ] Deduced a trap composed of 121 places in 192 ms of which 4 ms to minimize.
[2024-05-28 02:24:05] [INFO ] Deduced a trap composed of 161 places in 223 ms of which 3 ms to minimize.
[2024-05-28 02:24:07] [INFO ] Deduced a trap composed of 277 places in 261 ms of which 3 ms to minimize.
[2024-05-28 02:24:10] [INFO ] Deduced a trap composed of 106 places in 195 ms of which 3 ms to minimize.
[2024-05-28 02:24:12] [INFO ] Deduced a trap composed of 255 places in 241 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 954 unsolved
(s51 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 (/ 19.0 2.0))
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 4.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 (/ 1.0 2.0))
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 (/ 1.0 2.0))
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 56 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 02:24:30] [INFO ] Deduced a trap composed of 158 places in 240 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 57 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 17/17 constraints]
After SMT, in 40995ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 41009ms
[2024-05-28 02:24:34] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 02:24:34] [INFO ] Invariant cache hit.
[2024-05-28 02:24:34] [INFO ] Implicit Places using invariants in 400 ms returned []
[2024-05-28 02:24:34] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 02:24:34] [INFO ] Invariant cache hit.
[2024-05-28 02:24:35] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 02:24:40] [INFO ] Implicit Places using invariants and state equation in 5478 ms returned []
Implicit Place search using SMT with State Equation took 5880 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2024-05-28 02:24:40] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 02:24:40] [INFO ] Invariant cache hit.
[2024-05-28 02:24:40] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 02:24:48] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 2 ms to minimize.
[2024-05-28 02:24:48] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 1 ms to minimize.
[2024-05-28 02:24:48] [INFO ] Deduced a trap composed of 73 places in 53 ms of which 1 ms to minimize.
[2024-05-28 02:24:48] [INFO ] Deduced a trap composed of 72 places in 33 ms of which 1 ms to minimize.
[2024-05-28 02:24:48] [INFO ] Deduced a trap composed of 72 places in 34 ms of which 1 ms to minimize.
[2024-05-28 02:24:48] [INFO ] Deduced a trap composed of 72 places in 33 ms of which 1 ms to minimize.
[2024-05-28 02:24:48] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 2 ms to minimize.
[2024-05-28 02:24:48] [INFO ] Deduced a trap composed of 72 places in 35 ms of which 0 ms to minimize.
[2024-05-28 02:24:49] [INFO ] Deduced a trap composed of 246 places in 186 ms of which 3 ms to minimize.
[2024-05-28 02:24:49] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 3 ms to minimize.
[2024-05-28 02:24:50] [INFO ] Deduced a trap composed of 243 places in 171 ms of which 3 ms to minimize.
[2024-05-28 02:24:50] [INFO ] Deduced a trap composed of 173 places in 169 ms of which 3 ms to minimize.
[2024-05-28 02:24:52] [INFO ] Deduced a trap composed of 42 places in 188 ms of which 3 ms to minimize.
[2024-05-28 02:24:55] [INFO ] Deduced a trap composed of 258 places in 180 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 02:25:05] [INFO ] Deduced a trap composed of 233 places in 199 ms of which 2 ms to minimize.
[2024-05-28 02:25:07] [INFO ] Deduced a trap composed of 251 places in 175 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 56 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 02:25:30] [INFO ] Deduced a trap composed of 86 places in 247 ms of which 3 ms to minimize.
[2024-05-28 02:25:31] [INFO ] Deduced a trap composed of 277 places in 247 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 58 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 18/18 constraints]
After SMT, in 60904ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 60913ms
Starting structural reductions in LTL mode, iteration 1 : 516/528 places, 956/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107837 ms. Remains : 516/528 places, 956/968 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 24 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLCardinality-11 finished in 107945 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||(p1&&X(p2)))))'
Support contains 5 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 523 transition count 963
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 523 transition count 963
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 518 transition count 958
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 518 transition count 958
Applied a total of 20 rules in 25 ms. Remains 518 /528 variables (removed 10) and now considering 958/968 (removed 10) transitions.
Running 956 sub problems to find dead transitions.
[2024-05-28 02:25:41] [INFO ] Flow matrix only has 946 transitions (discarded 12 similar events)
// Phase 1: matrix 946 rows 518 cols
[2024-05-28 02:25:41] [INFO ] Computed 42 invariants in 15 ms
[2024-05-28 02:25:41] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/516 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 956 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/516 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-05-28 02:25:49] [INFO ] Deduced a trap composed of 74 places in 36 ms of which 1 ms to minimize.
[2024-05-28 02:25:50] [INFO ] Deduced a trap composed of 72 places in 140 ms of which 3 ms to minimize.
[2024-05-28 02:25:50] [INFO ] Deduced a trap composed of 82 places in 119 ms of which 1 ms to minimize.
[2024-05-28 02:25:50] [INFO ] Deduced a trap composed of 72 places in 31 ms of which 0 ms to minimize.
[2024-05-28 02:25:50] [INFO ] Deduced a trap composed of 73 places in 36 ms of which 1 ms to minimize.
[2024-05-28 02:25:50] [INFO ] Deduced a trap composed of 72 places in 36 ms of which 1 ms to minimize.
[2024-05-28 02:25:50] [INFO ] Deduced a trap composed of 72 places in 36 ms of which 1 ms to minimize.
[2024-05-28 02:25:51] [INFO ] Deduced a trap composed of 243 places in 259 ms of which 4 ms to minimize.
[2024-05-28 02:25:51] [INFO ] Deduced a trap composed of 132 places in 177 ms of which 3 ms to minimize.
[2024-05-28 02:25:52] [INFO ] Deduced a trap composed of 49 places in 161 ms of which 1 ms to minimize.
[2024-05-28 02:25:52] [INFO ] Deduced a trap composed of 248 places in 209 ms of which 4 ms to minimize.
[2024-05-28 02:25:52] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 3 ms to minimize.
[2024-05-28 02:25:54] [INFO ] Deduced a trap composed of 106 places in 185 ms of which 3 ms to minimize.
[2024-05-28 02:25:55] [INFO ] Deduced a trap composed of 273 places in 189 ms of which 3 ms to minimize.
[2024-05-28 02:26:01] [INFO ] Deduced a trap composed of 279 places in 179 ms of which 3 ms to minimize.
[2024-05-28 02:26:01] [INFO ] Deduced a trap composed of 302 places in 190 ms of which 3 ms to minimize.
[2024-05-28 02:26:01] [INFO ] Deduced a trap composed of 350 places in 187 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/516 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 956 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 516/1464 variables, and 57 constraints, problems are : Problem set: 0 solved, 956 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/518 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 956/956 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 956 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/516 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 956 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/516 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 956 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/516 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 956 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 516/1464 variables, and 57 constraints, problems are : Problem set: 0 solved, 956 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/518 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/956 constraints, Known Traps: 17/17 constraints]
After SMT, in 40991ms problems are : Problem set: 0 solved, 956 unsolved
Search for dead transitions found 0 dead transitions in 41002ms
[2024-05-28 02:26:22] [INFO ] Flow matrix only has 946 transitions (discarded 12 similar events)
[2024-05-28 02:26:22] [INFO ] Invariant cache hit.
[2024-05-28 02:26:22] [INFO ] Implicit Places using invariants in 511 ms returned []
[2024-05-28 02:26:22] [INFO ] Flow matrix only has 946 transitions (discarded 12 similar events)
[2024-05-28 02:26:22] [INFO ] Invariant cache hit.
[2024-05-28 02:26:23] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 02:26:31] [INFO ] Implicit Places using invariants and state equation in 8443 ms returned []
Implicit Place search using SMT with State Equation took 8956 ms to find 0 implicit places.
Running 956 sub problems to find dead transitions.
[2024-05-28 02:26:31] [INFO ] Flow matrix only has 946 transitions (discarded 12 similar events)
[2024-05-28 02:26:31] [INFO ] Invariant cache hit.
[2024-05-28 02:26:31] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/516 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 956 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/516 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-05-28 02:26:39] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 3 ms to minimize.
[2024-05-28 02:26:39] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 2 ms to minimize.
[2024-05-28 02:26:39] [INFO ] Deduced a trap composed of 73 places in 75 ms of which 2 ms to minimize.
[2024-05-28 02:26:39] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 1 ms to minimize.
[2024-05-28 02:26:39] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 1 ms to minimize.
[2024-05-28 02:26:40] [INFO ] Deduced a trap composed of 72 places in 38 ms of which 1 ms to minimize.
[2024-05-28 02:26:40] [INFO ] Deduced a trap composed of 72 places in 36 ms of which 1 ms to minimize.
[2024-05-28 02:26:40] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 1 ms to minimize.
[2024-05-28 02:26:40] [INFO ] Deduced a trap composed of 248 places in 190 ms of which 3 ms to minimize.
[2024-05-28 02:26:40] [INFO ] Deduced a trap composed of 49 places in 110 ms of which 2 ms to minimize.
[2024-05-28 02:26:41] [INFO ] Deduced a trap composed of 131 places in 214 ms of which 3 ms to minimize.
[2024-05-28 02:26:43] [INFO ] Deduced a trap composed of 133 places in 234 ms of which 4 ms to minimize.
[2024-05-28 02:26:44] [INFO ] Deduced a trap composed of 265 places in 183 ms of which 2 ms to minimize.
[2024-05-28 02:26:44] [INFO ] Deduced a trap composed of 247 places in 201 ms of which 3 ms to minimize.
[2024-05-28 02:26:45] [INFO ] Deduced a trap composed of 42 places in 248 ms of which 3 ms to minimize.
[2024-05-28 02:26:46] [INFO ] Deduced a trap composed of 243 places in 244 ms of which 4 ms to minimize.
[2024-05-28 02:26:47] [INFO ] Deduced a trap composed of 279 places in 264 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/516 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-05-28 02:26:58] [INFO ] Deduced a trap composed of 242 places in 187 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 516/1464 variables, and 58 constraints, problems are : Problem set: 0 solved, 956 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/518 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 956/956 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 956 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/516 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 956 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/516 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 956 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/516 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-05-28 02:27:20] [INFO ] Deduced a trap composed of 346 places in 208 ms of which 3 ms to minimize.
[2024-05-28 02:27:25] [INFO ] Deduced a trap composed of 273 places in 281 ms of which 4 ms to minimize.
[2024-05-28 02:27:30] [INFO ] Deduced a trap composed of 308 places in 232 ms of which 6 ms to minimize.
[2024-05-28 02:27:30] [INFO ] Deduced a trap composed of 328 places in 190 ms of which 2 ms to minimize.
[2024-05-28 02:27:30] [INFO ] Deduced a trap composed of 306 places in 210 ms of which 3 ms to minimize.
[2024-05-28 02:27:30] [INFO ] Deduced a trap composed of 358 places in 186 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 516/1464 variables, and 64 constraints, problems are : Problem set: 0 solved, 956 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/518 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/956 constraints, Known Traps: 24/24 constraints]
After SMT, in 61027ms problems are : Problem set: 0 solved, 956 unsolved
Search for dead transitions found 0 dead transitions in 61037ms
Starting structural reductions in LTL mode, iteration 1 : 518/528 places, 958/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111026 ms. Remains : 518/528 places, 958/968 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLCardinality-13 finished in 111193 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) U (X((F(G(!p0)) U p1)) U G(p2))))'
Support contains 5 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 522 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 522 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 516 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 516 transition count 956
Applied a total of 24 rules in 20 ms. Remains 516 /528 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-05-28 02:27:32] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 516 cols
[2024-05-28 02:27:32] [INFO ] Computed 42 invariants in 12 ms
[2024-05-28 02:27:32] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 02:27:40] [INFO ] Deduced a trap composed of 20 places in 161 ms of which 2 ms to minimize.
[2024-05-28 02:27:40] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 1 ms to minimize.
[2024-05-28 02:27:40] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-05-28 02:27:40] [INFO ] Deduced a trap composed of 73 places in 35 ms of which 0 ms to minimize.
[2024-05-28 02:27:40] [INFO ] Deduced a trap composed of 73 places in 34 ms of which 1 ms to minimize.
[2024-05-28 02:27:40] [INFO ] Deduced a trap composed of 72 places in 34 ms of which 1 ms to minimize.
[2024-05-28 02:27:41] [INFO ] Deduced a trap composed of 15 places in 200 ms of which 2 ms to minimize.
[2024-05-28 02:27:41] [INFO ] Deduced a trap composed of 72 places in 35 ms of which 1 ms to minimize.
[2024-05-28 02:27:41] [INFO ] Deduced a trap composed of 246 places in 179 ms of which 3 ms to minimize.
[2024-05-28 02:27:41] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 2 ms to minimize.
[2024-05-28 02:27:42] [INFO ] Deduced a trap composed of 176 places in 171 ms of which 2 ms to minimize.
[2024-05-28 02:27:42] [INFO ] Deduced a trap composed of 121 places in 146 ms of which 3 ms to minimize.
[2024-05-28 02:27:44] [INFO ] Deduced a trap composed of 161 places in 172 ms of which 3 ms to minimize.
[2024-05-28 02:27:46] [INFO ] Deduced a trap composed of 277 places in 274 ms of which 4 ms to minimize.
[2024-05-28 02:27:49] [INFO ] Deduced a trap composed of 106 places in 198 ms of which 3 ms to minimize.
[2024-05-28 02:27:51] [INFO ] Deduced a trap composed of 255 places in 265 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 56 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 02:28:09] [INFO ] Deduced a trap composed of 158 places in 189 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 57 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 17/17 constraints]
After SMT, in 40949ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40960ms
[2024-05-28 02:28:13] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 02:28:13] [INFO ] Invariant cache hit.
[2024-05-28 02:28:14] [INFO ] Implicit Places using invariants in 507 ms returned []
[2024-05-28 02:28:14] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 02:28:14] [INFO ] Invariant cache hit.
[2024-05-28 02:28:14] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 02:28:21] [INFO ] Implicit Places using invariants and state equation in 7231 ms returned []
Implicit Place search using SMT with State Equation took 7738 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2024-05-28 02:28:21] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 02:28:21] [INFO ] Invariant cache hit.
[2024-05-28 02:28:21] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 02:28:29] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 2 ms to minimize.
[2024-05-28 02:28:29] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 2 ms to minimize.
[2024-05-28 02:28:29] [INFO ] Deduced a trap composed of 73 places in 54 ms of which 1 ms to minimize.
[2024-05-28 02:28:29] [INFO ] Deduced a trap composed of 72 places in 39 ms of which 1 ms to minimize.
[2024-05-28 02:28:29] [INFO ] Deduced a trap composed of 72 places in 38 ms of which 1 ms to minimize.
[2024-05-28 02:28:29] [INFO ] Deduced a trap composed of 72 places in 37 ms of which 0 ms to minimize.
[2024-05-28 02:28:29] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 2 ms to minimize.
[2024-05-28 02:28:29] [INFO ] Deduced a trap composed of 72 places in 38 ms of which 0 ms to minimize.
[2024-05-28 02:28:30] [INFO ] Deduced a trap composed of 246 places in 216 ms of which 2 ms to minimize.
[2024-05-28 02:28:30] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 2 ms to minimize.
[2024-05-28 02:28:31] [INFO ] Deduced a trap composed of 243 places in 226 ms of which 4 ms to minimize.
[2024-05-28 02:28:31] [INFO ] Deduced a trap composed of 173 places in 197 ms of which 4 ms to minimize.
[2024-05-28 02:28:34] [INFO ] Deduced a trap composed of 42 places in 265 ms of which 3 ms to minimize.
[2024-05-28 02:28:38] [INFO ] Deduced a trap composed of 258 places in 213 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 02:28:48] [INFO ] Deduced a trap composed of 233 places in 274 ms of which 3 ms to minimize.
[2024-05-28 02:28:51] [INFO ] Deduced a trap composed of 251 places in 177 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 56 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 02:29:11] [INFO ] Deduced a trap composed of 86 places in 251 ms of which 4 ms to minimize.
[2024-05-28 02:29:12] [INFO ] Deduced a trap composed of 277 places in 191 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 58 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 18/18 constraints]
After SMT, in 60922ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 60930ms
Starting structural reductions in LTL mode, iteration 1 : 516/528 places, 956/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109654 ms. Remains : 516/528 places, 956/968 transitions.
Stuttering acceptance computed with spot in 289 ms :[(NOT p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p2)), false, p0, (NOT p1), (NOT p2), (AND p0 (NOT p2) (NOT p1)), (AND p0 (NOT p2) p1)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLCardinality-14
Product exploration explored 100000 steps with 46 reset in 398 ms.
Stack based approach found an accepted trace after 525 steps with 0 reset with depth 526 and stack size 526 in 3 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLCardinality-14 finished in 110372 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)&&F(p1))))'
Support contains 3 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 522 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 522 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 516 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 516 transition count 956
Applied a total of 24 rules in 20 ms. Remains 516 /528 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-05-28 02:29:22] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 02:29:22] [INFO ] Invariant cache hit.
[2024-05-28 02:29:22] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 02:29:30] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 3 ms to minimize.
[2024-05-28 02:29:31] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 2 ms to minimize.
[2024-05-28 02:29:31] [INFO ] Deduced a trap composed of 73 places in 78 ms of which 1 ms to minimize.
[2024-05-28 02:29:31] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 1 ms to minimize.
[2024-05-28 02:29:31] [INFO ] Deduced a trap composed of 72 places in 40 ms of which 1 ms to minimize.
[2024-05-28 02:29:31] [INFO ] Deduced a trap composed of 72 places in 38 ms of which 1 ms to minimize.
[2024-05-28 02:29:31] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 3 ms to minimize.
[2024-05-28 02:29:31] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
[2024-05-28 02:29:31] [INFO ] Deduced a trap composed of 246 places in 254 ms of which 4 ms to minimize.
[2024-05-28 02:29:32] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 6 ms to minimize.
[2024-05-28 02:29:33] [INFO ] Deduced a trap composed of 243 places in 203 ms of which 4 ms to minimize.
[2024-05-28 02:29:33] [INFO ] Deduced a trap composed of 173 places in 204 ms of which 3 ms to minimize.
[2024-05-28 02:29:36] [INFO ] Deduced a trap composed of 42 places in 275 ms of which 4 ms to minimize.
[2024-05-28 02:29:39] [INFO ] Deduced a trap composed of 258 places in 264 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 54 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 02:29:53] [INFO ] Deduced a trap composed of 292 places in 303 ms of which 4 ms to minimize.
[2024-05-28 02:29:55] [INFO ] Deduced a trap composed of 277 places in 279 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 56 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 16/16 constraints]
After SMT, in 40963ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40974ms
[2024-05-28 02:30:03] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 02:30:03] [INFO ] Invariant cache hit.
[2024-05-28 02:30:04] [INFO ] Implicit Places using invariants in 516 ms returned []
[2024-05-28 02:30:04] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 02:30:04] [INFO ] Invariant cache hit.
[2024-05-28 02:30:04] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 02:30:09] [INFO ] Implicit Places using invariants and state equation in 5413 ms returned []
Implicit Place search using SMT with State Equation took 5943 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2024-05-28 02:30:09] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 02:30:09] [INFO ] Invariant cache hit.
[2024-05-28 02:30:09] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 02:30:18] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 2 ms to minimize.
[2024-05-28 02:30:18] [INFO ] Deduced a trap composed of 72 places in 110 ms of which 2 ms to minimize.
[2024-05-28 02:30:18] [INFO ] Deduced a trap composed of 73 places in 60 ms of which 2 ms to minimize.
[2024-05-28 02:30:18] [INFO ] Deduced a trap composed of 72 places in 39 ms of which 0 ms to minimize.
[2024-05-28 02:30:18] [INFO ] Deduced a trap composed of 72 places in 38 ms of which 0 ms to minimize.
[2024-05-28 02:30:18] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-05-28 02:30:19] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 2 ms to minimize.
[2024-05-28 02:30:19] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 1 ms to minimize.
[2024-05-28 02:30:19] [INFO ] Deduced a trap composed of 246 places in 201 ms of which 2 ms to minimize.
[2024-05-28 02:30:19] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 2 ms to minimize.
[2024-05-28 02:30:20] [INFO ] Deduced a trap composed of 243 places in 213 ms of which 3 ms to minimize.
[2024-05-28 02:30:20] [INFO ] Deduced a trap composed of 173 places in 196 ms of which 3 ms to minimize.
[2024-05-28 02:30:24] [INFO ] Deduced a trap composed of 42 places in 267 ms of which 4 ms to minimize.
[2024-05-28 02:30:27] [INFO ] Deduced a trap composed of 258 places in 266 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 02:30:36] [INFO ] Deduced a trap composed of 233 places in 258 ms of which 3 ms to minimize.
[2024-05-28 02:30:39] [INFO ] Deduced a trap composed of 251 places in 215 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 56 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 02:31:00] [INFO ] Deduced a trap composed of 86 places in 247 ms of which 4 ms to minimize.
[2024-05-28 02:31:02] [INFO ] Deduced a trap composed of 277 places in 232 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 58 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 18/18 constraints]
After SMT, in 60944ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 60953ms
Starting structural reductions in LTL mode, iteration 1 : 516/528 places, 956/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107896 ms. Remains : 516/528 places, 956/968 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLCardinality-15 finished in 108099 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||X(F(p1)))))'
[2024-05-28 02:31:11] [INFO ] Flatten gal took : 61 ms
[2024-05-28 02:31:11] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-05-28 02:31:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 528 places, 968 transitions and 4168 arcs took 18 ms.
Total runtime 1387131 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running PolyORBLF-PT-S02J06T06
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/417/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 528
TRANSITIONS: 968
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.028s, Sys 0.000s]
SAVING FILE /home/mcc/execution/417/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.003s]
----------------------------------------------------------------------
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: 3913
MODEL NAME: /home/mcc/execution/417/model
528 places, 968 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
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 PolyORBLF-PT-S02J06T06-LTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716864084998
--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
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="PolyORBLF-PT-S02J06T06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBLF-PT-S02J06T06, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r289-tajo-171654445500243"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J06T06.tgz
mv PolyORBLF-PT-S02J06T06 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;