About the Execution of GreatSPN+red for StigmergyCommit-PT-10a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7059.539 | 3036633.00 | 3818592.00 | 8470.70 | TTFFFFTTFTFFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r399-tall-171690529900220.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is StigmergyCommit-PT-10a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690529900220
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 155M
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 17:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 11 17:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 11 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 155M 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 StigmergyCommit-PT-10a-LTLFireability-00
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-01
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-02
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-03
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-04
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-05
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-06
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-07
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-08
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-09
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-10
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-11
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-12
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-13
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-14
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717000540919
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-10a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 16:35:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 16:35:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 16:35:47] [INFO ] Load time of PNML (sax parser for PT used): 5475 ms
[2024-05-29 16:35:47] [INFO ] Transformed 400 places.
[2024-05-29 16:35:48] [INFO ] Transformed 136960 transitions.
[2024-05-29 16:35:48] [INFO ] Found NUPN structural information;
[2024-05-29 16:35:48] [INFO ] Parsed PT model containing 400 places and 136960 transitions and 3002181 arcs in 6338 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 50 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 132345 transitions
Reduce redundant transitions removed 132345 transitions.
FORMULA StigmergyCommit-PT-10a-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-10a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 11 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 4615/4615 transitions.
Discarding 88 places :
Symmetric choice reduction at 0 with 88 rule applications. Total rules 88 place count 312 transition count 4516
Iterating global reduction 0 with 88 rules applied. Total rules applied 176 place count 312 transition count 4516
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 187 place count 312 transition count 4505
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 232 place count 267 transition count 4449
Iterating global reduction 1 with 45 rules applied. Total rules applied 277 place count 267 transition count 4449
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 288 place count 267 transition count 4438
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 299 place count 256 transition count 4427
Iterating global reduction 2 with 11 rules applied. Total rules applied 310 place count 256 transition count 4427
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 321 place count 245 transition count 4416
Iterating global reduction 2 with 11 rules applied. Total rules applied 332 place count 245 transition count 4416
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 343 place count 234 transition count 4405
Iterating global reduction 2 with 11 rules applied. Total rules applied 354 place count 234 transition count 4405
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 365 place count 223 transition count 4394
Iterating global reduction 2 with 11 rules applied. Total rules applied 376 place count 223 transition count 4394
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 387 place count 223 transition count 4383
Applied a total of 387 rules in 237 ms. Remains 223 /400 variables (removed 177) and now considering 4383/4615 (removed 232) transitions.
[2024-05-29 16:35:50] [INFO ] Flow matrix only has 4371 transitions (discarded 12 similar events)
// Phase 1: matrix 4371 rows 223 cols
[2024-05-29 16:35:50] [INFO ] Computed 2 invariants in 79 ms
[2024-05-29 16:35:50] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-29 16:35:50] [INFO ] Flow matrix only has 4371 transitions (discarded 12 similar events)
[2024-05-29 16:35:50] [INFO ] Invariant cache hit.
[2024-05-29 16:35:52] [INFO ] State equation strengthened by 4192 read => feed constraints.
[2024-05-29 16:35:54] [INFO ] Implicit Places using invariants and state equation in 3929 ms returned [222]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 4297 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 222/400 places, 4383/4615 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 190 transition count 4351
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 190 transition count 4351
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 75 place count 190 transition count 4340
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 86 place count 179 transition count 4329
Iterating global reduction 1 with 11 rules applied. Total rules applied 97 place count 179 transition count 4329
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 108 place count 168 transition count 4318
Iterating global reduction 1 with 11 rules applied. Total rules applied 119 place count 168 transition count 4318
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 130 place count 157 transition count 4307
Iterating global reduction 1 with 11 rules applied. Total rules applied 141 place count 157 transition count 4307
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 152 place count 146 transition count 4296
Iterating global reduction 1 with 11 rules applied. Total rules applied 163 place count 146 transition count 4296
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 173 place count 136 transition count 4286
Iterating global reduction 1 with 10 rules applied. Total rules applied 183 place count 136 transition count 4286
Applied a total of 183 rules in 127 ms. Remains 136 /222 variables (removed 86) and now considering 4286/4383 (removed 97) transitions.
[2024-05-29 16:35:54] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
// Phase 1: matrix 4274 rows 136 cols
[2024-05-29 16:35:54] [INFO ] Computed 1 invariants in 32 ms
[2024-05-29 16:35:54] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-29 16:35:54] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:35:54] [INFO ] Invariant cache hit.
[2024-05-29 16:35:55] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:35:56] [INFO ] Implicit Places using invariants and state equation in 1576 ms returned []
Implicit Place search using SMT with State Equation took 1656 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 136/400 places, 4286/4615 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6335 ms. Remains : 136/400 places, 4286/4615 transitions.
Support contains 11 out of 136 places after structural reductions.
[2024-05-29 16:35:56] [INFO ] Flatten gal took : 549 ms
[2024-05-29 16:35:57] [INFO ] Flatten gal took : 304 ms
[2024-05-29 16:35:58] [INFO ] Input system was already deterministic with 4286 transitions.
Reduction of identical properties reduced properties to check from 10 to 3
RANDOM walk for 40000 steps (8 resets) in 12660 ms. (3 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 878 ms. (45 steps per ms) remains 1/1 properties
[2024-05-29 16:36:01] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:36:01] [INFO ] Invariant cache hit.
[2024-05-29 16:36:02] [INFO ] State equation strengthened by 4104 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 125/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4273/4409 variables, 136/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4409 variables, 4103/4240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4409 variables, 0/4240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/4410 variables, 1/4241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4410 variables, 0/4241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4410 variables, 0/4241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4410/4410 variables, and 4241 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1605 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 4104/4104 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Int declared 136/4410 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/136 constraints, ReadFeed: 0/4104 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2878ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA StigmergyCommit-PT-10a-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA StigmergyCommit-PT-10a-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 3 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((p0||F((F(p0)&&p1)))))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 14 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-05-29 16:36:05] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:36:05] [INFO ] Invariant cache hit.
[2024-05-29 16:36:05] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 16:36:05] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:36:05] [INFO ] Invariant cache hit.
[2024-05-29 16:36:06] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:36:06] [INFO ] Implicit Places using invariants and state equation in 1719 ms returned []
Implicit Place search using SMT with State Equation took 1758 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-05-29 16:36:06] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:36:06] [INFO ] Invariant cache hit.
[2024-05-29 16:36:07] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 98108ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 98174ms
Finished structural reductions in LTL mode , in 1 iterations and 99978 ms. Remains : 136/136 places, 4286/4286 transitions.
Stuttering acceptance computed with spot in 286 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-01
Product exploration explored 100000 steps with 1428 reset in 2049 ms.
Product exploration explored 100000 steps with 1428 reset in 1880 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 116 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 40000 steps (8 resets) in 11221 ms. (3 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 881 ms. (45 steps per ms) remains 1/1 properties
[2024-05-29 16:37:52] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:37:52] [INFO ] Invariant cache hit.
[2024-05-29 16:37:53] [INFO ] State equation strengthened by 4104 read => feed constraints.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 11/4410 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/136 constraints, ReadFeed: 0/4104 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 348ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 9 factoid took 173 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-05-29 16:37:53] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:37:53] [INFO ] Invariant cache hit.
[2024-05-29 16:37:56] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-29 16:37:56] [INFO ] [Real]Absence check using state equation in 802 ms returned sat
[2024-05-29 16:37:57] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:37:58] [INFO ] [Real]Added 4104 Read/Feed constraints in 393 ms returned sat
[2024-05-29 16:37:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 16:38:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-29 16:38:01] [INFO ] [Nat]Absence check using state equation in 750 ms returned sat
[2024-05-29 16:38:01] [INFO ] [Nat]Added 4104 Read/Feed constraints in 471 ms returned sat
[2024-05-29 16:38:03] [INFO ] Computed and/alt/rep : 145/178/145 causal constraints (skipped 4128 transitions) in 1172 ms.
[2024-05-29 16:38:07] [INFO ] Added : 111 causal constraints over 23 iterations in 5251 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 15 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-05-29 16:38:07] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:38:07] [INFO ] Invariant cache hit.
[2024-05-29 16:38:07] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-29 16:38:07] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:38:07] [INFO ] Invariant cache hit.
[2024-05-29 16:38:08] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:38:08] [INFO ] Implicit Places using invariants and state equation in 1399 ms returned []
Implicit Place search using SMT with State Equation took 1442 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-05-29 16:38:08] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:38:08] [INFO ] Invariant cache hit.
[2024-05-29 16:38:08] [INFO ] State equation strengthened by 4104 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 96676ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 96727ms
Finished structural reductions in LTL mode , in 1 iterations and 98202 ms. Remains : 136/136 places, 4286/4286 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 276 steps (0 resets) in 13 ms. (19 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-05-29 16:39:46] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:39:46] [INFO ] Invariant cache hit.
[2024-05-29 16:39:48] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-29 16:39:49] [INFO ] [Real]Absence check using state equation in 774 ms returned sat
[2024-05-29 16:39:49] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:39:50] [INFO ] [Real]Added 4104 Read/Feed constraints in 419 ms returned sat
[2024-05-29 16:39:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 16:39:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-29 16:39:53] [INFO ] [Nat]Absence check using state equation in 769 ms returned sat
[2024-05-29 16:39:53] [INFO ] [Nat]Added 4104 Read/Feed constraints in 463 ms returned sat
[2024-05-29 16:39:54] [INFO ] Computed and/alt/rep : 145/178/145 causal constraints (skipped 4128 transitions) in 1055 ms.
[2024-05-29 16:39:58] [INFO ] Added : 111 causal constraints over 23 iterations in 5283 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1428 reset in 1833 ms.
Product exploration explored 100000 steps with 1428 reset in 1848 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 136 transition count 4286
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 34 place count 136 transition count 4297
Deduced a syphon composed of 45 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 45 place count 136 transition count 4297
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 67 place count 114 transition count 4275
Deduced a syphon composed of 23 places in 6 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 89 place count 114 transition count 4275
Performed 45 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 68 places in 6 ms
Iterating global reduction 1 with 45 rules applied. Total rules applied 134 place count 114 transition count 4286
Ensure Unique test removed 2069 transitions
Reduce isomorphic transitions removed 2069 transitions.
Iterating post reduction 1 with 2069 rules applied. Total rules applied 2203 place count 114 transition count 2217
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 2227 place count 90 transition count 2193
Deduced a syphon composed of 44 places in 11 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 2251 place count 90 transition count 2193
Deduced a syphon composed of 44 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 2 with 22 rules applied. Total rules applied 2273 place count 90 transition count 2171
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 55 places in 1 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 2284 place count 90 transition count 2171
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 2306 place count 68 transition count 2149
Deduced a syphon composed of 33 places in 1 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 2328 place count 68 transition count 2149
Deduced a syphon composed of 33 places in 1 ms
Applied a total of 2328 rules in 2534 ms. Remains 68 /136 variables (removed 68) and now considering 2149/4286 (removed 2137) transitions.
[2024-05-29 16:40:05] [INFO ] Redundant transitions in 360 ms returned []
Running 2148 sub problems to find dead transitions.
[2024-05-29 16:40:06] [INFO ] Flow matrix only has 2137 transitions (discarded 12 similar events)
// Phase 1: matrix 2137 rows 68 cols
[2024-05-29 16:40:06] [INFO ] Computed 1 invariants in 6 ms
[2024-05-29 16:40:06] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
[2024-05-29 16:40:48] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 4 ms to minimize.
[2024-05-29 16:40:48] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2024-05-29 16:40:48] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 2 ms to minimize.
[2024-05-29 16:40:48] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 3 ms to minimize.
[2024-05-29 16:40:48] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 2 ms to minimize.
[2024-05-29 16:40:48] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2024-05-29 16:40:48] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 1 ms to minimize.
[2024-05-29 16:40:48] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 27 ms to minimize.
[2024-05-29 16:40:48] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-05-29 16:40:49] [INFO ] Deduced a trap composed of 5 places in 299 ms of which 1 ms to minimize.
[2024-05-29 16:40:49] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2024-05-29 16:40:50] [INFO ] Deduced a trap composed of 5 places in 677 ms of which 1 ms to minimize.
[2024-05-29 16:40:50] [INFO ] Deduced a trap composed of 5 places in 677 ms of which 2 ms to minimize.
[2024-05-29 16:40:51] [INFO ] Deduced a trap composed of 5 places in 570 ms of which 1 ms to minimize.
[2024-05-29 16:40:52] [INFO ] Deduced a trap composed of 5 places in 755 ms of which 0 ms to minimize.
[2024-05-29 16:40:52] [INFO ] Deduced a trap composed of 5 places in 633 ms of which 1 ms to minimize.
[2024-05-29 16:40:53] [INFO ] Deduced a trap composed of 5 places in 612 ms of which 1 ms to minimize.
[2024-05-29 16:40:54] [INFO ] Deduced a trap composed of 5 places in 627 ms of which 1 ms to minimize.
[2024-05-29 16:40:54] [INFO ] Deduced a trap composed of 5 places in 524 ms of which 1 ms to minimize.
[2024-05-29 16:40:55] [INFO ] Deduced a trap composed of 5 places in 426 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
[2024-05-29 16:40:56] [INFO ] Deduced a trap composed of 5 places in 435 ms of which 0 ms to minimize.
[2024-05-29 16:40:56] [INFO ] Deduced a trap composed of 5 places in 369 ms of which 2 ms to minimize.
[2024-05-29 16:40:56] [INFO ] Deduced a trap composed of 5 places in 342 ms of which 0 ms to minimize.
[2024-05-29 16:40:57] [INFO ] Deduced a trap composed of 5 places in 315 ms of which 1 ms to minimize.
[2024-05-29 16:40:57] [INFO ] Deduced a trap composed of 5 places in 260 ms of which 1 ms to minimize.
[2024-05-29 16:40:57] [INFO ] Deduced a trap composed of 5 places in 279 ms of which 1 ms to minimize.
[2024-05-29 16:40:57] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 1 ms to minimize.
[2024-05-29 16:40:58] [INFO ] Deduced a trap composed of 5 places in 286 ms of which 0 ms to minimize.
[2024-05-29 16:40:58] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 1 ms to minimize.
[2024-05-29 16:40:58] [INFO ] Deduced a trap composed of 5 places in 267 ms of which 1 ms to minimize.
[2024-05-29 16:40:59] [INFO ] Deduced a trap composed of 5 places in 270 ms of which 0 ms to minimize.
[2024-05-29 16:40:59] [INFO ] Deduced a trap composed of 5 places in 319 ms of which 1 ms to minimize.
[2024-05-29 16:40:59] [INFO ] Deduced a trap composed of 5 places in 309 ms of which 2 ms to minimize.
[2024-05-29 16:40:59] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 2 ms to minimize.
[2024-05-29 16:41:00] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 4 ms to minimize.
[2024-05-29 16:41:00] [INFO ] Deduced a trap composed of 5 places in 254 ms of which 0 ms to minimize.
[2024-05-29 16:41:00] [INFO ] Deduced a trap composed of 5 places in 282 ms of which 1 ms to minimize.
[2024-05-29 16:41:00] [INFO ] Deduced a trap composed of 5 places in 223 ms of which 0 ms to minimize.
[2024-05-29 16:41:01] [INFO ] Deduced a trap composed of 5 places in 214 ms of which 1 ms to minimize.
[2024-05-29 16:41:01] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
[2024-05-29 16:41:06] [INFO ] Deduced a trap composed of 5 places in 317 ms of which 1 ms to minimize.
[2024-05-29 16:41:06] [INFO ] Deduced a trap composed of 5 places in 292 ms of which 0 ms to minimize.
[2024-05-29 16:41:07] [INFO ] Deduced a trap composed of 5 places in 294 ms of which 1 ms to minimize.
[2024-05-29 16:41:07] [INFO ] Deduced a trap composed of 5 places in 216 ms of which 0 ms to minimize.
[2024-05-29 16:41:07] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 1 ms to minimize.
[2024-05-29 16:41:07] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 1 ms to minimize.
[2024-05-29 16:41:07] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 0 ms to minimize.
[2024-05-29 16:41:08] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 1 ms to minimize.
[2024-05-29 16:41:08] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 1 ms to minimize.
[2024-05-29 16:41:08] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 2 ms to minimize.
[2024-05-29 16:41:08] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 1 ms to minimize.
SMT process timed out in 62533ms, After SMT, problems are : Problem set: 0 solved, 2148 unsolved
Search for dead transitions found 0 dead transitions in 62555ms
Starting structural reductions in SI_LTL mode, iteration 1 : 68/136 places, 2149/4286 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65468 ms. Remains : 68/136 places, 2149/4286 transitions.
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 15 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-05-29 16:41:08] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
// Phase 1: matrix 4274 rows 136 cols
[2024-05-29 16:41:08] [INFO ] Computed 1 invariants in 17 ms
[2024-05-29 16:41:08] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-29 16:41:08] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:41:08] [INFO ] Invariant cache hit.
[2024-05-29 16:41:09] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:41:10] [INFO ] Implicit Places using invariants and state equation in 1360 ms returned []
Implicit Place search using SMT with State Equation took 1449 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-05-29 16:41:10] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:41:10] [INFO ] Invariant cache hit.
[2024-05-29 16:41:10] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 102959ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 103024ms
Finished structural reductions in LTL mode , in 1 iterations and 104505 ms. Remains : 136/136 places, 4286/4286 transitions.
Treatment of property StigmergyCommit-PT-10a-LTLFireability-01 finished in 408921 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U G(p0)))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 135 transition count 4251
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 101 transition count 4251
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 68 place count 101 transition count 4240
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 90 place count 90 transition count 4240
Performed 34 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 158 place count 56 transition count 4194
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 2 with 2047 rules applied. Total rules applied 2205 place count 56 transition count 2147
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 2225 place count 46 transition count 2137
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 2235 place count 46 transition count 2127
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 2246 place count 46 transition count 2116
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 2268 place count 35 transition count 2105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2269 place count 34 transition count 2104
Applied a total of 2269 rules in 2749 ms. Remains 34 /136 variables (removed 102) and now considering 2104/4286 (removed 2182) transitions.
[2024-05-29 16:42:56] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
// Phase 1: matrix 2092 rows 34 cols
[2024-05-29 16:42:56] [INFO ] Computed 1 invariants in 10 ms
[2024-05-29 16:42:56] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-29 16:42:56] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 16:42:56] [INFO ] Invariant cache hit.
[2024-05-29 16:42:57] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 16:42:57] [INFO ] Implicit Places using invariants and state equation in 672 ms returned []
Implicit Place search using SMT with State Equation took 704 ms to find 0 implicit places.
[2024-05-29 16:42:57] [INFO ] Redundant transitions in 271 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-05-29 16:42:57] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 16:42:57] [INFO ] Invariant cache hit.
[2024-05-29 16:42:57] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 16:43:39] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-29 16:43:39] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-29 16:43:39] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-29 16:43:39] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-29 16:43:40] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 1 ms to minimize.
[2024-05-29 16:43:40] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 1 ms to minimize.
[2024-05-29 16:43:40] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 0 ms to minimize.
[2024-05-29 16:43:40] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 0 ms to minimize.
[2024-05-29 16:43:41] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
[2024-05-29 16:43:41] [INFO ] Deduced a trap composed of 4 places in 646 ms of which 1 ms to minimize.
[2024-05-29 16:43:42] [INFO ] Deduced a trap composed of 4 places in 684 ms of which 0 ms to minimize.
[2024-05-29 16:43:43] [INFO ] Deduced a trap composed of 4 places in 679 ms of which 1 ms to minimize.
[2024-05-29 16:43:43] [INFO ] Deduced a trap composed of 4 places in 677 ms of which 0 ms to minimize.
[2024-05-29 16:43:44] [INFO ] Deduced a trap composed of 4 places in 668 ms of which 1 ms to minimize.
[2024-05-29 16:43:45] [INFO ] Deduced a trap composed of 4 places in 679 ms of which 0 ms to minimize.
[2024-05-29 16:43:45] [INFO ] Deduced a trap composed of 4 places in 588 ms of which 0 ms to minimize.
[2024-05-29 16:43:46] [INFO ] Deduced a trap composed of 4 places in 470 ms of which 0 ms to minimize.
[2024-05-29 16:43:46] [INFO ] Deduced a trap composed of 4 places in 442 ms of which 1 ms to minimize.
[2024-05-29 16:43:47] [INFO ] Deduced a trap composed of 4 places in 379 ms of which 1 ms to minimize.
[2024-05-29 16:43:47] [INFO ] Deduced a trap composed of 4 places in 574 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 16:43:48] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-05-29 16:43:48] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-29 16:43:48] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-05-29 16:43:48] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-29 16:43:48] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-29 16:43:48] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-05-29 16:43:48] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2024-05-29 16:43:48] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 0 ms to minimize.
[2024-05-29 16:43:48] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-05-29 16:43:48] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 0 ms to minimize.
[2024-05-29 16:43:48] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-29 16:43:49] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2024-05-29 16:43:49] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2024-05-29 16:43:49] [INFO ] Deduced a trap composed of 4 places in 311 ms of which 1 ms to minimize.
[2024-05-29 16:43:49] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 0 ms to minimize.
[2024-05-29 16:43:50] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 1 ms to minimize.
[2024-05-29 16:43:50] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 1 ms to minimize.
[2024-05-29 16:43:50] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 0 ms to minimize.
[2024-05-29 16:43:50] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2024-05-29 16:43:50] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 16:43:54] [INFO ] Deduced a trap composed of 4 places in 367 ms of which 1 ms to minimize.
[2024-05-29 16:43:55] [INFO ] Deduced a trap composed of 4 places in 382 ms of which 0 ms to minimize.
[2024-05-29 16:43:55] [INFO ] Deduced a trap composed of 4 places in 313 ms of which 0 ms to minimize.
[2024-05-29 16:43:55] [INFO ] Deduced a trap composed of 4 places in 263 ms of which 0 ms to minimize.
[2024-05-29 16:43:55] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 1 ms to minimize.
[2024-05-29 16:43:56] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 0 ms to minimize.
[2024-05-29 16:43:56] [INFO ] Deduced a trap composed of 4 places in 272 ms of which 0 ms to minimize.
[2024-05-29 16:43:56] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 1 ms to minimize.
[2024-05-29 16:43:56] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 1 ms to minimize.
[2024-05-29 16:43:56] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 0 ms to minimize.
[2024-05-29 16:43:57] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 1 ms to minimize.
[2024-05-29 16:43:57] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 1 ms to minimize.
[2024-05-29 16:43:57] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 0 ms to minimize.
[2024-05-29 16:43:57] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2024-05-29 16:43:57] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 34/2126 variables, and 56 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/34 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2093 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 4 (OVERLAPS) 2091/2125 variables, 34/90 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2125 variables, 2068/2158 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2125/2126 variables, and 2159 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 2068/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
After SMT, in 95751ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 95776ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/136 places, 2104/4286 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99520 ms. Remains : 34/136 places, 2104/4286 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), true, (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-02
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 5 ms.
FORMULA StigmergyCommit-PT-10a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-10a-LTLFireability-02 finished in 99670 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(G(p1))))))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 15 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-05-29 16:44:33] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
// Phase 1: matrix 4274 rows 136 cols
[2024-05-29 16:44:33] [INFO ] Computed 1 invariants in 29 ms
[2024-05-29 16:44:33] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-29 16:44:33] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:44:33] [INFO ] Invariant cache hit.
[2024-05-29 16:44:34] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:44:35] [INFO ] Implicit Places using invariants and state equation in 1468 ms returned []
Implicit Place search using SMT with State Equation took 1546 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-05-29 16:44:35] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:44:35] [INFO ] Invariant cache hit.
[2024-05-29 16:44:35] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 106445ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 106498ms
Finished structural reductions in LTL mode , in 1 iterations and 108079 ms. Remains : 136/136 places, 4286/4286 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-03
Stuttering criterion allowed to conclude after 74 steps with 0 reset in 11 ms.
FORMULA StigmergyCommit-PT-10a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-10a-LTLFireability-03 finished in 108313 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((F(G(p0))&&F(p1))))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 135 transition count 4251
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 101 transition count 4251
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 68 place count 101 transition count 4240
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 90 place count 90 transition count 4240
Performed 34 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 158 place count 56 transition count 4194
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 2 with 2047 rules applied. Total rules applied 2205 place count 56 transition count 2147
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 2225 place count 46 transition count 2137
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 2235 place count 46 transition count 2127
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 2246 place count 46 transition count 2116
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 2268 place count 35 transition count 2105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2269 place count 34 transition count 2104
Applied a total of 2269 rules in 2717 ms. Remains 34 /136 variables (removed 102) and now considering 2104/4286 (removed 2182) transitions.
[2024-05-29 16:46:24] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
// Phase 1: matrix 2092 rows 34 cols
[2024-05-29 16:46:24] [INFO ] Computed 1 invariants in 11 ms
[2024-05-29 16:46:24] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-29 16:46:24] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 16:46:24] [INFO ] Invariant cache hit.
[2024-05-29 16:46:25] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 16:46:25] [INFO ] Implicit Places using invariants and state equation in 693 ms returned []
Implicit Place search using SMT with State Equation took 737 ms to find 0 implicit places.
[2024-05-29 16:46:25] [INFO ] Redundant transitions in 313 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-05-29 16:46:25] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 16:46:25] [INFO ] Invariant cache hit.
[2024-05-29 16:46:25] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 16:47:11] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-29 16:47:11] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-29 16:47:11] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-29 16:47:11] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-05-29 16:47:12] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 0 ms to minimize.
[2024-05-29 16:47:12] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2024-05-29 16:47:12] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 1 ms to minimize.
[2024-05-29 16:47:12] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 0 ms to minimize.
[2024-05-29 16:47:12] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 0 ms to minimize.
[2024-05-29 16:47:13] [INFO ] Deduced a trap composed of 4 places in 647 ms of which 1 ms to minimize.
[2024-05-29 16:47:14] [INFO ] Deduced a trap composed of 4 places in 726 ms of which 1 ms to minimize.
[2024-05-29 16:47:15] [INFO ] Deduced a trap composed of 4 places in 711 ms of which 1 ms to minimize.
[2024-05-29 16:47:15] [INFO ] Deduced a trap composed of 4 places in 709 ms of which 0 ms to minimize.
[2024-05-29 16:47:16] [INFO ] Deduced a trap composed of 4 places in 645 ms of which 1 ms to minimize.
[2024-05-29 16:47:17] [INFO ] Deduced a trap composed of 4 places in 611 ms of which 1 ms to minimize.
[2024-05-29 16:47:17] [INFO ] Deduced a trap composed of 4 places in 521 ms of which 1 ms to minimize.
[2024-05-29 16:47:18] [INFO ] Deduced a trap composed of 4 places in 448 ms of which 1 ms to minimize.
[2024-05-29 16:47:18] [INFO ] Deduced a trap composed of 4 places in 391 ms of which 0 ms to minimize.
[2024-05-29 16:47:18] [INFO ] Deduced a trap composed of 4 places in 387 ms of which 1 ms to minimize.
[2024-05-29 16:47:19] [INFO ] Deduced a trap composed of 4 places in 577 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 16:47:19] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2024-05-29 16:47:19] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-29 16:47:20] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-29 16:47:20] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 1 ms to minimize.
[2024-05-29 16:47:20] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 0 ms to minimize.
[2024-05-29 16:47:20] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-29 16:47:20] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 0 ms to minimize.
[2024-05-29 16:47:20] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 0 ms to minimize.
[2024-05-29 16:47:20] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-29 16:47:20] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 0 ms to minimize.
[2024-05-29 16:47:20] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2024-05-29 16:47:21] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2024-05-29 16:47:21] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 1 ms to minimize.
[2024-05-29 16:47:21] [INFO ] Deduced a trap composed of 4 places in 330 ms of which 1 ms to minimize.
[2024-05-29 16:47:21] [INFO ] Deduced a trap composed of 4 places in 267 ms of which 1 ms to minimize.
[2024-05-29 16:47:22] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 1 ms to minimize.
[2024-05-29 16:47:22] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 2 ms to minimize.
[2024-05-29 16:47:22] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 0 ms to minimize.
[2024-05-29 16:47:22] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 0 ms to minimize.
[2024-05-29 16:47:22] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 16:47:26] [INFO ] Deduced a trap composed of 4 places in 386 ms of which 0 ms to minimize.
[2024-05-29 16:47:27] [INFO ] Deduced a trap composed of 4 places in 408 ms of which 0 ms to minimize.
[2024-05-29 16:47:27] [INFO ] Deduced a trap composed of 4 places in 334 ms of which 1 ms to minimize.
[2024-05-29 16:47:27] [INFO ] Deduced a trap composed of 4 places in 279 ms of which 1 ms to minimize.
[2024-05-29 16:47:27] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 0 ms to minimize.
[2024-05-29 16:47:28] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 1 ms to minimize.
[2024-05-29 16:47:28] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 0 ms to minimize.
[2024-05-29 16:47:28] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 0 ms to minimize.
[2024-05-29 16:47:28] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 0 ms to minimize.
[2024-05-29 16:47:28] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 1 ms to minimize.
[2024-05-29 16:47:29] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 0 ms to minimize.
[2024-05-29 16:47:29] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 1 ms to minimize.
[2024-05-29 16:47:29] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 0 ms to minimize.
[2024-05-29 16:47:29] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 0 ms to minimize.
[2024-05-29 16:47:29] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 34/2126 variables, and 56 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/34 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2093 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 4 (OVERLAPS) 2091/2125 variables, 34/90 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2125 variables, 2068/2158 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2125/2126 variables, and 2159 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 2068/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
After SMT, in 99483ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 99508ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/136 places, 2104/4286 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 103287 ms. Remains : 34/136 places, 2104/4286 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-04
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 11 ms.
FORMULA StigmergyCommit-PT-10a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-10a-LTLFireability-04 finished in 103451 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 13 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-05-29 16:48:05] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
// Phase 1: matrix 4274 rows 136 cols
[2024-05-29 16:48:05] [INFO ] Computed 1 invariants in 20 ms
[2024-05-29 16:48:05] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-29 16:48:05] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:48:05] [INFO ] Invariant cache hit.
[2024-05-29 16:48:06] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:48:06] [INFO ] Implicit Places using invariants and state equation in 1447 ms returned []
Implicit Place search using SMT with State Equation took 1510 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-05-29 16:48:06] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:48:06] [INFO ] Invariant cache hit.
[2024-05-29 16:48:07] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 103200ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 103244ms
Finished structural reductions in LTL mode , in 1 iterations and 104786 ms. Remains : 136/136 places, 4286/4286 transitions.
Stuttering acceptance computed with spot in 145 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-10a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-10a-LTLFireability-05 finished in 104954 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(!p1)||X((p1 U X(p1)))||p0)))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 17 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-05-29 16:49:50] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:49:50] [INFO ] Invariant cache hit.
[2024-05-29 16:49:50] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-29 16:49:50] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:49:50] [INFO ] Invariant cache hit.
[2024-05-29 16:49:51] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:49:51] [INFO ] Implicit Places using invariants and state equation in 1546 ms returned []
Implicit Place search using SMT with State Equation took 1595 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-05-29 16:49:51] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:49:51] [INFO ] Invariant cache hit.
[2024-05-29 16:49:52] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 100749ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 100795ms
Finished structural reductions in LTL mode , in 1 iterations and 102427 ms. Remains : 136/136 places, 4286/4286 transitions.
Stuttering acceptance computed with spot in 312 ms :[false, false, p1, false, false, (NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 276 ms.
Product exploration explored 100000 steps with 50000 reset in 278 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 20 ms. Reduced automaton from 9 states, 13 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-10a-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-10a-LTLFireability-06 finished in 103376 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 16 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-05-29 16:51:33] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:51:33] [INFO ] Invariant cache hit.
[2024-05-29 16:51:33] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-29 16:51:33] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:51:33] [INFO ] Invariant cache hit.
[2024-05-29 16:51:34] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:51:35] [INFO ] Implicit Places using invariants and state equation in 1352 ms returned []
Implicit Place search using SMT with State Equation took 1401 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-05-29 16:51:35] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:51:35] [INFO ] Invariant cache hit.
[2024-05-29 16:51:35] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 96250ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 96292ms
Finished structural reductions in LTL mode , in 1 iterations and 97732 ms. Remains : 136/136 places, 4286/4286 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-07
Product exploration explored 100000 steps with 1428 reset in 2007 ms.
Product exploration explored 100000 steps with 1428 reset in 1974 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 106 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 276 steps (0 resets) in 24 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 119 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 16:53:16] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:53:16] [INFO ] Invariant cache hit.
[2024-05-29 16:53:18] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-29 16:53:19] [INFO ] [Real]Absence check using state equation in 817 ms returned sat
[2024-05-29 16:53:20] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:53:20] [INFO ] [Real]Added 4104 Read/Feed constraints in 397 ms returned sat
[2024-05-29 16:53:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 16:53:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-29 16:53:23] [INFO ] [Nat]Absence check using state equation in 772 ms returned sat
[2024-05-29 16:53:24] [INFO ] [Nat]Added 4104 Read/Feed constraints in 485 ms returned sat
[2024-05-29 16:53:24] [INFO ] Computed and/alt/rep : 145/178/145 causal constraints (skipped 4128 transitions) in 620 ms.
[2024-05-29 16:53:29] [INFO ] Added : 111 causal constraints over 23 iterations in 4766 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 16 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-05-29 16:53:29] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:53:29] [INFO ] Invariant cache hit.
[2024-05-29 16:53:29] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-29 16:53:29] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:53:29] [INFO ] Invariant cache hit.
[2024-05-29 16:53:30] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:53:30] [INFO ] Implicit Places using invariants and state equation in 1410 ms returned []
Implicit Place search using SMT with State Equation took 1447 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-05-29 16:53:30] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:53:30] [INFO ] Invariant cache hit.
[2024-05-29 16:53:30] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 98913ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 98959ms
Finished structural reductions in LTL mode , in 1 iterations and 100440 ms. Remains : 136/136 places, 4286/4286 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 93 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 276 steps (0 resets) in 14 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 126 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 16:55:10] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:55:10] [INFO ] Invariant cache hit.
[2024-05-29 16:55:12] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-29 16:55:13] [INFO ] [Real]Absence check using state equation in 867 ms returned sat
[2024-05-29 16:55:14] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:55:14] [INFO ] [Real]Added 4104 Read/Feed constraints in 417 ms returned sat
[2024-05-29 16:55:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 16:55:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-29 16:55:17] [INFO ] [Nat]Absence check using state equation in 750 ms returned sat
[2024-05-29 16:55:18] [INFO ] [Nat]Added 4104 Read/Feed constraints in 495 ms returned sat
[2024-05-29 16:55:19] [INFO ] Computed and/alt/rep : 145/178/145 causal constraints (skipped 4128 transitions) in 1095 ms.
[2024-05-29 16:55:23] [INFO ] Added : 111 causal constraints over 23 iterations in 5352 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1428 reset in 1965 ms.
Product exploration explored 100000 steps with 1428 reset in 1864 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 136 transition count 4286
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 34 place count 136 transition count 4297
Deduced a syphon composed of 45 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 45 place count 136 transition count 4297
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 67 place count 114 transition count 4275
Deduced a syphon composed of 23 places in 1 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 89 place count 114 transition count 4275
Performed 45 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 68 places in 1 ms
Iterating global reduction 1 with 45 rules applied. Total rules applied 134 place count 114 transition count 4286
Ensure Unique test removed 2069 transitions
Reduce isomorphic transitions removed 2069 transitions.
Iterating post reduction 1 with 2069 rules applied. Total rules applied 2203 place count 114 transition count 2217
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 2227 place count 90 transition count 2193
Deduced a syphon composed of 44 places in 1 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 2251 place count 90 transition count 2193
Deduced a syphon composed of 44 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 2 with 22 rules applied. Total rules applied 2273 place count 90 transition count 2171
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 2284 place count 90 transition count 2171
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 2306 place count 68 transition count 2149
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 2328 place count 68 transition count 2149
Deduced a syphon composed of 33 places in 0 ms
Applied a total of 2328 rules in 1814 ms. Remains 68 /136 variables (removed 68) and now considering 2149/4286 (removed 2137) transitions.
[2024-05-29 16:55:29] [INFO ] Redundant transitions in 284 ms returned []
Running 2148 sub problems to find dead transitions.
[2024-05-29 16:55:29] [INFO ] Flow matrix only has 2137 transitions (discarded 12 similar events)
// Phase 1: matrix 2137 rows 68 cols
[2024-05-29 16:55:29] [INFO ] Computed 1 invariants in 8 ms
[2024-05-29 16:55:30] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
[2024-05-29 16:56:15] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 0 ms to minimize.
[2024-05-29 16:56:15] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 0 ms to minimize.
[2024-05-29 16:56:15] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
[2024-05-29 16:56:15] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2024-05-29 16:56:15] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2024-05-29 16:56:15] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 0 ms to minimize.
[2024-05-29 16:56:15] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2024-05-29 16:56:15] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2024-05-29 16:56:15] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
[2024-05-29 16:56:15] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2024-05-29 16:56:16] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 0 ms to minimize.
[2024-05-29 16:56:16] [INFO ] Deduced a trap composed of 5 places in 667 ms of which 1 ms to minimize.
[2024-05-29 16:56:17] [INFO ] Deduced a trap composed of 5 places in 676 ms of which 0 ms to minimize.
[2024-05-29 16:56:18] [INFO ] Deduced a trap composed of 5 places in 577 ms of which 4 ms to minimize.
[2024-05-29 16:56:18] [INFO ] Deduced a trap composed of 5 places in 757 ms of which 6 ms to minimize.
[2024-05-29 16:56:19] [INFO ] Deduced a trap composed of 5 places in 599 ms of which 0 ms to minimize.
[2024-05-29 16:56:20] [INFO ] Deduced a trap composed of 5 places in 591 ms of which 1 ms to minimize.
[2024-05-29 16:56:20] [INFO ] Deduced a trap composed of 5 places in 582 ms of which 0 ms to minimize.
[2024-05-29 16:56:21] [INFO ] Deduced a trap composed of 5 places in 536 ms of which 1 ms to minimize.
[2024-05-29 16:56:21] [INFO ] Deduced a trap composed of 5 places in 439 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
[2024-05-29 16:56:22] [INFO ] Deduced a trap composed of 5 places in 409 ms of which 1 ms to minimize.
[2024-05-29 16:56:23] [INFO ] Deduced a trap composed of 5 places in 393 ms of which 0 ms to minimize.
[2024-05-29 16:56:23] [INFO ] Deduced a trap composed of 5 places in 296 ms of which 1 ms to minimize.
[2024-05-29 16:56:23] [INFO ] Deduced a trap composed of 5 places in 346 ms of which 1 ms to minimize.
[2024-05-29 16:56:23] [INFO ] Deduced a trap composed of 5 places in 285 ms of which 1 ms to minimize.
[2024-05-29 16:56:24] [INFO ] Deduced a trap composed of 5 places in 279 ms of which 0 ms to minimize.
[2024-05-29 16:56:24] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 0 ms to minimize.
[2024-05-29 16:56:24] [INFO ] Deduced a trap composed of 5 places in 283 ms of which 1 ms to minimize.
[2024-05-29 16:56:24] [INFO ] Deduced a trap composed of 5 places in 233 ms of which 0 ms to minimize.
[2024-05-29 16:56:25] [INFO ] Deduced a trap composed of 5 places in 273 ms of which 0 ms to minimize.
[2024-05-29 16:56:25] [INFO ] Deduced a trap composed of 5 places in 291 ms of which 0 ms to minimize.
[2024-05-29 16:56:25] [INFO ] Deduced a trap composed of 5 places in 350 ms of which 0 ms to minimize.
[2024-05-29 16:56:26] [INFO ] Deduced a trap composed of 5 places in 338 ms of which 1 ms to minimize.
[2024-05-29 16:56:26] [INFO ] Deduced a trap composed of 5 places in 247 ms of which 0 ms to minimize.
[2024-05-29 16:56:26] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 1 ms to minimize.
[2024-05-29 16:56:27] [INFO ] Deduced a trap composed of 5 places in 280 ms of which 1 ms to minimize.
[2024-05-29 16:56:27] [INFO ] Deduced a trap composed of 5 places in 278 ms of which 0 ms to minimize.
[2024-05-29 16:56:27] [INFO ] Deduced a trap composed of 5 places in 234 ms of which 0 ms to minimize.
[2024-05-29 16:56:27] [INFO ] Deduced a trap composed of 5 places in 233 ms of which 1 ms to minimize.
[2024-05-29 16:56:27] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
[2024-05-29 16:56:33] [INFO ] Deduced a trap composed of 5 places in 301 ms of which 0 ms to minimize.
[2024-05-29 16:56:33] [INFO ] Deduced a trap composed of 5 places in 288 ms of which 1 ms to minimize.
[2024-05-29 16:56:33] [INFO ] Deduced a trap composed of 5 places in 283 ms of which 1 ms to minimize.
[2024-05-29 16:56:34] [INFO ] Deduced a trap composed of 5 places in 225 ms of which 0 ms to minimize.
[2024-05-29 16:56:34] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 1 ms to minimize.
[2024-05-29 16:56:34] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 0 ms to minimize.
[2024-05-29 16:56:34] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 1 ms to minimize.
[2024-05-29 16:56:34] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 0 ms to minimize.
[2024-05-29 16:56:34] [INFO ] Deduced a trap composed of 5 places in 233 ms of which 1 ms to minimize.
[2024-05-29 16:56:35] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 0 ms to minimize.
[2024-05-29 16:56:35] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 1 ms to minimize.
[2024-05-29 16:56:35] [INFO ] Deduced a trap composed of 5 places in 233 ms of which 0 ms to minimize.
[2024-05-29 16:56:35] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 0 ms to minimize.
[2024-05-29 16:56:35] [INFO ] Deduced a trap composed of 5 places in 227 ms of which 1 ms to minimize.
[2024-05-29 16:56:36] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 0 ms to minimize.
SMT process timed out in 66209ms, After SMT, problems are : Problem set: 0 solved, 2148 unsolved
Search for dead transitions found 0 dead transitions in 66230ms
Starting structural reductions in SI_LTL mode, iteration 1 : 68/136 places, 2149/4286 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68345 ms. Remains : 68/136 places, 2149/4286 transitions.
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 13 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-05-29 16:56:36] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
// Phase 1: matrix 4274 rows 136 cols
[2024-05-29 16:56:36] [INFO ] Computed 1 invariants in 23 ms
[2024-05-29 16:56:36] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-29 16:56:36] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:56:36] [INFO ] Invariant cache hit.
[2024-05-29 16:56:37] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:56:37] [INFO ] Implicit Places using invariants and state equation in 1485 ms returned []
Implicit Place search using SMT with State Equation took 1555 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-05-29 16:56:37] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:56:37] [INFO ] Invariant cache hit.
[2024-05-29 16:56:38] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 100281ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 100329ms
Finished structural reductions in LTL mode , in 1 iterations and 101911 ms. Remains : 136/136 places, 4286/4286 transitions.
Treatment of property StigmergyCommit-PT-10a-LTLFireability-07 finished in 404885 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(F(p0)))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 135 transition count 4251
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 101 transition count 4251
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 68 place count 101 transition count 4240
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 90 place count 90 transition count 4240
Performed 34 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 158 place count 56 transition count 4194
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 2 with 2047 rules applied. Total rules applied 2205 place count 56 transition count 2147
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 2225 place count 46 transition count 2137
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 2235 place count 46 transition count 2127
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 2246 place count 46 transition count 2116
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 2268 place count 35 transition count 2105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2269 place count 34 transition count 2104
Applied a total of 2269 rules in 2582 ms. Remains 34 /136 variables (removed 102) and now considering 2104/4286 (removed 2182) transitions.
[2024-05-29 16:58:21] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
// Phase 1: matrix 2092 rows 34 cols
[2024-05-29 16:58:21] [INFO ] Computed 1 invariants in 7 ms
[2024-05-29 16:58:21] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-29 16:58:21] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 16:58:21] [INFO ] Invariant cache hit.
[2024-05-29 16:58:21] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 16:58:21] [INFO ] Implicit Places using invariants and state equation in 667 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
[2024-05-29 16:58:22] [INFO ] Redundant transitions in 270 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-05-29 16:58:22] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 16:58:22] [INFO ] Invariant cache hit.
[2024-05-29 16:58:22] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 16:59:02] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-05-29 16:59:02] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-05-29 16:59:02] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-29 16:59:02] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-29 16:59:02] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 1 ms to minimize.
[2024-05-29 16:59:02] [INFO ] Deduced a trap composed of 4 places in 224 ms of which 0 ms to minimize.
[2024-05-29 16:59:03] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 1 ms to minimize.
[2024-05-29 16:59:03] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 1 ms to minimize.
[2024-05-29 16:59:03] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 1 ms to minimize.
[2024-05-29 16:59:04] [INFO ] Deduced a trap composed of 4 places in 636 ms of which 1 ms to minimize.
[2024-05-29 16:59:04] [INFO ] Deduced a trap composed of 4 places in 636 ms of which 0 ms to minimize.
[2024-05-29 16:59:05] [INFO ] Deduced a trap composed of 4 places in 702 ms of which 1 ms to minimize.
[2024-05-29 16:59:06] [INFO ] Deduced a trap composed of 4 places in 637 ms of which 1 ms to minimize.
[2024-05-29 16:59:06] [INFO ] Deduced a trap composed of 4 places in 618 ms of which 0 ms to minimize.
[2024-05-29 16:59:07] [INFO ] Deduced a trap composed of 4 places in 685 ms of which 0 ms to minimize.
[2024-05-29 16:59:08] [INFO ] Deduced a trap composed of 4 places in 544 ms of which 1 ms to minimize.
[2024-05-29 16:59:08] [INFO ] Deduced a trap composed of 4 places in 510 ms of which 1 ms to minimize.
[2024-05-29 16:59:09] [INFO ] Deduced a trap composed of 4 places in 465 ms of which 0 ms to minimize.
[2024-05-29 16:59:09] [INFO ] Deduced a trap composed of 4 places in 384 ms of which 0 ms to minimize.
[2024-05-29 16:59:09] [INFO ] Deduced a trap composed of 4 places in 531 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 16:59:10] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-29 16:59:10] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-05-29 16:59:10] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-05-29 16:59:10] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2024-05-29 16:59:10] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2024-05-29 16:59:10] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 16:59:10] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 1 ms to minimize.
[2024-05-29 16:59:11] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 0 ms to minimize.
[2024-05-29 16:59:11] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-05-29 16:59:11] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 0 ms to minimize.
[2024-05-29 16:59:11] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-05-29 16:59:11] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 1 ms to minimize.
[2024-05-29 16:59:11] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 2 ms to minimize.
[2024-05-29 16:59:11] [INFO ] Deduced a trap composed of 4 places in 307 ms of which 1 ms to minimize.
[2024-05-29 16:59:12] [INFO ] Deduced a trap composed of 4 places in 274 ms of which 0 ms to minimize.
[2024-05-29 16:59:12] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 0 ms to minimize.
[2024-05-29 16:59:12] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 1 ms to minimize.
[2024-05-29 16:59:12] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 1 ms to minimize.
[2024-05-29 16:59:12] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 0 ms to minimize.
[2024-05-29 16:59:13] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 16:59:16] [INFO ] Deduced a trap composed of 4 places in 404 ms of which 1 ms to minimize.
[2024-05-29 16:59:17] [INFO ] Deduced a trap composed of 4 places in 389 ms of which 1 ms to minimize.
[2024-05-29 16:59:17] [INFO ] Deduced a trap composed of 4 places in 335 ms of which 0 ms to minimize.
[2024-05-29 16:59:17] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 0 ms to minimize.
[2024-05-29 16:59:18] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 0 ms to minimize.
[2024-05-29 16:59:18] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 1 ms to minimize.
[2024-05-29 16:59:18] [INFO ] Deduced a trap composed of 4 places in 276 ms of which 0 ms to minimize.
[2024-05-29 16:59:18] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 1 ms to minimize.
[2024-05-29 16:59:19] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 0 ms to minimize.
[2024-05-29 16:59:19] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 1 ms to minimize.
[2024-05-29 16:59:19] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 0 ms to minimize.
[2024-05-29 16:59:19] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 1 ms to minimize.
[2024-05-29 16:59:19] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2024-05-29 16:59:19] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 1 ms to minimize.
[2024-05-29 16:59:19] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 34/2126 variables, and 56 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/34 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2093 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 4 (OVERLAPS) 2091/2125 variables, 34/90 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2125 variables, 2068/2158 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2125/2126 variables, and 2159 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 2068/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
After SMT, in 93722ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 93743ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/136 places, 2104/4286 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97312 ms. Remains : 34/136 places, 2104/4286 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-10
Stuttering criterion allowed to conclude after 93516 steps with 7792 reset in 4282 ms.
FORMULA StigmergyCommit-PT-10a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-10a-LTLFireability-10 finished in 101708 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 (G((F(p0)&&p2))&&p1))))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 17 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-05-29 17:00:00] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
// Phase 1: matrix 4274 rows 136 cols
[2024-05-29 17:00:00] [INFO ] Computed 1 invariants in 19 ms
[2024-05-29 17:00:00] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-29 17:00:00] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 17:00:00] [INFO ] Invariant cache hit.
[2024-05-29 17:00:01] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 17:00:01] [INFO ] Implicit Places using invariants and state equation in 1418 ms returned []
Implicit Place search using SMT with State Equation took 1496 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-05-29 17:00:01] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 17:00:01] [INFO ] Invariant cache hit.
[2024-05-29 17:00:02] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 97610ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 97669ms
Finished structural reductions in LTL mode , in 1 iterations and 99213 ms. Remains : 136/136 places, 4286/4286 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), true, (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-11
Entered a terminal (fully accepting) state of product in 70 steps with 0 reset in 5 ms.
FORMULA StigmergyCommit-PT-10a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-10a-LTLFireability-11 finished in 99469 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((X(p1)||G((G(p1)||p2))||p0))))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 15 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-05-29 17:01:39] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 17:01:39] [INFO ] Invariant cache hit.
[2024-05-29 17:01:39] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-29 17:01:39] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 17:01:39] [INFO ] Invariant cache hit.
[2024-05-29 17:01:40] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 17:01:41] [INFO ] Implicit Places using invariants and state equation in 1421 ms returned []
Implicit Place search using SMT with State Equation took 1477 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-05-29 17:01:41] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 17:01:41] [INFO ] Invariant cache hit.
[2024-05-29 17:01:41] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 97535ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 97578ms
Finished structural reductions in LTL mode , in 1 iterations and 99082 ms. Remains : 136/136 places, 4286/4286 transitions.
Stuttering acceptance computed with spot in 221 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-13
Stuttering criterion allowed to conclude after 69 steps with 0 reset in 2 ms.
FORMULA StigmergyCommit-PT-10a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-10a-LTLFireability-13 finished in 99331 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 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 15 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-05-29 17:03:19] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 17:03:19] [INFO ] Invariant cache hit.
[2024-05-29 17:03:19] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-29 17:03:19] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 17:03:19] [INFO ] Invariant cache hit.
[2024-05-29 17:03:20] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 17:03:20] [INFO ] Implicit Places using invariants and state equation in 1431 ms returned []
Implicit Place search using SMT with State Equation took 1466 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-05-29 17:03:20] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 17:03:20] [INFO ] Invariant cache hit.
[2024-05-29 17:03:20] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 97394ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 97436ms
Finished structural reductions in LTL mode , in 1 iterations and 98932 ms. Remains : 136/136 places, 4286/4286 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-14
Product exploration explored 100000 steps with 1428 reset in 1968 ms.
Product exploration explored 100000 steps with 1428 reset in 1929 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 276 steps (0 resets) in 16 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 157 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 17:05:02] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 17:05:02] [INFO ] Invariant cache hit.
[2024-05-29 17:05:05] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-29 17:05:05] [INFO ] [Real]Absence check using state equation in 781 ms returned sat
[2024-05-29 17:05:06] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 17:05:06] [INFO ] [Real]Added 4104 Read/Feed constraints in 396 ms returned sat
[2024-05-29 17:05:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 17:05:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-29 17:05:09] [INFO ] [Nat]Absence check using state equation in 757 ms returned sat
[2024-05-29 17:05:10] [INFO ] [Nat]Added 4104 Read/Feed constraints in 497 ms returned sat
[2024-05-29 17:05:10] [INFO ] Computed and/alt/rep : 145/178/145 causal constraints (skipped 4128 transitions) in 605 ms.
[2024-05-29 17:05:15] [INFO ] Added : 111 causal constraints over 23 iterations in 4867 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 12 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-05-29 17:05:15] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 17:05:15] [INFO ] Invariant cache hit.
[2024-05-29 17:05:15] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-29 17:05:15] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 17:05:15] [INFO ] Invariant cache hit.
[2024-05-29 17:05:16] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 17:05:16] [INFO ] Implicit Places using invariants and state equation in 1422 ms returned []
Implicit Place search using SMT with State Equation took 1470 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-05-29 17:05:16] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 17:05:16] [INFO ] Invariant cache hit.
[2024-05-29 17:05:17] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 97522ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 97564ms
Finished structural reductions in LTL mode , in 1 iterations and 99057 ms. Remains : 136/136 places, 4286/4286 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 66 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 276 steps (0 resets) in 18 ms. (14 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 17:06:54] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 17:06:54] [INFO ] Invariant cache hit.
[2024-05-29 17:06:57] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-29 17:06:58] [INFO ] [Real]Absence check using state equation in 782 ms returned sat
[2024-05-29 17:06:58] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 17:06:58] [INFO ] [Real]Added 4104 Read/Feed constraints in 383 ms returned sat
[2024-05-29 17:06:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 17:07:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 17:07:02] [INFO ] [Nat]Absence check using state equation in 742 ms returned sat
[2024-05-29 17:07:02] [INFO ] [Nat]Added 4104 Read/Feed constraints in 475 ms returned sat
[2024-05-29 17:07:03] [INFO ] Computed and/alt/rep : 145/178/145 causal constraints (skipped 4128 transitions) in 664 ms.
[2024-05-29 17:07:07] [INFO ] Added : 111 causal constraints over 23 iterations in 4885 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1428 reset in 1859 ms.
Product exploration explored 100000 steps with 1428 reset in 1891 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 136 transition count 4286
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 34 place count 136 transition count 4297
Deduced a syphon composed of 45 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 45 place count 136 transition count 4297
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 67 place count 114 transition count 4275
Deduced a syphon composed of 23 places in 1 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 89 place count 114 transition count 4275
Performed 45 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 68 places in 1 ms
Iterating global reduction 1 with 45 rules applied. Total rules applied 134 place count 114 transition count 4286
Ensure Unique test removed 2069 transitions
Reduce isomorphic transitions removed 2069 transitions.
Iterating post reduction 1 with 2069 rules applied. Total rules applied 2203 place count 114 transition count 2217
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 2227 place count 90 transition count 2193
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 2251 place count 90 transition count 2193
Deduced a syphon composed of 44 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 2 with 22 rules applied. Total rules applied 2273 place count 90 transition count 2171
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 55 places in 4 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 2284 place count 90 transition count 2171
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 2306 place count 68 transition count 2149
Deduced a syphon composed of 33 places in 1 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 2328 place count 68 transition count 2149
Deduced a syphon composed of 33 places in 0 ms
Applied a total of 2328 rules in 1805 ms. Remains 68 /136 variables (removed 68) and now considering 2149/4286 (removed 2137) transitions.
[2024-05-29 17:07:13] [INFO ] Redundant transitions in 286 ms returned []
Running 2148 sub problems to find dead transitions.
[2024-05-29 17:07:13] [INFO ] Flow matrix only has 2137 transitions (discarded 12 similar events)
// Phase 1: matrix 2137 rows 68 cols
[2024-05-29 17:07:13] [INFO ] Computed 1 invariants in 12 ms
[2024-05-29 17:07:13] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
[2024-05-29 17:07:55] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
[2024-05-29 17:07:55] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2024-05-29 17:07:55] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2024-05-29 17:07:55] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 0 ms to minimize.
[2024-05-29 17:07:55] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2024-05-29 17:07:55] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2024-05-29 17:07:56] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2024-05-29 17:07:56] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
[2024-05-29 17:07:56] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2024-05-29 17:07:56] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-05-29 17:07:56] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2024-05-29 17:07:57] [INFO ] Deduced a trap composed of 5 places in 671 ms of which 1 ms to minimize.
[2024-05-29 17:07:57] [INFO ] Deduced a trap composed of 5 places in 686 ms of which 1 ms to minimize.
[2024-05-29 17:07:58] [INFO ] Deduced a trap composed of 5 places in 576 ms of which 1 ms to minimize.
[2024-05-29 17:07:59] [INFO ] Deduced a trap composed of 5 places in 749 ms of which 0 ms to minimize.
[2024-05-29 17:07:59] [INFO ] Deduced a trap composed of 5 places in 623 ms of which 0 ms to minimize.
[2024-05-29 17:08:00] [INFO ] Deduced a trap composed of 5 places in 631 ms of which 1 ms to minimize.
[2024-05-29 17:08:01] [INFO ] Deduced a trap composed of 5 places in 620 ms of which 1 ms to minimize.
[2024-05-29 17:08:01] [INFO ] Deduced a trap composed of 5 places in 523 ms of which 0 ms to minimize.
[2024-05-29 17:08:02] [INFO ] Deduced a trap composed of 5 places in 448 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
[2024-05-29 17:08:02] [INFO ] Deduced a trap composed of 5 places in 364 ms of which 0 ms to minimize.
[2024-05-29 17:08:03] [INFO ] Deduced a trap composed of 5 places in 355 ms of which 0 ms to minimize.
[2024-05-29 17:08:03] [INFO ] Deduced a trap composed of 5 places in 343 ms of which 1 ms to minimize.
[2024-05-29 17:08:03] [INFO ] Deduced a trap composed of 5 places in 310 ms of which 0 ms to minimize.
[2024-05-29 17:08:04] [INFO ] Deduced a trap composed of 5 places in 248 ms of which 1 ms to minimize.
[2024-05-29 17:08:04] [INFO ] Deduced a trap composed of 5 places in 265 ms of which 1 ms to minimize.
[2024-05-29 17:08:04] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 0 ms to minimize.
[2024-05-29 17:08:04] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 0 ms to minimize.
[2024-05-29 17:08:05] [INFO ] Deduced a trap composed of 5 places in 204 ms of which 0 ms to minimize.
[2024-05-29 17:08:05] [INFO ] Deduced a trap composed of 5 places in 267 ms of which 1 ms to minimize.
[2024-05-29 17:08:05] [INFO ] Deduced a trap composed of 5 places in 257 ms of which 1 ms to minimize.
[2024-05-29 17:08:06] [INFO ] Deduced a trap composed of 5 places in 291 ms of which 1 ms to minimize.
[2024-05-29 17:08:06] [INFO ] Deduced a trap composed of 5 places in 286 ms of which 1 ms to minimize.
[2024-05-29 17:08:06] [INFO ] Deduced a trap composed of 5 places in 239 ms of which 1 ms to minimize.
[2024-05-29 17:08:06] [INFO ] Deduced a trap composed of 5 places in 224 ms of which 1 ms to minimize.
[2024-05-29 17:08:07] [INFO ] Deduced a trap composed of 5 places in 255 ms of which 1 ms to minimize.
[2024-05-29 17:08:07] [INFO ] Deduced a trap composed of 5 places in 246 ms of which 1 ms to minimize.
[2024-05-29 17:08:07] [INFO ] Deduced a trap composed of 5 places in 233 ms of which 0 ms to minimize.
[2024-05-29 17:08:07] [INFO ] Deduced a trap composed of 5 places in 224 ms of which 1 ms to minimize.
[2024-05-29 17:08:07] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
[2024-05-29 17:08:13] [INFO ] Deduced a trap composed of 5 places in 343 ms of which 0 ms to minimize.
[2024-05-29 17:08:13] [INFO ] Deduced a trap composed of 5 places in 278 ms of which 1 ms to minimize.
[2024-05-29 17:08:13] [INFO ] Deduced a trap composed of 5 places in 258 ms of which 1 ms to minimize.
[2024-05-29 17:08:13] [INFO ] Deduced a trap composed of 5 places in 224 ms of which 1 ms to minimize.
[2024-05-29 17:08:14] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 1 ms to minimize.
[2024-05-29 17:08:14] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 1 ms to minimize.
[2024-05-29 17:08:14] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 0 ms to minimize.
[2024-05-29 17:08:14] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 0 ms to minimize.
[2024-05-29 17:08:14] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 1 ms to minimize.
[2024-05-29 17:08:15] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 0 ms to minimize.
[2024-05-29 17:08:15] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 0 ms to minimize.
[2024-05-29 17:08:15] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 0 ms to minimize.
[2024-05-29 17:08:15] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 0 ms to minimize.
[2024-05-29 17:08:15] [INFO ] Deduced a trap composed of 5 places in 198 ms of which 0 ms to minimize.
[2024-05-29 17:08:15] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 0 ms to minimize.
[2024-05-29 17:08:16] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 1 ms to minimize.
[2024-05-29 17:08:16] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
[2024-05-29 17:08:16] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 0 ms to minimize.
SMT process timed out in 62578ms, After SMT, problems are : Problem set: 0 solved, 2148 unsolved
Search for dead transitions found 0 dead transitions in 62599ms
Starting structural reductions in SI_LTL mode, iteration 1 : 68/136 places, 2149/4286 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64708 ms. Remains : 68/136 places, 2149/4286 transitions.
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 13 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-05-29 17:08:16] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
// Phase 1: matrix 4274 rows 136 cols
[2024-05-29 17:08:16] [INFO ] Computed 1 invariants in 19 ms
[2024-05-29 17:08:16] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-29 17:08:16] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 17:08:16] [INFO ] Invariant cache hit.
[2024-05-29 17:08:17] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 17:08:17] [INFO ] Implicit Places using invariants and state equation in 1476 ms returned []
Implicit Place search using SMT with State Equation took 1541 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-05-29 17:08:17] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 17:08:17] [INFO ] Invariant cache hit.
[2024-05-29 17:08:18] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 97193ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 97244ms
Finished structural reductions in LTL mode , in 1 iterations and 98814 ms. Remains : 136/136 places, 4286/4286 transitions.
Treatment of property StigmergyCommit-PT-10a-LTLFireability-14 finished in 396472 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((F(p0)&&F(p1))))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 135 transition count 4251
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 101 transition count 4251
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 68 place count 101 transition count 4240
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 90 place count 90 transition count 4240
Performed 34 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 158 place count 56 transition count 4194
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 2 with 2047 rules applied. Total rules applied 2205 place count 56 transition count 2147
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 2225 place count 46 transition count 2137
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 2235 place count 46 transition count 2127
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 2246 place count 46 transition count 2116
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 2268 place count 35 transition count 2105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2269 place count 34 transition count 2104
Applied a total of 2269 rules in 2511 ms. Remains 34 /136 variables (removed 102) and now considering 2104/4286 (removed 2182) transitions.
[2024-05-29 17:09:58] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
// Phase 1: matrix 2092 rows 34 cols
[2024-05-29 17:09:58] [INFO ] Computed 1 invariants in 12 ms
[2024-05-29 17:09:58] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-29 17:09:58] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 17:09:58] [INFO ] Invariant cache hit.
[2024-05-29 17:09:58] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 17:09:58] [INFO ] Implicit Places using invariants and state equation in 681 ms returned []
Implicit Place search using SMT with State Equation took 728 ms to find 0 implicit places.
[2024-05-29 17:09:59] [INFO ] Redundant transitions in 266 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-05-29 17:09:59] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 17:09:59] [INFO ] Invariant cache hit.
[2024-05-29 17:09:59] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 17:10:38] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-29 17:10:38] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 17:10:38] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-29 17:10:38] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-29 17:10:38] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 1 ms to minimize.
[2024-05-29 17:10:38] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 0 ms to minimize.
[2024-05-29 17:10:39] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 1 ms to minimize.
[2024-05-29 17:10:39] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 0 ms to minimize.
[2024-05-29 17:10:39] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 1 ms to minimize.
[2024-05-29 17:10:40] [INFO ] Deduced a trap composed of 4 places in 666 ms of which 0 ms to minimize.
[2024-05-29 17:10:40] [INFO ] Deduced a trap composed of 4 places in 662 ms of which 1 ms to minimize.
[2024-05-29 17:10:41] [INFO ] Deduced a trap composed of 4 places in 643 ms of which 0 ms to minimize.
[2024-05-29 17:10:42] [INFO ] Deduced a trap composed of 4 places in 645 ms of which 0 ms to minimize.
[2024-05-29 17:10:42] [INFO ] Deduced a trap composed of 4 places in 635 ms of which 0 ms to minimize.
[2024-05-29 17:10:43] [INFO ] Deduced a trap composed of 4 places in 670 ms of which 1 ms to minimize.
[2024-05-29 17:10:44] [INFO ] Deduced a trap composed of 4 places in 542 ms of which 0 ms to minimize.
[2024-05-29 17:10:44] [INFO ] Deduced a trap composed of 4 places in 522 ms of which 0 ms to minimize.
[2024-05-29 17:10:44] [INFO ] Deduced a trap composed of 4 places in 412 ms of which 0 ms to minimize.
[2024-05-29 17:10:45] [INFO ] Deduced a trap composed of 4 places in 357 ms of which 0 ms to minimize.
[2024-05-29 17:10:45] [INFO ] Deduced a trap composed of 4 places in 537 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 17:10:46] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-05-29 17:10:46] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 17:10:46] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-05-29 17:10:46] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 1 ms to minimize.
[2024-05-29 17:10:46] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2024-05-29 17:10:46] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-29 17:10:46] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2024-05-29 17:10:47] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 0 ms to minimize.
[2024-05-29 17:10:47] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-05-29 17:10:47] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
[2024-05-29 17:10:47] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-29 17:10:47] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 0 ms to minimize.
[2024-05-29 17:10:47] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 0 ms to minimize.
[2024-05-29 17:10:47] [INFO ] Deduced a trap composed of 4 places in 312 ms of which 1 ms to minimize.
[2024-05-29 17:10:48] [INFO ] Deduced a trap composed of 4 places in 257 ms of which 1 ms to minimize.
[2024-05-29 17:10:48] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 1 ms to minimize.
[2024-05-29 17:10:48] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 0 ms to minimize.
[2024-05-29 17:10:48] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 0 ms to minimize.
[2024-05-29 17:10:48] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 1 ms to minimize.
[2024-05-29 17:10:49] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 17:10:53] [INFO ] Deduced a trap composed of 4 places in 379 ms of which 0 ms to minimize.
[2024-05-29 17:10:53] [INFO ] Deduced a trap composed of 4 places in 372 ms of which 1 ms to minimize.
[2024-05-29 17:10:53] [INFO ] Deduced a trap composed of 4 places in 306 ms of which 1 ms to minimize.
[2024-05-29 17:10:54] [INFO ] Deduced a trap composed of 4 places in 270 ms of which 1 ms to minimize.
[2024-05-29 17:10:54] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 0 ms to minimize.
[2024-05-29 17:10:54] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 1 ms to minimize.
[2024-05-29 17:10:54] [INFO ] Deduced a trap composed of 4 places in 271 ms of which 0 ms to minimize.
[2024-05-29 17:10:55] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 1 ms to minimize.
[2024-05-29 17:10:55] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 1 ms to minimize.
[2024-05-29 17:10:55] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 1 ms to minimize.
[2024-05-29 17:10:55] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 1 ms to minimize.
[2024-05-29 17:10:55] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 0 ms to minimize.
[2024-05-29 17:10:55] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 0 ms to minimize.
[2024-05-29 17:10:55] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 1 ms to minimize.
[2024-05-29 17:10:56] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 34/2126 variables, and 56 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/34 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2093 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 4 (OVERLAPS) 2091/2125 variables, 34/90 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2125 variables, 2068/2158 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2125/2126 variables, and 2159 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 2068/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
After SMT, in 92685ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 92705ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/136 places, 2104/4286 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96227 ms. Remains : 34/136 places, 2104/4286 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-15
Stuttering criterion allowed to conclude after 69275 steps with 5772 reset in 3174 ms.
FORMULA StigmergyCommit-PT-10a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-10a-LTLFireability-15 finished in 99552 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||F((F(p0)&&p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : StigmergyCommit-PT-10a-LTLFireability-07
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 135 transition count 4251
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 101 transition count 4251
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 68 place count 101 transition count 4240
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 90 place count 90 transition count 4240
Performed 34 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 158 place count 56 transition count 4194
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 2 with 2047 rules applied. Total rules applied 2205 place count 56 transition count 2147
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 2225 place count 46 transition count 2137
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 2235 place count 46 transition count 2127
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2236 place count 45 transition count 2126
Applied a total of 2236 rules in 330 ms. Remains 45 /136 variables (removed 91) and now considering 2126/4286 (removed 2160) transitions.
[2024-05-29 17:11:35] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
// Phase 1: matrix 2114 rows 45 cols
[2024-05-29 17:11:35] [INFO ] Computed 1 invariants in 7 ms
[2024-05-29 17:11:35] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-29 17:11:35] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-05-29 17:11:35] [INFO ] Invariant cache hit.
[2024-05-29 17:11:36] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 17:11:36] [INFO ] Implicit Places using invariants and state equation in 643 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
Running 2115 sub problems to find dead transitions.
[2024-05-29 17:11:36] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-05-29 17:11:36] [INFO ] Invariant cache hit.
[2024-05-29 17:11:36] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
At refinement iteration 1 (OVERLAPS) 11/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-05-29 17:12:16] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 0 ms to minimize.
[2024-05-29 17:12:16] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 0 ms to minimize.
[2024-05-29 17:12:16] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-05-29 17:12:16] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 0 ms to minimize.
[2024-05-29 17:12:16] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 1 ms to minimize.
[2024-05-29 17:12:16] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
[2024-05-29 17:12:17] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 0 ms to minimize.
[2024-05-29 17:12:17] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 0 ms to minimize.
[2024-05-29 17:12:17] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 0 ms to minimize.
[2024-05-29 17:12:17] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 1 ms to minimize.
[2024-05-29 17:12:18] [INFO ] Deduced a trap composed of 5 places in 560 ms of which 1 ms to minimize.
[2024-05-29 17:12:18] [INFO ] Deduced a trap composed of 5 places in 472 ms of which 0 ms to minimize.
[2024-05-29 17:12:18] [INFO ] Deduced a trap composed of 6 places in 434 ms of which 0 ms to minimize.
[2024-05-29 17:12:19] [INFO ] Deduced a trap composed of 5 places in 420 ms of which 1 ms to minimize.
[2024-05-29 17:12:19] [INFO ] Deduced a trap composed of 5 places in 418 ms of which 0 ms to minimize.
[2024-05-29 17:12:20] [INFO ] Deduced a trap composed of 5 places in 406 ms of which 0 ms to minimize.
[2024-05-29 17:12:20] [INFO ] Deduced a trap composed of 5 places in 404 ms of which 0 ms to minimize.
[2024-05-29 17:12:21] [INFO ] Deduced a trap composed of 5 places in 380 ms of which 1 ms to minimize.
[2024-05-29 17:12:21] [INFO ] Deduced a trap composed of 5 places in 475 ms of which 0 ms to minimize.
[2024-05-29 17:12:21] [INFO ] Deduced a trap composed of 5 places in 480 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-05-29 17:12:22] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
[2024-05-29 17:12:22] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 0 ms to minimize.
[2024-05-29 17:12:22] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 0 ms to minimize.
[2024-05-29 17:12:22] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 0 ms to minimize.
[2024-05-29 17:12:22] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2024-05-29 17:12:22] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2024-05-29 17:12:23] [INFO ] Deduced a trap composed of 5 places in 366 ms of which 0 ms to minimize.
[2024-05-29 17:12:23] [INFO ] Deduced a trap composed of 6 places in 291 ms of which 1 ms to minimize.
[2024-05-29 17:12:23] [INFO ] Deduced a trap composed of 5 places in 325 ms of which 1 ms to minimize.
[2024-05-29 17:12:24] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 1 ms to minimize.
[2024-05-29 17:12:24] [INFO ] Deduced a trap composed of 6 places in 290 ms of which 0 ms to minimize.
[2024-05-29 17:12:24] [INFO ] Deduced a trap composed of 5 places in 243 ms of which 0 ms to minimize.
[2024-05-29 17:12:24] [INFO ] Deduced a trap composed of 5 places in 256 ms of which 1 ms to minimize.
[2024-05-29 17:12:25] [INFO ] Deduced a trap composed of 6 places in 192 ms of which 0 ms to minimize.
[2024-05-29 17:12:25] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-05-29 17:12:37] [INFO ] Deduced a trap composed of 5 places in 366 ms of which 1 ms to minimize.
[2024-05-29 17:12:38] [INFO ] Deduced a trap composed of 5 places in 368 ms of which 1 ms to minimize.
[2024-05-29 17:12:38] [INFO ] Deduced a trap composed of 5 places in 320 ms of which 0 ms to minimize.
[2024-05-29 17:12:38] [INFO ] Deduced a trap composed of 5 places in 334 ms of which 0 ms to minimize.
[2024-05-29 17:12:39] [INFO ] Deduced a trap composed of 6 places in 315 ms of which 0 ms to minimize.
[2024-05-29 17:12:39] [INFO ] Deduced a trap composed of 5 places in 406 ms of which 0 ms to minimize.
SMT process timed out in 63076ms, After SMT, problems are : Problem set: 0 solved, 2115 unsolved
Search for dead transitions found 0 dead transitions in 63096ms
Starting structural reductions in LI_LTL mode, iteration 1 : 45/136 places, 2126/4286 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 64182 ms. Remains : 45/136 places, 2126/4286 transitions.
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-07
Product exploration explored 100000 steps with 8333 reset in 4498 ms.
Product exploration explored 100000 steps with 8333 reset in 4509 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 : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 63 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 44 steps (0 resets) in 9 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 77 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 17:12:49] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-05-29 17:12:49] [INFO ] Invariant cache hit.
[2024-05-29 17:12:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 17:12:50] [INFO ] [Real]Absence check using state equation in 358 ms returned sat
[2024-05-29 17:12:50] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 17:12:51] [INFO ] [Real]Added 2069 Read/Feed constraints in 179 ms returned sat
[2024-05-29 17:12:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 17:12:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 17:12:52] [INFO ] [Nat]Absence check using state equation in 359 ms returned sat
[2024-05-29 17:12:52] [INFO ] [Nat]Added 2069 Read/Feed constraints in 218 ms returned sat
[2024-05-29 17:12:53] [INFO ] Computed and/alt/rep : 11/11/11 causal constraints (skipped 2092 transitions) in 273 ms.
[2024-05-29 17:12:53] [INFO ] Added : 0 causal constraints over 0 iterations in 449 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 11 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 2126/2126 transitions.
Applied a total of 0 rules in 5 ms. Remains 45 /45 variables (removed 0) and now considering 2126/2126 (removed 0) transitions.
[2024-05-29 17:12:53] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-05-29 17:12:53] [INFO ] Invariant cache hit.
[2024-05-29 17:12:53] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-29 17:12:53] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-05-29 17:12:53] [INFO ] Invariant cache hit.
[2024-05-29 17:12:53] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 17:12:53] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
Running 2115 sub problems to find dead transitions.
[2024-05-29 17:12:54] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-05-29 17:12:54] [INFO ] Invariant cache hit.
[2024-05-29 17:12:54] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
At refinement iteration 1 (OVERLAPS) 11/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-05-29 17:13:33] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 0 ms to minimize.
[2024-05-29 17:13:33] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2024-05-29 17:13:34] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 1 ms to minimize.
[2024-05-29 17:13:34] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 1 ms to minimize.
[2024-05-29 17:13:34] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 1 ms to minimize.
[2024-05-29 17:13:34] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 0 ms to minimize.
[2024-05-29 17:13:34] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 0 ms to minimize.
[2024-05-29 17:13:34] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 0 ms to minimize.
[2024-05-29 17:13:34] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 0 ms to minimize.
[2024-05-29 17:13:34] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 1 ms to minimize.
[2024-05-29 17:13:35] [INFO ] Deduced a trap composed of 5 places in 571 ms of which 1 ms to minimize.
[2024-05-29 17:13:35] [INFO ] Deduced a trap composed of 5 places in 485 ms of which 1 ms to minimize.
[2024-05-29 17:13:36] [INFO ] Deduced a trap composed of 6 places in 413 ms of which 1 ms to minimize.
[2024-05-29 17:13:36] [INFO ] Deduced a trap composed of 5 places in 437 ms of which 1 ms to minimize.
[2024-05-29 17:13:37] [INFO ] Deduced a trap composed of 5 places in 445 ms of which 0 ms to minimize.
[2024-05-29 17:13:37] [INFO ] Deduced a trap composed of 5 places in 409 ms of which 1 ms to minimize.
[2024-05-29 17:13:38] [INFO ] Deduced a trap composed of 5 places in 412 ms of which 0 ms to minimize.
[2024-05-29 17:13:38] [INFO ] Deduced a trap composed of 5 places in 387 ms of which 0 ms to minimize.
[2024-05-29 17:13:38] [INFO ] Deduced a trap composed of 5 places in 469 ms of which 0 ms to minimize.
[2024-05-29 17:13:39] [INFO ] Deduced a trap composed of 5 places in 533 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-05-29 17:13:39] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 0 ms to minimize.
[2024-05-29 17:13:40] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 0 ms to minimize.
[2024-05-29 17:13:40] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 0 ms to minimize.
[2024-05-29 17:13:40] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 0 ms to minimize.
[2024-05-29 17:13:40] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2024-05-29 17:13:40] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2024-05-29 17:13:40] [INFO ] Deduced a trap composed of 5 places in 383 ms of which 1 ms to minimize.
[2024-05-29 17:13:41] [INFO ] Deduced a trap composed of 6 places in 318 ms of which 0 ms to minimize.
[2024-05-29 17:13:41] [INFO ] Deduced a trap composed of 5 places in 314 ms of which 0 ms to minimize.
[2024-05-29 17:13:41] [INFO ] Deduced a trap composed of 5 places in 271 ms of which 1 ms to minimize.
[2024-05-29 17:13:42] [INFO ] Deduced a trap composed of 6 places in 319 ms of which 0 ms to minimize.
[2024-05-29 17:13:42] [INFO ] Deduced a trap composed of 5 places in 262 ms of which 0 ms to minimize.
[2024-05-29 17:13:42] [INFO ] Deduced a trap composed of 5 places in 272 ms of which 1 ms to minimize.
[2024-05-29 17:13:42] [INFO ] Deduced a trap composed of 6 places in 232 ms of which 0 ms to minimize.
[2024-05-29 17:13:42] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-05-29 17:13:55] [INFO ] Deduced a trap composed of 5 places in 384 ms of which 1 ms to minimize.
[2024-05-29 17:13:56] [INFO ] Deduced a trap composed of 5 places in 383 ms of which 0 ms to minimize.
[2024-05-29 17:13:56] [INFO ] Deduced a trap composed of 5 places in 334 ms of which 1 ms to minimize.
[2024-05-29 17:13:56] [INFO ] Deduced a trap composed of 5 places in 332 ms of which 1 ms to minimize.
SMT process timed out in 62714ms, After SMT, problems are : Problem set: 0 solved, 2115 unsolved
Search for dead transitions found 0 dead transitions in 62733ms
Finished structural reductions in LTL mode , in 1 iterations and 63408 ms. Remains : 45/45 places, 2126/2126 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 65 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 44 steps (0 resets) in 8 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 17:13:57] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-05-29 17:13:57] [INFO ] Invariant cache hit.
[2024-05-29 17:13:58] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 17:13:58] [INFO ] [Real]Absence check using state equation in 397 ms returned sat
[2024-05-29 17:13:59] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 17:13:59] [INFO ] [Real]Added 2069 Read/Feed constraints in 178 ms returned sat
[2024-05-29 17:13:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 17:14:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-29 17:14:00] [INFO ] [Nat]Absence check using state equation in 356 ms returned sat
[2024-05-29 17:14:00] [INFO ] [Nat]Added 2069 Read/Feed constraints in 223 ms returned sat
[2024-05-29 17:14:01] [INFO ] Computed and/alt/rep : 11/11/11 causal constraints (skipped 2092 transitions) in 234 ms.
[2024-05-29 17:14:01] [INFO ] Added : 0 causal constraints over 0 iterations in 409 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8333 reset in 4525 ms.
Product exploration explored 100000 steps with 8333 reset in 4555 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 2126/2126 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 11 place count 45 transition count 2115
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 45 transition count 2115
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 22 rules in 1479 ms. Remains 45 /45 variables (removed 0) and now considering 2115/2126 (removed 11) transitions.
[2024-05-29 17:14:12] [INFO ] Redundant transitions in 264 ms returned []
Running 2104 sub problems to find dead transitions.
[2024-05-29 17:14:12] [INFO ] Flow matrix only has 2103 transitions (discarded 12 similar events)
// Phase 1: matrix 2103 rows 45 cols
[2024-05-29 17:14:12] [INFO ] Computed 1 invariants in 5 ms
[2024-05-29 17:14:12] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (OVERLAPS) 11/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 17:14:52] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-29 17:14:52] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 17:14:52] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-05-29 17:14:52] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 17:14:53] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-29 17:14:53] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-29 17:14:53] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-05-29 17:14:53] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-05-29 17:14:53] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-29 17:14:53] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-29 17:14:54] [INFO ] Deduced a trap composed of 4 places in 612 ms of which 1 ms to minimize.
[2024-05-29 17:14:54] [INFO ] Deduced a trap composed of 4 places in 516 ms of which 1 ms to minimize.
[2024-05-29 17:14:55] [INFO ] Deduced a trap composed of 4 places in 446 ms of which 0 ms to minimize.
[2024-05-29 17:14:55] [INFO ] Deduced a trap composed of 4 places in 472 ms of which 0 ms to minimize.
[2024-05-29 17:14:56] [INFO ] Deduced a trap composed of 4 places in 518 ms of which 1 ms to minimize.
[2024-05-29 17:14:56] [INFO ] Deduced a trap composed of 4 places in 496 ms of which 0 ms to minimize.
[2024-05-29 17:14:57] [INFO ] Deduced a trap composed of 4 places in 454 ms of which 1 ms to minimize.
[2024-05-29 17:14:57] [INFO ] Deduced a trap composed of 4 places in 365 ms of which 0 ms to minimize.
[2024-05-29 17:14:57] [INFO ] Deduced a trap composed of 4 places in 372 ms of which 0 ms to minimize.
[2024-05-29 17:14:58] [INFO ] Deduced a trap composed of 4 places in 305 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 17:14:58] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2024-05-29 17:14:58] [INFO ] Deduced a trap composed of 4 places in 333 ms of which 1 ms to minimize.
[2024-05-29 17:14:59] [INFO ] Deduced a trap composed of 4 places in 286 ms of which 0 ms to minimize.
[2024-05-29 17:14:59] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 0 ms to minimize.
[2024-05-29 17:14:59] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2024-05-29 17:14:59] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 1 ms to minimize.
[2024-05-29 17:15:00] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 0 ms to minimize.
[2024-05-29 17:15:00] [INFO ] Deduced a trap composed of 4 places in 257 ms of which 0 ms to minimize.
[2024-05-29 17:15:00] [INFO ] Deduced a trap composed of 4 places in 324 ms of which 0 ms to minimize.
[2024-05-29 17:15:00] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 1 ms to minimize.
[2024-05-29 17:15:01] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 0 ms to minimize.
[2024-05-29 17:15:01] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 1 ms to minimize.
[2024-05-29 17:15:01] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 13/34 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 17:15:13] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2024-05-29 17:15:13] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 45/2148 variables, and 36 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/45 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2104/12 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (OVERLAPS) 11/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 35/36 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 17:15:20] [INFO ] Deduced a trap composed of 4 places in 521 ms of which 1 ms to minimize.
[2024-05-29 17:15:21] [INFO ] Deduced a trap composed of 4 places in 529 ms of which 1 ms to minimize.
[2024-05-29 17:15:21] [INFO ] Deduced a trap composed of 4 places in 406 ms of which 0 ms to minimize.
[2024-05-29 17:15:21] [INFO ] Deduced a trap composed of 4 places in 430 ms of which 1 ms to minimize.
[2024-05-29 17:15:22] [INFO ] Deduced a trap composed of 4 places in 388 ms of which 1 ms to minimize.
[2024-05-29 17:15:22] [INFO ] Deduced a trap composed of 4 places in 363 ms of which 0 ms to minimize.
[2024-05-29 17:15:22] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 0 ms to minimize.
[2024-05-29 17:15:23] [INFO ] Deduced a trap composed of 4 places in 279 ms of which 0 ms to minimize.
[2024-05-29 17:15:23] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 1 ms to minimize.
[2024-05-29 17:15:23] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 0 ms to minimize.
[2024-05-29 17:15:24] [INFO ] Deduced a trap composed of 4 places in 263 ms of which 0 ms to minimize.
[2024-05-29 17:15:24] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 0 ms to minimize.
[2024-05-29 17:15:24] [INFO ] Deduced a trap composed of 4 places in 352 ms of which 15 ms to minimize.
[2024-05-29 17:15:24] [INFO ] Deduced a trap composed of 4 places in 318 ms of which 0 ms to minimize.
[2024-05-29 17:15:25] [INFO ] Deduced a trap composed of 4 places in 257 ms of which 1 ms to minimize.
[2024-05-29 17:15:25] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 1 ms to minimize.
[2024-05-29 17:15:25] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 0 ms to minimize.
[2024-05-29 17:15:25] [INFO ] Deduced a trap composed of 4 places in 369 ms of which 1 ms to minimize.
[2024-05-29 17:15:26] [INFO ] Deduced a trap composed of 4 places in 377 ms of which 0 ms to minimize.
[2024-05-29 17:15:26] [INFO ] Deduced a trap composed of 4 places in 382 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 17:15:27] [INFO ] Deduced a trap composed of 4 places in 417 ms of which 0 ms to minimize.
[2024-05-29 17:15:28] [INFO ] Deduced a trap composed of 4 places in 363 ms of which 0 ms to minimize.
[2024-05-29 17:15:28] [INFO ] Deduced a trap composed of 4 places in 317 ms of which 1 ms to minimize.
[2024-05-29 17:15:28] [INFO ] Deduced a trap composed of 4 places in 303 ms of which 0 ms to minimize.
[2024-05-29 17:15:28] [INFO ] Deduced a trap composed of 4 places in 311 ms of which 1 ms to minimize.
[2024-05-29 17:15:29] [INFO ] Deduced a trap composed of 4 places in 265 ms of which 0 ms to minimize.
[2024-05-29 17:15:29] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 1 ms to minimize.
[2024-05-29 17:15:29] [INFO ] Deduced a trap composed of 4 places in 265 ms of which 1 ms to minimize.
[2024-05-29 17:15:29] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 0 ms to minimize.
[2024-05-29 17:15:30] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 1 ms to minimize.
[2024-05-29 17:15:30] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2024-05-29 17:15:30] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
[2024-05-29 17:15:30] [INFO ] Deduced a trap composed of 4 places in 316 ms of which 0 ms to minimize.
[2024-05-29 17:15:30] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 1 ms to minimize.
[2024-05-29 17:15:31] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 1 ms to minimize.
[2024-05-29 17:15:31] [INFO ] Deduced a trap composed of 4 places in 425 ms of which 0 ms to minimize.
[2024-05-29 17:15:31] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 0 ms to minimize.
[2024-05-29 17:15:32] [INFO ] Deduced a trap composed of 4 places in 266 ms of which 0 ms to minimize.
[2024-05-29 17:15:32] [INFO ] Deduced a trap composed of 4 places in 277 ms of which 1 ms to minimize.
[2024-05-29 17:15:32] [INFO ] Deduced a trap composed of 4 places in 266 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 17:15:33] [INFO ] Deduced a trap composed of 4 places in 439 ms of which 0 ms to minimize.
[2024-05-29 17:15:34] [INFO ] Deduced a trap composed of 4 places in 312 ms of which 1 ms to minimize.
[2024-05-29 17:15:34] [INFO ] Deduced a trap composed of 4 places in 379 ms of which 0 ms to minimize.
[2024-05-29 17:15:34] [INFO ] Deduced a trap composed of 4 places in 318 ms of which 0 ms to minimize.
[2024-05-29 17:15:35] [INFO ] Deduced a trap composed of 4 places in 335 ms of which 1 ms to minimize.
[2024-05-29 17:15:35] [INFO ] Deduced a trap composed of 4 places in 305 ms of which 0 ms to minimize.
[2024-05-29 17:15:35] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 0 ms to minimize.
[2024-05-29 17:15:35] [INFO ] Deduced a trap composed of 4 places in 271 ms of which 0 ms to minimize.
[2024-05-29 17:15:36] [INFO ] Deduced a trap composed of 4 places in 264 ms of which 0 ms to minimize.
[2024-05-29 17:15:36] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 0 ms to minimize.
[2024-05-29 17:15:36] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 0 ms to minimize.
[2024-05-29 17:15:36] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 0 ms to minimize.
[2024-05-29 17:15:37] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 0 ms to minimize.
[2024-05-29 17:15:37] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 0 ms to minimize.
[2024-05-29 17:15:37] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 0 ms to minimize.
[2024-05-29 17:15:37] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 0 ms to minimize.
[2024-05-29 17:15:37] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 0 ms to minimize.
[2024-05-29 17:15:37] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 0 ms to minimize.
[2024-05-29 17:15:38] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 0 ms to minimize.
[2024-05-29 17:15:38] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 17:15:39] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 0 ms to minimize.
[2024-05-29 17:15:39] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 0 ms to minimize.
[2024-05-29 17:15:39] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 1 ms to minimize.
[2024-05-29 17:15:40] [INFO ] Deduced a trap composed of 4 places in 309 ms of which 0 ms to minimize.
[2024-05-29 17:15:40] [INFO ] Deduced a trap composed of 4 places in 292 ms of which 0 ms to minimize.
[2024-05-29 17:15:40] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 0 ms to minimize.
[2024-05-29 17:15:41] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 0 ms to minimize.
[2024-05-29 17:15:41] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 1 ms to minimize.
[2024-05-29 17:15:41] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 1 ms to minimize.
[2024-05-29 17:15:41] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 45/2148 variables, and 106 constraints, problems are : Problem set: 11 solved, 2093 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/45 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2092/12 constraints, Known Traps: 105/105 constraints]
After SMT, in 92773ms problems are : Problem set: 11 solved, 2093 unsolved
Search for dead transitions found 11 dead transitions in 92792ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 45/45 places, 2104/2126 transitions.
Graph (complete) has 408 edges and 45 vertex of which 34 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.5 ms
Discarding 11 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 684 ms. Remains 34 /45 variables (removed 11) and now considering 2104/2104 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/45 places, 2104/2126 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 95235 ms. Remains : 34/45 places, 2104/2126 transitions.
Support contains 11 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 2126/2126 transitions.
Applied a total of 0 rules in 5 ms. Remains 45 /45 variables (removed 0) and now considering 2126/2126 (removed 0) transitions.
[2024-05-29 17:15:46] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
// Phase 1: matrix 2114 rows 45 cols
[2024-05-29 17:15:46] [INFO ] Computed 1 invariants in 14 ms
[2024-05-29 17:15:46] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-29 17:15:46] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-05-29 17:15:46] [INFO ] Invariant cache hit.
[2024-05-29 17:15:46] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 17:15:46] [INFO ] Implicit Places using invariants and state equation in 656 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
Running 2115 sub problems to find dead transitions.
[2024-05-29 17:15:46] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-05-29 17:15:46] [INFO ] Invariant cache hit.
[2024-05-29 17:15:46] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
At refinement iteration 1 (OVERLAPS) 11/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-05-29 17:16:26] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2024-05-29 17:16:26] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
[2024-05-29 17:16:26] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 0 ms to minimize.
[2024-05-29 17:16:26] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
[2024-05-29 17:16:27] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 0 ms to minimize.
[2024-05-29 17:16:27] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2024-05-29 17:16:27] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 0 ms to minimize.
[2024-05-29 17:16:27] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 0 ms to minimize.
[2024-05-29 17:16:27] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 0 ms to minimize.
[2024-05-29 17:16:27] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 1 ms to minimize.
[2024-05-29 17:16:28] [INFO ] Deduced a trap composed of 5 places in 545 ms of which 1 ms to minimize.
[2024-05-29 17:16:29] [INFO ] Deduced a trap composed of 5 places in 487 ms of which 1 ms to minimize.
[2024-05-29 17:16:29] [INFO ] Deduced a trap composed of 6 places in 416 ms of which 0 ms to minimize.
[2024-05-29 17:16:29] [INFO ] Deduced a trap composed of 5 places in 403 ms of which 1 ms to minimize.
[2024-05-29 17:16:30] [INFO ] Deduced a trap composed of 5 places in 409 ms of which 0 ms to minimize.
[2024-05-29 17:16:30] [INFO ] Deduced a trap composed of 5 places in 430 ms of which 0 ms to minimize.
[2024-05-29 17:16:31] [INFO ] Deduced a trap composed of 5 places in 404 ms of which 0 ms to minimize.
[2024-05-29 17:16:31] [INFO ] Deduced a trap composed of 5 places in 364 ms of which 1 ms to minimize.
[2024-05-29 17:16:31] [INFO ] Deduced a trap composed of 5 places in 476 ms of which 1 ms to minimize.
[2024-05-29 17:16:32] [INFO ] Deduced a trap composed of 5 places in 513 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-05-29 17:16:32] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 0 ms to minimize.
[2024-05-29 17:16:33] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 0 ms to minimize.
[2024-05-29 17:16:33] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 1 ms to minimize.
[2024-05-29 17:16:33] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 0 ms to minimize.
[2024-05-29 17:16:33] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 0 ms to minimize.
[2024-05-29 17:16:33] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 0 ms to minimize.
[2024-05-29 17:16:33] [INFO ] Deduced a trap composed of 5 places in 380 ms of which 1 ms to minimize.
[2024-05-29 17:16:34] [INFO ] Deduced a trap composed of 6 places in 337 ms of which 1 ms to minimize.
[2024-05-29 17:16:34] [INFO ] Deduced a trap composed of 5 places in 310 ms of which 0 ms to minimize.
[2024-05-29 17:16:34] [INFO ] Deduced a trap composed of 5 places in 268 ms of which 1 ms to minimize.
[2024-05-29 17:16:35] [INFO ] Deduced a trap composed of 6 places in 336 ms of which 1 ms to minimize.
[2024-05-29 17:16:35] [INFO ] Deduced a trap composed of 5 places in 266 ms of which 0 ms to minimize.
[2024-05-29 17:16:35] [INFO ] Deduced a trap composed of 5 places in 302 ms of which 1 ms to minimize.
[2024-05-29 17:16:35] [INFO ] Deduced a trap composed of 6 places in 210 ms of which 0 ms to minimize.
[2024-05-29 17:16:36] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-05-29 17:16:48] [INFO ] Deduced a trap composed of 5 places in 389 ms of which 1 ms to minimize.
[2024-05-29 17:16:49] [INFO ] Deduced a trap composed of 5 places in 371 ms of which 0 ms to minimize.
[2024-05-29 17:16:49] [INFO ] Deduced a trap composed of 5 places in 340 ms of which 1 ms to minimize.
SMT process timed out in 62626ms, After SMT, problems are : Problem set: 0 solved, 2115 unsolved
Search for dead transitions found 0 dead transitions in 62648ms
Finished structural reductions in LTL mode , in 1 iterations and 63378 ms. Remains : 45/45 places, 2126/2126 transitions.
Treatment of property StigmergyCommit-PT-10a-LTLFireability-07 finished in 314672 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))))'
Found a Shortening insensitive property : StigmergyCommit-PT-10a-LTLFireability-14
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 135 transition count 4251
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 101 transition count 4251
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 68 place count 101 transition count 4240
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 90 place count 90 transition count 4240
Performed 34 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 158 place count 56 transition count 4194
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 2 with 2047 rules applied. Total rules applied 2205 place count 56 transition count 2147
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 2225 place count 46 transition count 2137
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 2235 place count 46 transition count 2127
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2236 place count 45 transition count 2126
Applied a total of 2236 rules in 287 ms. Remains 45 /136 variables (removed 91) and now considering 2126/4286 (removed 2160) transitions.
[2024-05-29 17:16:50] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-05-29 17:16:50] [INFO ] Invariant cache hit.
[2024-05-29 17:16:50] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-29 17:16:50] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-05-29 17:16:50] [INFO ] Invariant cache hit.
[2024-05-29 17:16:50] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 17:16:50] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
Running 2115 sub problems to find dead transitions.
[2024-05-29 17:16:51] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-05-29 17:16:51] [INFO ] Invariant cache hit.
[2024-05-29 17:16:51] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
At refinement iteration 1 (OVERLAPS) 11/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-05-29 17:17:31] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2024-05-29 17:17:31] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2024-05-29 17:17:31] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
[2024-05-29 17:17:31] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 0 ms to minimize.
[2024-05-29 17:17:31] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 1 ms to minimize.
[2024-05-29 17:17:32] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 0 ms to minimize.
[2024-05-29 17:17:32] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 1 ms to minimize.
[2024-05-29 17:17:32] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 0 ms to minimize.
[2024-05-29 17:17:32] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 0 ms to minimize.
[2024-05-29 17:17:32] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 0 ms to minimize.
[2024-05-29 17:17:33] [INFO ] Deduced a trap composed of 5 places in 546 ms of which 0 ms to minimize.
[2024-05-29 17:17:33] [INFO ] Deduced a trap composed of 5 places in 489 ms of which 1 ms to minimize.
[2024-05-29 17:17:34] [INFO ] Deduced a trap composed of 6 places in 432 ms of which 0 ms to minimize.
[2024-05-29 17:17:34] [INFO ] Deduced a trap composed of 5 places in 417 ms of which 0 ms to minimize.
[2024-05-29 17:17:34] [INFO ] Deduced a trap composed of 5 places in 421 ms of which 0 ms to minimize.
[2024-05-29 17:17:35] [INFO ] Deduced a trap composed of 5 places in 412 ms of which 1 ms to minimize.
[2024-05-29 17:17:35] [INFO ] Deduced a trap composed of 5 places in 420 ms of which 1 ms to minimize.
[2024-05-29 17:17:36] [INFO ] Deduced a trap composed of 5 places in 382 ms of which 0 ms to minimize.
[2024-05-29 17:17:36] [INFO ] Deduced a trap composed of 5 places in 507 ms of which 0 ms to minimize.
[2024-05-29 17:17:37] [INFO ] Deduced a trap composed of 5 places in 476 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-05-29 17:17:37] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 0 ms to minimize.
[2024-05-29 17:17:37] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
[2024-05-29 17:17:37] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 0 ms to minimize.
[2024-05-29 17:17:37] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 0 ms to minimize.
[2024-05-29 17:17:37] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 0 ms to minimize.
[2024-05-29 17:17:37] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 0 ms to minimize.
[2024-05-29 17:17:38] [INFO ] Deduced a trap composed of 5 places in 374 ms of which 1 ms to minimize.
[2024-05-29 17:17:38] [INFO ] Deduced a trap composed of 6 places in 323 ms of which 2 ms to minimize.
[2024-05-29 17:17:39] [INFO ] Deduced a trap composed of 5 places in 320 ms of which 0 ms to minimize.
[2024-05-29 17:17:39] [INFO ] Deduced a trap composed of 5 places in 267 ms of which 0 ms to minimize.
[2024-05-29 17:17:39] [INFO ] Deduced a trap composed of 6 places in 347 ms of which 1 ms to minimize.
[2024-05-29 17:17:39] [INFO ] Deduced a trap composed of 5 places in 273 ms of which 1 ms to minimize.
[2024-05-29 17:17:40] [INFO ] Deduced a trap composed of 5 places in 272 ms of which 0 ms to minimize.
[2024-05-29 17:17:40] [INFO ] Deduced a trap composed of 6 places in 215 ms of which 1 ms to minimize.
[2024-05-29 17:17:40] [INFO ] Deduced a trap composed of 5 places in 167 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-05-29 17:17:53] [INFO ] Deduced a trap composed of 5 places in 375 ms of which 1 ms to minimize.
[2024-05-29 17:17:53] [INFO ] Deduced a trap composed of 5 places in 393 ms of which 1 ms to minimize.
[2024-05-29 17:17:54] [INFO ] Deduced a trap composed of 5 places in 313 ms of which 1 ms to minimize.
SMT process timed out in 63219ms, After SMT, problems are : Problem set: 0 solved, 2115 unsolved
Search for dead transitions found 0 dead transitions in 63239ms
Starting structural reductions in LI_LTL mode, iteration 1 : 45/136 places, 2126/4286 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 64200 ms. Remains : 45/136 places, 2126/4286 transitions.
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-14
Product exploration explored 100000 steps with 8333 reset in 4634 ms.
Product exploration explored 100000 steps with 8333 reset in 4591 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 : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 44 steps (0 resets) in 6 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 17:18:04] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-05-29 17:18:04] [INFO ] Invariant cache hit.
[2024-05-29 17:18:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 17:18:05] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2024-05-29 17:18:05] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 17:18:05] [INFO ] [Real]Added 2069 Read/Feed constraints in 180 ms returned sat
[2024-05-29 17:18:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 17:18:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 17:18:07] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2024-05-29 17:18:07] [INFO ] [Nat]Added 2069 Read/Feed constraints in 228 ms returned sat
[2024-05-29 17:18:07] [INFO ] Computed and/alt/rep : 11/11/11 causal constraints (skipped 2092 transitions) in 236 ms.
[2024-05-29 17:18:08] [INFO ] Added : 0 causal constraints over 0 iterations in 418 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 11 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 2126/2126 transitions.
Applied a total of 0 rules in 6 ms. Remains 45 /45 variables (removed 0) and now considering 2126/2126 (removed 0) transitions.
[2024-05-29 17:18:08] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-05-29 17:18:08] [INFO ] Invariant cache hit.
[2024-05-29 17:18:08] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-29 17:18:08] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-05-29 17:18:08] [INFO ] Invariant cache hit.
[2024-05-29 17:18:08] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 17:18:08] [INFO ] Implicit Places using invariants and state equation in 636 ms returned []
Implicit Place search using SMT with State Equation took 680 ms to find 0 implicit places.
Running 2115 sub problems to find dead transitions.
[2024-05-29 17:18:08] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-05-29 17:18:08] [INFO ] Invariant cache hit.
[2024-05-29 17:18:08] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
At refinement iteration 1 (OVERLAPS) 11/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-05-29 17:18:48] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
[2024-05-29 17:18:49] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 0 ms to minimize.
[2024-05-29 17:18:49] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 0 ms to minimize.
[2024-05-29 17:18:49] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 0 ms to minimize.
[2024-05-29 17:18:49] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 1 ms to minimize.
[2024-05-29 17:18:49] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 0 ms to minimize.
[2024-05-29 17:18:49] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 0 ms to minimize.
[2024-05-29 17:18:49] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 1 ms to minimize.
[2024-05-29 17:18:49] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 0 ms to minimize.
[2024-05-29 17:18:49] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 0 ms to minimize.
[2024-05-29 17:18:50] [INFO ] Deduced a trap composed of 5 places in 572 ms of which 0 ms to minimize.
[2024-05-29 17:18:51] [INFO ] Deduced a trap composed of 5 places in 482 ms of which 1 ms to minimize.
[2024-05-29 17:18:51] [INFO ] Deduced a trap composed of 6 places in 424 ms of which 1 ms to minimize.
[2024-05-29 17:18:51] [INFO ] Deduced a trap composed of 5 places in 430 ms of which 0 ms to minimize.
[2024-05-29 17:18:52] [INFO ] Deduced a trap composed of 5 places in 415 ms of which 1 ms to minimize.
[2024-05-29 17:18:52] [INFO ] Deduced a trap composed of 5 places in 406 ms of which 1 ms to minimize.
[2024-05-29 17:18:53] [INFO ] Deduced a trap composed of 5 places in 401 ms of which 0 ms to minimize.
[2024-05-29 17:18:53] [INFO ] Deduced a trap composed of 5 places in 368 ms of which 0 ms to minimize.
[2024-05-29 17:18:54] [INFO ] Deduced a trap composed of 5 places in 493 ms of which 1 ms to minimize.
[2024-05-29 17:18:54] [INFO ] Deduced a trap composed of 5 places in 474 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-05-29 17:18:54] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 0 ms to minimize.
[2024-05-29 17:18:55] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
[2024-05-29 17:18:55] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 0 ms to minimize.
[2024-05-29 17:18:55] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2024-05-29 17:18:55] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 0 ms to minimize.
[2024-05-29 17:18:55] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2024-05-29 17:18:55] [INFO ] Deduced a trap composed of 5 places in 403 ms of which 0 ms to minimize.
[2024-05-29 17:18:56] [INFO ] Deduced a trap composed of 6 places in 321 ms of which 1 ms to minimize.
[2024-05-29 17:18:56] [INFO ] Deduced a trap composed of 5 places in 304 ms of which 1 ms to minimize.
[2024-05-29 17:18:56] [INFO ] Deduced a trap composed of 5 places in 264 ms of which 0 ms to minimize.
[2024-05-29 17:18:57] [INFO ] Deduced a trap composed of 6 places in 302 ms of which 1 ms to minimize.
[2024-05-29 17:18:57] [INFO ] Deduced a trap composed of 5 places in 269 ms of which 0 ms to minimize.
[2024-05-29 17:18:57] [INFO ] Deduced a trap composed of 5 places in 268 ms of which 0 ms to minimize.
[2024-05-29 17:18:57] [INFO ] Deduced a trap composed of 6 places in 218 ms of which 1 ms to minimize.
[2024-05-29 17:18:57] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-05-29 17:19:10] [INFO ] Deduced a trap composed of 5 places in 372 ms of which 1 ms to minimize.
[2024-05-29 17:19:10] [INFO ] Deduced a trap composed of 5 places in 367 ms of which 1 ms to minimize.
[2024-05-29 17:19:11] [INFO ] Deduced a trap composed of 5 places in 319 ms of which 1 ms to minimize.
[2024-05-29 17:19:11] [INFO ] Deduced a trap composed of 5 places in 321 ms of which 0 ms to minimize.
[2024-05-29 17:19:11] [INFO ] Deduced a trap composed of 6 places in 339 ms of which 1 ms to minimize.
SMT process timed out in 62874ms, After SMT, problems are : Problem set: 0 solved, 2115 unsolved
Search for dead transitions found 0 dead transitions in 62894ms
Finished structural reductions in LTL mode , in 1 iterations and 63586 ms. Remains : 45/45 places, 2126/2126 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 44 steps (0 resets) in 7 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 17:19:12] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-05-29 17:19:12] [INFO ] Invariant cache hit.
[2024-05-29 17:19:13] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 17:19:13] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2024-05-29 17:19:13] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 17:19:14] [INFO ] [Real]Added 2069 Read/Feed constraints in 183 ms returned sat
[2024-05-29 17:19:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 17:19:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 17:19:15] [INFO ] [Nat]Absence check using state equation in 350 ms returned sat
[2024-05-29 17:19:15] [INFO ] [Nat]Added 2069 Read/Feed constraints in 219 ms returned sat
[2024-05-29 17:19:16] [INFO ] Computed and/alt/rep : 11/11/11 causal constraints (skipped 2092 transitions) in 235 ms.
[2024-05-29 17:19:16] [INFO ] Added : 0 causal constraints over 0 iterations in 409 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8333 reset in 4559 ms.
Product exploration explored 100000 steps with 8333 reset in 4552 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 2126/2126 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 11 place count 45 transition count 2115
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 45 transition count 2115
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 22 rules in 1484 ms. Remains 45 /45 variables (removed 0) and now considering 2115/2126 (removed 11) transitions.
[2024-05-29 17:19:27] [INFO ] Redundant transitions in 280 ms returned []
Running 2104 sub problems to find dead transitions.
[2024-05-29 17:19:27] [INFO ] Flow matrix only has 2103 transitions (discarded 12 similar events)
// Phase 1: matrix 2103 rows 45 cols
[2024-05-29 17:19:27] [INFO ] Computed 1 invariants in 9 ms
[2024-05-29 17:19:27] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (OVERLAPS) 11/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 17:20:07] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-29 17:20:07] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-05-29 17:20:07] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2024-05-29 17:20:07] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2024-05-29 17:20:07] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-05-29 17:20:07] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-29 17:20:08] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-05-29 17:20:08] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-05-29 17:20:08] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-29 17:20:08] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-29 17:20:08] [INFO ] Deduced a trap composed of 4 places in 592 ms of which 1 ms to minimize.
[2024-05-29 17:20:09] [INFO ] Deduced a trap composed of 4 places in 514 ms of which 0 ms to minimize.
[2024-05-29 17:20:09] [INFO ] Deduced a trap composed of 4 places in 446 ms of which 0 ms to minimize.
[2024-05-29 17:20:10] [INFO ] Deduced a trap composed of 4 places in 461 ms of which 0 ms to minimize.
[2024-05-29 17:20:10] [INFO ] Deduced a trap composed of 4 places in 495 ms of which 1 ms to minimize.
[2024-05-29 17:20:11] [INFO ] Deduced a trap composed of 4 places in 507 ms of which 1 ms to minimize.
[2024-05-29 17:20:11] [INFO ] Deduced a trap composed of 4 places in 444 ms of which 1 ms to minimize.
[2024-05-29 17:20:12] [INFO ] Deduced a trap composed of 4 places in 383 ms of which 0 ms to minimize.
[2024-05-29 17:20:12] [INFO ] Deduced a trap composed of 4 places in 389 ms of which 1 ms to minimize.
[2024-05-29 17:20:12] [INFO ] Deduced a trap composed of 4 places in 334 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 17:20:13] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2024-05-29 17:20:13] [INFO ] Deduced a trap composed of 4 places in 324 ms of which 0 ms to minimize.
[2024-05-29 17:20:14] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 0 ms to minimize.
[2024-05-29 17:20:14] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 0 ms to minimize.
[2024-05-29 17:20:14] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 1 ms to minimize.
[2024-05-29 17:20:14] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 0 ms to minimize.
[2024-05-29 17:20:14] [INFO ] Deduced a trap composed of 4 places in 255 ms of which 0 ms to minimize.
[2024-05-29 17:20:15] [INFO ] Deduced a trap composed of 4 places in 266 ms of which 1 ms to minimize.
[2024-05-29 17:20:15] [INFO ] Deduced a trap composed of 4 places in 306 ms of which 0 ms to minimize.
[2024-05-29 17:20:15] [INFO ] Deduced a trap composed of 4 places in 260 ms of which 1 ms to minimize.
[2024-05-29 17:20:15] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 0 ms to minimize.
[2024-05-29 17:20:16] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 0 ms to minimize.
[2024-05-29 17:20:16] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 13/34 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 17:20:28] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 1 ms to minimize.
[2024-05-29 17:20:28] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 45/2148 variables, and 36 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/45 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2104/12 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (OVERLAPS) 11/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 35/36 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 17:20:35] [INFO ] Deduced a trap composed of 4 places in 491 ms of which 1 ms to minimize.
[2024-05-29 17:20:35] [INFO ] Deduced a trap composed of 4 places in 507 ms of which 0 ms to minimize.
[2024-05-29 17:20:36] [INFO ] Deduced a trap composed of 4 places in 432 ms of which 1 ms to minimize.
[2024-05-29 17:20:36] [INFO ] Deduced a trap composed of 4 places in 421 ms of which 1 ms to minimize.
[2024-05-29 17:20:36] [INFO ] Deduced a trap composed of 4 places in 379 ms of which 0 ms to minimize.
[2024-05-29 17:20:37] [INFO ] Deduced a trap composed of 4 places in 368 ms of which 0 ms to minimize.
[2024-05-29 17:20:37] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 1 ms to minimize.
[2024-05-29 17:20:37] [INFO ] Deduced a trap composed of 4 places in 275 ms of which 0 ms to minimize.
[2024-05-29 17:20:38] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 1 ms to minimize.
[2024-05-29 17:20:38] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 0 ms to minimize.
[2024-05-29 17:20:38] [INFO ] Deduced a trap composed of 4 places in 270 ms of which 1 ms to minimize.
[2024-05-29 17:20:38] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 1 ms to minimize.
[2024-05-29 17:20:39] [INFO ] Deduced a trap composed of 4 places in 318 ms of which 1 ms to minimize.
[2024-05-29 17:20:39] [INFO ] Deduced a trap composed of 4 places in 303 ms of which 0 ms to minimize.
[2024-05-29 17:20:39] [INFO ] Deduced a trap composed of 4 places in 274 ms of which 0 ms to minimize.
[2024-05-29 17:20:40] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 1 ms to minimize.
[2024-05-29 17:20:40] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 1 ms to minimize.
[2024-05-29 17:20:40] [INFO ] Deduced a trap composed of 4 places in 386 ms of which 1 ms to minimize.
[2024-05-29 17:20:40] [INFO ] Deduced a trap composed of 4 places in 371 ms of which 1 ms to minimize.
[2024-05-29 17:20:41] [INFO ] Deduced a trap composed of 4 places in 362 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 17:20:42] [INFO ] Deduced a trap composed of 4 places in 426 ms of which 0 ms to minimize.
[2024-05-29 17:20:42] [INFO ] Deduced a trap composed of 4 places in 357 ms of which 1 ms to minimize.
[2024-05-29 17:20:42] [INFO ] Deduced a trap composed of 4 places in 301 ms of which 1 ms to minimize.
[2024-05-29 17:20:43] [INFO ] Deduced a trap composed of 4 places in 297 ms of which 0 ms to minimize.
[2024-05-29 17:20:43] [INFO ] Deduced a trap composed of 4 places in 303 ms of which 1 ms to minimize.
[2024-05-29 17:20:43] [INFO ] Deduced a trap composed of 4 places in 253 ms of which 0 ms to minimize.
[2024-05-29 17:20:44] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 0 ms to minimize.
[2024-05-29 17:20:44] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 0 ms to minimize.
[2024-05-29 17:20:44] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 0 ms to minimize.
[2024-05-29 17:20:44] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 0 ms to minimize.
[2024-05-29 17:20:44] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 1 ms to minimize.
[2024-05-29 17:20:44] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 0 ms to minimize.
[2024-05-29 17:20:45] [INFO ] Deduced a trap composed of 4 places in 267 ms of which 0 ms to minimize.
[2024-05-29 17:20:45] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 1 ms to minimize.
[2024-05-29 17:20:45] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 1 ms to minimize.
[2024-05-29 17:20:46] [INFO ] Deduced a trap composed of 4 places in 426 ms of which 0 ms to minimize.
[2024-05-29 17:20:46] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 1 ms to minimize.
[2024-05-29 17:20:46] [INFO ] Deduced a trap composed of 4 places in 264 ms of which 1 ms to minimize.
[2024-05-29 17:20:46] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 1 ms to minimize.
[2024-05-29 17:20:47] [INFO ] Deduced a trap composed of 4 places in 263 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 17:20:48] [INFO ] Deduced a trap composed of 4 places in 411 ms of which 0 ms to minimize.
[2024-05-29 17:20:48] [INFO ] Deduced a trap composed of 4 places in 308 ms of which 1 ms to minimize.
[2024-05-29 17:20:48] [INFO ] Deduced a trap composed of 4 places in 348 ms of which 0 ms to minimize.
[2024-05-29 17:20:49] [INFO ] Deduced a trap composed of 4 places in 320 ms of which 0 ms to minimize.
[2024-05-29 17:20:49] [INFO ] Deduced a trap composed of 4 places in 310 ms of which 0 ms to minimize.
[2024-05-29 17:20:49] [INFO ] Deduced a trap composed of 4 places in 317 ms of which 1 ms to minimize.
[2024-05-29 17:20:50] [INFO ] Deduced a trap composed of 4 places in 255 ms of which 1 ms to minimize.
[2024-05-29 17:20:50] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 0 ms to minimize.
[2024-05-29 17:20:50] [INFO ] Deduced a trap composed of 4 places in 260 ms of which 0 ms to minimize.
[2024-05-29 17:20:50] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 0 ms to minimize.
[2024-05-29 17:20:51] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 0 ms to minimize.
[2024-05-29 17:20:51] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 0 ms to minimize.
[2024-05-29 17:20:51] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 0 ms to minimize.
[2024-05-29 17:20:51] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 1 ms to minimize.
[2024-05-29 17:20:51] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 0 ms to minimize.
[2024-05-29 17:20:52] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 1 ms to minimize.
[2024-05-29 17:20:52] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 1 ms to minimize.
[2024-05-29 17:20:52] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 0 ms to minimize.
[2024-05-29 17:20:52] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 0 ms to minimize.
[2024-05-29 17:20:52] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 17:20:54] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 0 ms to minimize.
[2024-05-29 17:20:54] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 0 ms to minimize.
[2024-05-29 17:20:54] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2024-05-29 17:20:54] [INFO ] Deduced a trap composed of 4 places in 298 ms of which 0 ms to minimize.
[2024-05-29 17:20:55] [INFO ] Deduced a trap composed of 4 places in 266 ms of which 0 ms to minimize.
[2024-05-29 17:20:55] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 0 ms to minimize.
[2024-05-29 17:20:55] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 1 ms to minimize.
[2024-05-29 17:20:55] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 1 ms to minimize.
[2024-05-29 17:20:55] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 1 ms to minimize.
[2024-05-29 17:20:55] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 0 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 45/2148 variables, and 106 constraints, problems are : Problem set: 11 solved, 2093 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/45 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2092/12 constraints, Known Traps: 105/105 constraints]
After SMT, in 92777ms problems are : Problem set: 11 solved, 2093 unsolved
Search for dead transitions found 11 dead transitions in 92797ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 45/45 places, 2104/2126 transitions.
Graph (complete) has 408 edges and 45 vertex of which 34 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.5 ms
Discarding 11 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 707 ms. Remains 34 /45 variables (removed 11) and now considering 2104/2104 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/45 places, 2104/2126 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 95282 ms. Remains : 34/45 places, 2104/2126 transitions.
Support contains 11 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 2126/2126 transitions.
Applied a total of 0 rules in 6 ms. Remains 45 /45 variables (removed 0) and now considering 2126/2126 (removed 0) transitions.
[2024-05-29 17:21:01] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
// Phase 1: matrix 2114 rows 45 cols
[2024-05-29 17:21:01] [INFO ] Computed 1 invariants in 11 ms
[2024-05-29 17:21:01] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-29 17:21:01] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-05-29 17:21:01] [INFO ] Invariant cache hit.
[2024-05-29 17:21:01] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 17:21:01] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
Running 2115 sub problems to find dead transitions.
[2024-05-29 17:21:01] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-05-29 17:21:01] [INFO ] Invariant cache hit.
[2024-05-29 17:21:01] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
At refinement iteration 1 (OVERLAPS) 11/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-05-29 17:21:41] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 0 ms to minimize.
[2024-05-29 17:21:41] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 0 ms to minimize.
[2024-05-29 17:21:41] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 0 ms to minimize.
[2024-05-29 17:21:41] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 0 ms to minimize.
[2024-05-29 17:21:42] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 1 ms to minimize.
[2024-05-29 17:21:42] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 0 ms to minimize.
[2024-05-29 17:21:42] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 0 ms to minimize.
[2024-05-29 17:21:42] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 0 ms to minimize.
[2024-05-29 17:21:42] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 0 ms to minimize.
[2024-05-29 17:21:42] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 0 ms to minimize.
[2024-05-29 17:21:43] [INFO ] Deduced a trap composed of 5 places in 558 ms of which 1 ms to minimize.
[2024-05-29 17:21:43] [INFO ] Deduced a trap composed of 5 places in 473 ms of which 0 ms to minimize.
[2024-05-29 17:21:44] [INFO ] Deduced a trap composed of 6 places in 418 ms of which 1 ms to minimize.
[2024-05-29 17:21:44] [INFO ] Deduced a trap composed of 5 places in 415 ms of which 0 ms to minimize.
[2024-05-29 17:21:45] [INFO ] Deduced a trap composed of 5 places in 428 ms of which 1 ms to minimize.
[2024-05-29 17:21:45] [INFO ] Deduced a trap composed of 5 places in 429 ms of which 0 ms to minimize.
[2024-05-29 17:21:45] [INFO ] Deduced a trap composed of 5 places in 446 ms of which 0 ms to minimize.
[2024-05-29 17:21:46] [INFO ] Deduced a trap composed of 5 places in 365 ms of which 1 ms to minimize.
[2024-05-29 17:21:46] [INFO ] Deduced a trap composed of 5 places in 495 ms of which 1 ms to minimize.
[2024-05-29 17:21:47] [INFO ] Deduced a trap composed of 5 places in 533 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-05-29 17:21:47] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 0 ms to minimize.
[2024-05-29 17:21:47] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 0 ms to minimize.
[2024-05-29 17:21:47] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 0 ms to minimize.
[2024-05-29 17:21:48] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 0 ms to minimize.
[2024-05-29 17:21:48] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 0 ms to minimize.
[2024-05-29 17:21:48] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 0 ms to minimize.
[2024-05-29 17:21:48] [INFO ] Deduced a trap composed of 5 places in 373 ms of which 1 ms to minimize.
[2024-05-29 17:21:49] [INFO ] Deduced a trap composed of 6 places in 335 ms of which 1 ms to minimize.
[2024-05-29 17:21:49] [INFO ] Deduced a trap composed of 5 places in 315 ms of which 1 ms to minimize.
[2024-05-29 17:21:49] [INFO ] Deduced a trap composed of 5 places in 273 ms of which 1 ms to minimize.
[2024-05-29 17:21:49] [INFO ] Deduced a trap composed of 6 places in 331 ms of which 1 ms to minimize.
[2024-05-29 17:21:50] [INFO ] Deduced a trap composed of 5 places in 261 ms of which 1 ms to minimize.
[2024-05-29 17:21:50] [INFO ] Deduced a trap composed of 5 places in 262 ms of which 0 ms to minimize.
[2024-05-29 17:21:50] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 0 ms to minimize.
[2024-05-29 17:21:50] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-05-29 17:22:03] [INFO ] Deduced a trap composed of 5 places in 412 ms of which 1 ms to minimize.
[2024-05-29 17:22:03] [INFO ] Deduced a trap composed of 5 places in 399 ms of which 1 ms to minimize.
[2024-05-29 17:22:04] [INFO ] Deduced a trap composed of 5 places in 343 ms of which 0 ms to minimize.
[2024-05-29 17:22:04] [INFO ] Deduced a trap composed of 5 places in 333 ms of which 0 ms to minimize.
SMT process timed out in 62851ms, After SMT, problems are : Problem set: 0 solved, 2115 unsolved
Search for dead transitions found 0 dead transitions in 62872ms
Finished structural reductions in LTL mode , in 1 iterations and 63543 ms. Remains : 45/45 places, 2126/2126 transitions.
Treatment of property StigmergyCommit-PT-10a-LTLFireability-14 finished in 315089 ms.
[2024-05-29 17:22:05] [INFO ] Flatten gal took : 332 ms
[2024-05-29 17:22:05] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-29 17:22:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 136 places, 4286 transitions and 90702 arcs took 71 ms.
Total runtime 2783290 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running StigmergyCommit-PT-10a
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 136
TRANSITIONS: 4286
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.386s, Sys 0.019s]
SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.031s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 4650
MODEL NAME: /home/mcc/execution/414/model
136 places, 4286 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA StigmergyCommit-PT-10a-LTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-10a-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-10a-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1717003577552
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyCommit-PT-10a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is StigmergyCommit-PT-10a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r399-tall-171690529900220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-10a.tgz
mv StigmergyCommit-PT-10a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;