About the Execution of GreatSPN+red for StigmergyElection-PT-08b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14269.340 | 3559980.00 | 4915062.00 | 7933.60 | FFFTT??FFFFF?FFT | 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-171690530200355.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 StigmergyElection-PT-08b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690530200355
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 11 18:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 18:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 11 18:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 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 12M 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 StigmergyElection-PT-08b-LTLCardinality-00
FORMULA_NAME StigmergyElection-PT-08b-LTLCardinality-01
FORMULA_NAME StigmergyElection-PT-08b-LTLCardinality-02
FORMULA_NAME StigmergyElection-PT-08b-LTLCardinality-03
FORMULA_NAME StigmergyElection-PT-08b-LTLCardinality-04
FORMULA_NAME StigmergyElection-PT-08b-LTLCardinality-05
FORMULA_NAME StigmergyElection-PT-08b-LTLCardinality-06
FORMULA_NAME StigmergyElection-PT-08b-LTLCardinality-07
FORMULA_NAME StigmergyElection-PT-08b-LTLCardinality-08
FORMULA_NAME StigmergyElection-PT-08b-LTLCardinality-09
FORMULA_NAME StigmergyElection-PT-08b-LTLCardinality-10
FORMULA_NAME StigmergyElection-PT-08b-LTLCardinality-11
FORMULA_NAME StigmergyElection-PT-08b-LTLCardinality-12
FORMULA_NAME StigmergyElection-PT-08b-LTLCardinality-13
FORMULA_NAME StigmergyElection-PT-08b-LTLCardinality-14
FORMULA_NAME StigmergyElection-PT-08b-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717013463177
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-08b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 20:11:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 20:11:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 20:11:05] [INFO ] Load time of PNML (sax parser for PT used): 678 ms
[2024-05-29 20:11:05] [INFO ] Transformed 1107 places.
[2024-05-29 20:11:05] [INFO ] Transformed 14564 transitions.
[2024-05-29 20:11:05] [INFO ] Found NUPN structural information;
[2024-05-29 20:11:05] [INFO ] Parsed PT model containing 1107 places and 14564 transitions and 216524 arcs in 862 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA StigmergyElection-PT-08b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-08b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-08b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-08b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-08b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-08b-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-08b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 1107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1107/1107 places, 14564/14564 transitions.
Discarding 133 places :
Symmetric choice reduction at 0 with 133 rule applications. Total rules 133 place count 974 transition count 14431
Iterating global reduction 0 with 133 rules applied. Total rules applied 266 place count 974 transition count 14431
Discarding 66 places :
Symmetric choice reduction at 0 with 66 rule applications. Total rules 332 place count 908 transition count 14365
Iterating global reduction 0 with 66 rules applied. Total rules applied 398 place count 908 transition count 14365
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 408 place count 898 transition count 14355
Iterating global reduction 0 with 10 rules applied. Total rules applied 418 place count 898 transition count 14355
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 424 place count 892 transition count 14349
Iterating global reduction 0 with 6 rules applied. Total rules applied 430 place count 892 transition count 14349
Applied a total of 430 rules in 892 ms. Remains 892 /1107 variables (removed 215) and now considering 14349/14564 (removed 215) transitions.
// Phase 1: matrix 14349 rows 892 cols
[2024-05-29 20:11:06] [INFO ] Computed 9 invariants in 362 ms
[2024-05-29 20:11:10] [INFO ] Implicit Places using invariants in 4457 ms returned []
Implicit Place search using SMT only with invariants took 4490 ms to find 0 implicit places.
Running 14348 sub problems to find dead transitions.
[2024-05-29 20:11:11] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 891/15241 variables, and 0 constraints, problems are : Problem set: 0 solved, 14348 unsolved in 30246 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/892 constraints, PredecessorRefiner: 14348/1176 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14348 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 891/15241 variables, and 0 constraints, problems are : Problem set: 0 solved, 14348 unsolved in 30148 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/892 constraints, PredecessorRefiner: 13172/1176 constraints, Known Traps: 0/0 constraints]
After SMT, in 260032ms problems are : Problem set: 0 solved, 14348 unsolved
Search for dead transitions found 0 dead transitions in 260247ms
Starting structural reductions in LTL mode, iteration 1 : 892/1107 places, 14349/14564 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 265735 ms. Remains : 892/1107 places, 14349/14564 transitions.
Support contains 35 out of 892 places after structural reductions.
[2024-05-29 20:15:33] [INFO ] Flatten gal took : 1478 ms
[2024-05-29 20:15:34] [INFO ] Flatten gal took : 1129 ms
[2024-05-29 20:15:36] [INFO ] Input system was already deterministic with 14349 transitions.
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 40000 steps (289 resets) in 2013 ms. (19 steps per ms) remains 8/16 properties
BEST_FIRST walk for 40003 steps (38 resets) in 302 ms. (132 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (39 resets) in 219 ms. (181 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (36 resets) in 185 ms. (215 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (36 resets) in 223 ms. (178 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (38 resets) in 106 ms. (373 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (37 resets) in 119 ms. (333 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (37 resets) in 290 ms. (137 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (35 resets) in 119 ms. (333 steps per ms) remains 8/8 properties
[2024-05-29 20:15:38] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 873/892 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/892 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 15241/15241 variables, and 901 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 892/892 constraints, PredecessorRefiner: 8/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 873/892 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-29 20:15:50] [INFO ] Deduced a trap composed of 100 places in 6750 ms of which 51 ms to minimize.
SMT process timed out in 12071ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 19 out of 892 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 892/892 places, 14349/14349 transitions.
Graph (trivial) has 873 edges and 892 vertex of which 129 / 892 are part of one of the 23 SCC in 8 ms
Free SCC test removed 106 places
Drop transitions (Empty/Sink Transition effects.) removed 143 transitions
Reduce isomorphic transitions removed 143 transitions.
Graph (complete) has 2215 edges and 786 vertex of which 778 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.66 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 519 transitions
Trivial Post-agglo rules discarded 519 transitions
Performed 519 trivial Post agglomeration. Transition count delta: 519
Iterating post reduction 0 with 527 rules applied. Total rules applied 529 place count 778 transition count 13679
Reduce places removed 519 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 538 rules applied. Total rules applied 1067 place count 259 transition count 13660
Reduce places removed 10 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 2 with 24 rules applied. Total rules applied 1091 place count 249 transition count 13646
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 1105 place count 235 transition count 13646
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 38 Pre rules applied. Total rules applied 1105 place count 235 transition count 13608
Deduced a syphon composed of 38 places in 7 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 1181 place count 197 transition count 13608
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1182 place count 196 transition count 13607
Iterating global reduction 4 with 1 rules applied. Total rules applied 1183 place count 196 transition count 13607
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1183 place count 196 transition count 13606
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1185 place count 195 transition count 13606
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1186 place count 194 transition count 11419
Iterating global reduction 4 with 1 rules applied. Total rules applied 1187 place count 194 transition count 11419
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1188 place count 194 transition count 11418
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 6 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 1260 place count 158 transition count 11382
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1268 place count 158 transition count 11374
Discarding 23 places :
Symmetric choice reduction at 6 with 23 rule applications. Total rules 1291 place count 135 transition count 1055
Iterating global reduction 6 with 23 rules applied. Total rules applied 1314 place count 135 transition count 1055
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 1328 place count 135 transition count 1041
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1330 place count 133 transition count 1039
Iterating global reduction 7 with 2 rules applied. Total rules applied 1332 place count 133 transition count 1039
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 1360 place count 119 transition count 1025
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 1370 place count 114 transition count 1033
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1372 place count 114 transition count 1031
Free-agglomeration rule applied 37 times.
Iterating global reduction 8 with 37 rules applied. Total rules applied 1409 place count 114 transition count 994
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 8 with 37 rules applied. Total rules applied 1446 place count 77 transition count 994
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1451 place count 72 transition count 989
Iterating global reduction 9 with 5 rules applied. Total rules applied 1456 place count 72 transition count 989
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1457 place count 72 transition count 988
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1459 place count 71 transition count 987
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 1462 place count 71 transition count 987
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1463 place count 71 transition count 986
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1465 place count 70 transition count 985
Applied a total of 1465 rules in 3435 ms. Remains 70 /892 variables (removed 822) and now considering 985/14349 (removed 13364) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3435 ms. Remains : 70/892 places, 985/14349 transitions.
RANDOM walk for 11595 steps (411 resets) in 190 ms. (60 steps per ms) remains 0/8 properties
FORMULA StigmergyElection-PT-08b-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 121 stabilizing places and 129 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 892 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 892/892 places, 14349/14349 transitions.
Graph (trivial) has 911 edges and 892 vertex of which 138 / 892 are part of one of the 24 SCC in 2 ms
Free SCC test removed 114 places
Ensure Unique test removed 130 transitions
Reduce isomorphic transitions removed 130 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 539 transitions
Trivial Post-agglo rules discarded 539 transitions
Performed 539 trivial Post agglomeration. Transition count delta: 539
Iterating post reduction 0 with 539 rules applied. Total rules applied 540 place count 777 transition count 13679
Reduce places removed 539 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 555 rules applied. Total rules applied 1095 place count 238 transition count 13663
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 1104 place count 230 transition count 13662
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1105 place count 229 transition count 13662
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 29 Pre rules applied. Total rules applied 1105 place count 229 transition count 13633
Deduced a syphon composed of 29 places in 7 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 1163 place count 200 transition count 13633
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1174 place count 189 transition count 13621
Iterating global reduction 4 with 11 rules applied. Total rules applied 1185 place count 189 transition count 13621
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1185 place count 189 transition count 13619
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1189 place count 187 transition count 13619
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1191 place count 185 transition count 11430
Iterating global reduction 4 with 2 rules applied. Total rules applied 1193 place count 185 transition count 11430
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1194 place count 185 transition count 11429
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1195 place count 184 transition count 11427
Iterating global reduction 5 with 1 rules applied. Total rules applied 1196 place count 184 transition count 11427
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 5 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 5 with 70 rules applied. Total rules applied 1266 place count 149 transition count 11392
Discarding 29 places :
Symmetric choice reduction at 5 with 29 rule applications. Total rules 1295 place count 120 transition count 949
Iterating global reduction 5 with 29 rules applied. Total rules applied 1324 place count 120 transition count 949
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 1339 place count 120 transition count 934
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1345 place count 114 transition count 922
Iterating global reduction 6 with 6 rules applied. Total rules applied 1351 place count 114 transition count 922
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1357 place count 108 transition count 910
Iterating global reduction 6 with 6 rules applied. Total rules applied 1363 place count 108 transition count 910
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 1389 place count 95 transition count 917
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1390 place count 94 transition count 899
Iterating global reduction 6 with 1 rules applied. Total rules applied 1391 place count 94 transition count 899
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1392 place count 94 transition count 898
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1400 place count 94 transition count 890
Applied a total of 1400 rules in 2193 ms. Remains 94 /892 variables (removed 798) and now considering 890/14349 (removed 13459) transitions.
[2024-05-29 20:15:56] [INFO ] Flow matrix only has 880 transitions (discarded 10 similar events)
// Phase 1: matrix 880 rows 94 cols
[2024-05-29 20:15:56] [INFO ] Computed 2 invariants in 11 ms
[2024-05-29 20:15:56] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-29 20:15:56] [INFO ] Flow matrix only has 880 transitions (discarded 10 similar events)
[2024-05-29 20:15:56] [INFO ] Invariant cache hit.
[2024-05-29 20:15:56] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-29 20:15:57] [INFO ] Implicit Places using invariants and state equation in 946 ms returned []
Implicit Place search using SMT with State Equation took 1283 ms to find 0 implicit places.
[2024-05-29 20:15:57] [INFO ] Redundant transitions in 53 ms returned []
Running 873 sub problems to find dead transitions.
[2024-05-29 20:15:57] [INFO ] Flow matrix only has 880 transitions (discarded 10 similar events)
[2024-05-29 20:15:57] [INFO ] Invariant cache hit.
[2024-05-29 20:15:57] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 873 unsolved
[2024-05-29 20:16:10] [INFO ] Deduced a trap composed of 26 places in 344 ms of which 1 ms to minimize.
[2024-05-29 20:16:10] [INFO ] Deduced a trap composed of 18 places in 334 ms of which 1 ms to minimize.
[2024-05-29 20:16:10] [INFO ] Deduced a trap composed of 24 places in 314 ms of which 1 ms to minimize.
[2024-05-29 20:16:11] [INFO ] Deduced a trap composed of 12 places in 321 ms of which 1 ms to minimize.
[2024-05-29 20:16:11] [INFO ] Deduced a trap composed of 20 places in 319 ms of which 1 ms to minimize.
[2024-05-29 20:16:11] [INFO ] Deduced a trap composed of 13 places in 293 ms of which 1 ms to minimize.
[2024-05-29 20:16:12] [INFO ] Deduced a trap composed of 18 places in 306 ms of which 5 ms to minimize.
[2024-05-29 20:16:12] [INFO ] Deduced a trap composed of 23 places in 274 ms of which 3 ms to minimize.
[2024-05-29 20:16:12] [INFO ] Deduced a trap composed of 19 places in 284 ms of which 1 ms to minimize.
[2024-05-29 20:16:13] [INFO ] Deduced a trap composed of 17 places in 283 ms of which 1 ms to minimize.
[2024-05-29 20:16:13] [INFO ] Deduced a trap composed of 19 places in 282 ms of which 1 ms to minimize.
[2024-05-29 20:16:13] [INFO ] Deduced a trap composed of 13 places in 249 ms of which 0 ms to minimize.
[2024-05-29 20:16:13] [INFO ] Deduced a trap composed of 19 places in 261 ms of which 0 ms to minimize.
[2024-05-29 20:16:14] [INFO ] Deduced a trap composed of 18 places in 318 ms of which 1 ms to minimize.
[2024-05-29 20:16:15] [INFO ] Deduced a trap composed of 12 places in 198 ms of which 0 ms to minimize.
[2024-05-29 20:16:15] [INFO ] Deduced a trap composed of 14 places in 226 ms of which 1 ms to minimize.
[2024-05-29 20:16:15] [INFO ] Deduced a trap composed of 16 places in 230 ms of which 1 ms to minimize.
[2024-05-29 20:16:15] [INFO ] Deduced a trap composed of 17 places in 257 ms of which 0 ms to minimize.
[2024-05-29 20:16:15] [INFO ] Deduced a trap composed of 13 places in 241 ms of which 1 ms to minimize.
[2024-05-29 20:16:16] [INFO ] Deduced a trap composed of 22 places in 311 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 873 unsolved
[2024-05-29 20:16:18] [INFO ] Deduced a trap composed of 19 places in 305 ms of which 1 ms to minimize.
[2024-05-29 20:16:18] [INFO ] Deduced a trap composed of 19 places in 277 ms of which 1 ms to minimize.
[2024-05-29 20:16:19] [INFO ] Deduced a trap composed of 19 places in 319 ms of which 1 ms to minimize.
[2024-05-29 20:16:19] [INFO ] Deduced a trap composed of 19 places in 313 ms of which 1 ms to minimize.
[2024-05-29 20:16:19] [INFO ] Deduced a trap composed of 23 places in 334 ms of which 0 ms to minimize.
[2024-05-29 20:16:20] [INFO ] Deduced a trap composed of 27 places in 310 ms of which 1 ms to minimize.
[2024-05-29 20:16:20] [INFO ] Deduced a trap composed of 20 places in 261 ms of which 1 ms to minimize.
[2024-05-29 20:16:20] [INFO ] Deduced a trap composed of 25 places in 289 ms of which 0 ms to minimize.
[2024-05-29 20:16:20] [INFO ] Deduced a trap composed of 23 places in 274 ms of which 1 ms to minimize.
[2024-05-29 20:16:21] [INFO ] Deduced a trap composed of 19 places in 284 ms of which 1 ms to minimize.
[2024-05-29 20:16:21] [INFO ] Deduced a trap composed of 19 places in 286 ms of which 1 ms to minimize.
[2024-05-29 20:16:21] [INFO ] Deduced a trap composed of 22 places in 286 ms of which 0 ms to minimize.
[2024-05-29 20:16:22] [INFO ] Deduced a trap composed of 24 places in 251 ms of which 1 ms to minimize.
[2024-05-29 20:16:22] [INFO ] Deduced a trap composed of 23 places in 260 ms of which 1 ms to minimize.
[2024-05-29 20:16:23] [INFO ] Deduced a trap composed of 13 places in 210 ms of which 0 ms to minimize.
[2024-05-29 20:16:23] [INFO ] Deduced a trap composed of 19 places in 266 ms of which 3 ms to minimize.
[2024-05-29 20:16:23] [INFO ] Deduced a trap composed of 22 places in 231 ms of which 1 ms to minimize.
[2024-05-29 20:16:23] [INFO ] Deduced a trap composed of 19 places in 244 ms of which 0 ms to minimize.
[2024-05-29 20:16:24] [INFO ] Deduced a trap composed of 19 places in 252 ms of which 1 ms to minimize.
[2024-05-29 20:16:27] [INFO ] Deduced a trap composed of 19 places in 273 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 873 unsolved
[2024-05-29 20:16:31] [INFO ] Deduced a trap composed of 19 places in 278 ms of which 1 ms to minimize.
[2024-05-29 20:16:31] [INFO ] Deduced a trap composed of 22 places in 289 ms of which 1 ms to minimize.
[2024-05-29 20:16:32] [INFO ] Deduced a trap composed of 20 places in 268 ms of which 1 ms to minimize.
[2024-05-29 20:16:32] [INFO ] Deduced a trap composed of 19 places in 265 ms of which 1 ms to minimize.
[2024-05-29 20:16:32] [INFO ] Deduced a trap composed of 24 places in 294 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 873 unsolved
[2024-05-29 20:16:33] [INFO ] Deduced a trap composed of 18 places in 258 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 94/974 variables, and 48 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/94 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 873/873 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 873 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 873 unsolved
[2024-05-29 20:16:38] [INFO ] Deduced a trap composed of 19 places in 293 ms of which 1 ms to minimize.
[2024-05-29 20:16:39] [INFO ] Deduced a trap composed of 18 places in 250 ms of which 1 ms to minimize.
[2024-05-29 20:16:40] [INFO ] Deduced a trap composed of 18 places in 229 ms of which 1 ms to minimize.
[2024-05-29 20:16:40] [INFO ] Deduced a trap composed of 19 places in 229 ms of which 1 ms to minimize.
[2024-05-29 20:16:43] [INFO ] Deduced a trap composed of 20 places in 266 ms of which 1 ms to minimize.
[2024-05-29 20:16:43] [INFO ] Deduced a trap composed of 25 places in 236 ms of which 1 ms to minimize.
[2024-05-29 20:16:43] [INFO ] Deduced a trap composed of 20 places in 236 ms of which 0 ms to minimize.
[2024-05-29 20:16:44] [INFO ] Deduced a trap composed of 20 places in 229 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 6 (OVERLAPS) 879/973 variables, 94/150 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/973 variables, 254/404 constraints. Problems are: Problem set: 0 solved, 873 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 973/974 variables, and 1277 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30142 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 254/255 constraints, PredecessorRefiner: 873/873 constraints, Known Traps: 54/54 constraints]
After SMT, in 68547ms problems are : Problem set: 0 solved, 873 unsolved
Search for dead transitions found 0 dead transitions in 68557ms
Starting structural reductions in SI_LTL mode, iteration 1 : 94/892 places, 890/14349 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72096 ms. Remains : 94/892 places, 890/14349 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-08b-LTLCardinality-02
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 2 ms.
FORMULA StigmergyElection-PT-08b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08b-LTLCardinality-02 finished in 72316 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))||G(p1))))'
Support contains 4 out of 892 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 892/892 places, 14349/14349 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 880 transition count 14337
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 880 transition count 14337
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 874 transition count 14331
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 874 transition count 14331
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 872 transition count 14329
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 872 transition count 14329
Applied a total of 40 rules in 444 ms. Remains 872 /892 variables (removed 20) and now considering 14329/14349 (removed 20) transitions.
// Phase 1: matrix 14329 rows 872 cols
[2024-05-29 20:17:07] [INFO ] Computed 9 invariants in 229 ms
[2024-05-29 20:17:11] [INFO ] Implicit Places using invariants in 4192 ms returned []
Implicit Place search using SMT only with invariants took 4194 ms to find 0 implicit places.
Running 14328 sub problems to find dead transitions.
[2024-05-29 20:17:11] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 871/15201 variables, and 0 constraints, problems are : Problem set: 0 solved, 14328 unsolved in 30182 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/872 constraints, PredecessorRefiner: 14328/1157 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14328 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 871/15201 variables, and 0 constraints, problems are : Problem set: 0 solved, 14328 unsolved in 30185 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/872 constraints, PredecessorRefiner: 13171/1157 constraints, Known Traps: 0/0 constraints]
After SMT, in 266027ms problems are : Problem set: 0 solved, 14328 unsolved
Search for dead transitions found 0 dead transitions in 266171ms
Starting structural reductions in LTL mode, iteration 1 : 872/892 places, 14329/14349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 270851 ms. Remains : 872/892 places, 14329/14349 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-08b-LTLCardinality-05
Product exploration explored 100000 steps with 742 reset in 739 ms.
Product exploration explored 100000 steps with 744 reset in 1167 ms.
Computed a total of 120 stabilizing places and 128 stable transitions
Computed a total of 120 stabilizing places and 128 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 102 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 125 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (289 resets) in 642 ms. (62 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (36 resets) in 207 ms. (192 steps per ms) remains 1/1 properties
[2024-05-29 20:21:40] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 430/434 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 438/872 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/872 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 15201/15201 variables, and 881 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3329 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 872/872 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 430/434 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 20:21:46] [INFO ] Deduced a trap composed of 170 places in 2482 ms of which 3 ms to minimize.
[2024-05-29 20:21:48] [INFO ] Deduced a trap composed of 170 places in 2481 ms of which 4 ms to minimize.
SMT process timed out in 8414ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 872 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 872/872 places, 14329/14329 transitions.
Graph (trivial) has 887 edges and 872 vertex of which 136 / 872 are part of one of the 24 SCC in 1 ms
Free SCC test removed 112 places
Drop transitions (Empty/Sink Transition effects.) removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Graph (complete) has 2186 edges and 760 vertex of which 752 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.19 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 531 transitions
Trivial Post-agglo rules discarded 531 transitions
Performed 531 trivial Post agglomeration. Transition count delta: 531
Iterating post reduction 0 with 539 rules applied. Total rules applied 541 place count 752 transition count 13638
Reduce places removed 531 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 546 rules applied. Total rules applied 1087 place count 221 transition count 13623
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 1095 place count 214 transition count 13622
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1096 place count 213 transition count 13622
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 40 Pre rules applied. Total rules applied 1096 place count 213 transition count 13582
Deduced a syphon composed of 40 places in 6 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 1176 place count 173 transition count 13582
Performed 43 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 43 places in 4 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 1262 place count 130 transition count 13538
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 1278 place count 130 transition count 13522
Discarding 31 places :
Symmetric choice reduction at 5 with 31 rule applications. Total rules 1309 place count 99 transition count 1009
Iterating global reduction 5 with 31 rules applied. Total rules applied 1340 place count 99 transition count 1009
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 1354 place count 99 transition count 995
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1361 place count 92 transition count 988
Iterating global reduction 6 with 7 rules applied. Total rules applied 1368 place count 92 transition count 988
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1384 place count 84 transition count 980
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1390 place count 81 transition count 988
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1398 place count 81 transition count 980
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1400 place count 80 transition count 986
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1408 place count 80 transition count 978
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1410 place count 79 transition count 984
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1418 place count 79 transition count 976
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1420 place count 78 transition count 982
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1428 place count 78 transition count 974
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1430 place count 77 transition count 980
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1438 place count 77 transition count 972
Free-agglomeration rule applied 42 times.
Iterating global reduction 6 with 42 rules applied. Total rules applied 1480 place count 77 transition count 930
Reduce places removed 42 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 6 with 75 rules applied. Total rules applied 1555 place count 35 transition count 897
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1563 place count 27 transition count 889
Iterating global reduction 7 with 8 rules applied. Total rules applied 1571 place count 27 transition count 889
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 7 with 255 rules applied. Total rules applied 1826 place count 27 transition count 634
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 8 with 33 rules applied. Total rules applied 1859 place count 27 transition count 601
Applied a total of 1859 rules in 1831 ms. Remains 27 /872 variables (removed 845) and now considering 601/14329 (removed 13728) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1831 ms. Remains : 27/872 places, 601/14329 transitions.
RANDOM walk for 102 steps (0 resets) in 36 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 6 factoid took 183 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 872 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 872/872 places, 14329/14329 transitions.
Applied a total of 0 rules in 114 ms. Remains 872 /872 variables (removed 0) and now considering 14329/14329 (removed 0) transitions.
[2024-05-29 20:21:51] [INFO ] Invariant cache hit.
[2024-05-29 20:21:54] [INFO ] Implicit Places using invariants in 3910 ms returned []
Implicit Place search using SMT only with invariants took 3910 ms to find 0 implicit places.
Running 14328 sub problems to find dead transitions.
[2024-05-29 20:21:55] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 871/15201 variables, and 0 constraints, problems are : Problem set: 0 solved, 14328 unsolved in 30243 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/872 constraints, PredecessorRefiner: 14328/1157 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14328 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 871/15201 variables, and 0 constraints, problems are : Problem set: 0 solved, 14328 unsolved in 30167 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/872 constraints, PredecessorRefiner: 13171/1157 constraints, Known Traps: 0/0 constraints]
After SMT, in 265591ms problems are : Problem set: 0 solved, 14328 unsolved
Search for dead transitions found 0 dead transitions in 265728ms
Finished structural reductions in LTL mode , in 1 iterations and 269791 ms. Remains : 872/872 places, 14329/14329 transitions.
Computed a total of 120 stabilizing places and 128 stable transitions
Computed a total of 120 stabilizing places and 128 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 99 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (290 resets) in 1044 ms. (38 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (36 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
[2024-05-29 20:26:21] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 430/434 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 438/872 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/872 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 15201/15201 variables, and 881 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3122 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 872/872 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 430/434 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 20:26:27] [INFO ] Deduced a trap composed of 170 places in 2468 ms of which 3 ms to minimize.
[2024-05-29 20:26:29] [INFO ] Deduced a trap composed of 170 places in 2422 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/15201 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5074 ms.
Refiners :[Positive P Invariants (semi-flows): 4/9 constraints, State Equation: 0/872 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 8241ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 872 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 872/872 places, 14329/14329 transitions.
Graph (trivial) has 887 edges and 872 vertex of which 136 / 872 are part of one of the 24 SCC in 1 ms
Free SCC test removed 112 places
Drop transitions (Empty/Sink Transition effects.) removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Graph (complete) has 2186 edges and 760 vertex of which 752 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.18 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 531 transitions
Trivial Post-agglo rules discarded 531 transitions
Performed 531 trivial Post agglomeration. Transition count delta: 531
Iterating post reduction 0 with 539 rules applied. Total rules applied 541 place count 752 transition count 13638
Reduce places removed 531 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 546 rules applied. Total rules applied 1087 place count 221 transition count 13623
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 1095 place count 214 transition count 13622
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1096 place count 213 transition count 13622
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 40 Pre rules applied. Total rules applied 1096 place count 213 transition count 13582
Deduced a syphon composed of 40 places in 5 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 1176 place count 173 transition count 13582
Performed 43 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 43 places in 3 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 1262 place count 130 transition count 13538
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 1278 place count 130 transition count 13522
Discarding 31 places :
Symmetric choice reduction at 5 with 31 rule applications. Total rules 1309 place count 99 transition count 1009
Iterating global reduction 5 with 31 rules applied. Total rules applied 1340 place count 99 transition count 1009
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 1354 place count 99 transition count 995
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1361 place count 92 transition count 988
Iterating global reduction 6 with 7 rules applied. Total rules applied 1368 place count 92 transition count 988
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1384 place count 84 transition count 980
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1390 place count 81 transition count 988
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1398 place count 81 transition count 980
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1400 place count 80 transition count 986
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1408 place count 80 transition count 978
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1410 place count 79 transition count 984
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1418 place count 79 transition count 976
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1420 place count 78 transition count 982
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1428 place count 78 transition count 974
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1430 place count 77 transition count 980
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1438 place count 77 transition count 972
Free-agglomeration rule applied 42 times.
Iterating global reduction 6 with 42 rules applied. Total rules applied 1480 place count 77 transition count 930
Reduce places removed 42 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 6 with 75 rules applied. Total rules applied 1555 place count 35 transition count 897
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1563 place count 27 transition count 889
Iterating global reduction 7 with 8 rules applied. Total rules applied 1571 place count 27 transition count 889
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 7 with 255 rules applied. Total rules applied 1826 place count 27 transition count 634
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 8 with 33 rules applied. Total rules applied 1859 place count 27 transition count 601
Applied a total of 1859 rules in 1793 ms. Remains 27 /872 variables (removed 845) and now considering 601/14329 (removed 13728) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1795 ms. Remains : 27/872 places, 601/14329 transitions.
RANDOM walk for 101 steps (0 resets) in 10 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 210 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 740 reset in 646 ms.
Product exploration explored 100000 steps with 743 reset in 665 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 872 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 872/872 places, 14329/14329 transitions.
Graph (trivial) has 887 edges and 872 vertex of which 136 / 872 are part of one of the 24 SCC in 1 ms
Free SCC test removed 112 places
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Performed 516 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 516 rules applied. Total rules applied 517 place count 760 transition count 14201
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 525 place count 760 transition count 14193
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 525 place count 760 transition count 14201
Deduced a syphon composed of 532 places in 7 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 541 place count 760 transition count 14201
Discarding 441 places :
Symmetric choice reduction at 2 with 441 rule applications. Total rules 982 place count 319 transition count 13760
Deduced a syphon composed of 98 places in 6 ms
Iterating global reduction 2 with 441 rules applied. Total rules applied 1423 place count 319 transition count 13760
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 163 places in 4 ms
Iterating global reduction 2 with 65 rules applied. Total rules applied 1488 place count 319 transition count 13761
Discarding 88 places :
Symmetric choice reduction at 2 with 88 rule applications. Total rules 1576 place count 231 transition count 1183
Deduced a syphon composed of 107 places in 0 ms
Iterating global reduction 2 with 88 rules applied. Total rules applied 1664 place count 231 transition count 1183
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 1678 place count 231 transition count 1169
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 1709 place count 200 transition count 1130
Deduced a syphon composed of 83 places in 1 ms
Iterating global reduction 3 with 31 rules applied. Total rules applied 1740 place count 200 transition count 1130
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1747 place count 193 transition count 1123
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 3 with 7 rules applied. Total rules applied 1754 place count 193 transition count 1123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 84 places in 1 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1755 place count 193 transition count 1124
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1756 place count 192 transition count 1122
Deduced a syphon composed of 83 places in 1 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1757 place count 192 transition count 1122
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -51
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 3 with 10 rules applied. Total rules applied 1767 place count 192 transition count 1173
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 1784 place count 175 transition count 1139
Deduced a syphon composed of 76 places in 1 ms
Iterating global reduction 3 with 17 rules applied. Total rules applied 1801 place count 175 transition count 1139
Deduced a syphon composed of 76 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 3 with 21 rules applied. Total rules applied 1822 place count 175 transition count 1118
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1823 place count 175 transition count 1131
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1824 place count 174 transition count 1129
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1825 place count 174 transition count 1129
Deduced a syphon composed of 76 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 1829 place count 174 transition count 1125
Deduced a syphon composed of 76 places in 0 ms
Applied a total of 1829 rules in 2434 ms. Remains 174 /872 variables (removed 698) and now considering 1125/14329 (removed 13204) transitions.
[2024-05-29 20:26:36] [INFO ] Redundant transitions in 21 ms returned []
Running 1121 sub problems to find dead transitions.
[2024-05-29 20:26:36] [INFO ] Flow matrix only has 1116 transitions (discarded 9 similar events)
// Phase 1: matrix 1116 rows 174 cols
[2024-05-29 20:26:36] [INFO ] Computed 2 invariants in 18 ms
[2024-05-29 20:26:36] [INFO ] State equation strengthened by 263 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1121 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1121 unsolved
[2024-05-29 20:26:53] [INFO ] Deduced a trap composed of 13 places in 367 ms of which 2 ms to minimize.
[2024-05-29 20:26:54] [INFO ] Deduced a trap composed of 19 places in 372 ms of which 1 ms to minimize.
[2024-05-29 20:26:54] [INFO ] Deduced a trap composed of 3 places in 373 ms of which 1 ms to minimize.
[2024-05-29 20:26:55] [INFO ] Deduced a trap composed of 12 places in 339 ms of which 1 ms to minimize.
[2024-05-29 20:26:55] [INFO ] Deduced a trap composed of 15 places in 339 ms of which 1 ms to minimize.
[2024-05-29 20:26:55] [INFO ] Deduced a trap composed of 20 places in 329 ms of which 1 ms to minimize.
[2024-05-29 20:26:56] [INFO ] Deduced a trap composed of 18 places in 301 ms of which 1 ms to minimize.
[2024-05-29 20:26:56] [INFO ] Deduced a trap composed of 19 places in 296 ms of which 1 ms to minimize.
[2024-05-29 20:26:56] [INFO ] Deduced a trap composed of 13 places in 288 ms of which 1 ms to minimize.
[2024-05-29 20:26:56] [INFO ] Deduced a trap composed of 12 places in 299 ms of which 1 ms to minimize.
[2024-05-29 20:26:57] [INFO ] Deduced a trap composed of 15 places in 301 ms of which 1 ms to minimize.
[2024-05-29 20:26:57] [INFO ] Deduced a trap composed of 15 places in 303 ms of which 1 ms to minimize.
[2024-05-29 20:26:57] [INFO ] Deduced a trap composed of 21 places in 305 ms of which 1 ms to minimize.
[2024-05-29 20:26:58] [INFO ] Deduced a trap composed of 15 places in 403 ms of which 1 ms to minimize.
[2024-05-29 20:26:59] [INFO ] Deduced a trap composed of 24 places in 365 ms of which 1 ms to minimize.
[2024-05-29 20:26:59] [INFO ] Deduced a trap composed of 24 places in 343 ms of which 1 ms to minimize.
[2024-05-29 20:26:59] [INFO ] Deduced a trap composed of 22 places in 322 ms of which 1 ms to minimize.
[2024-05-29 20:27:00] [INFO ] Deduced a trap composed of 22 places in 306 ms of which 1 ms to minimize.
[2024-05-29 20:27:00] [INFO ] Deduced a trap composed of 21 places in 331 ms of which 1 ms to minimize.
[2024-05-29 20:27:00] [INFO ] Deduced a trap composed of 21 places in 293 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 20/22 constraints. Problems are: Problem set: 18 solved, 1103 unsolved
[2024-05-29 20:27:01] [INFO ] Deduced a trap composed of 19 places in 356 ms of which 1 ms to minimize.
[2024-05-29 20:27:01] [INFO ] Deduced a trap composed of 21 places in 311 ms of which 1 ms to minimize.
[2024-05-29 20:27:02] [INFO ] Deduced a trap composed of 18 places in 287 ms of which 1 ms to minimize.
[2024-05-29 20:27:02] [INFO ] Deduced a trap composed of 22 places in 261 ms of which 1 ms to minimize.
[2024-05-29 20:27:03] [INFO ] Deduced a trap composed of 21 places in 308 ms of which 1 ms to minimize.
[2024-05-29 20:27:03] [INFO ] Deduced a trap composed of 22 places in 286 ms of which 1 ms to minimize.
[2024-05-29 20:27:03] [INFO ] Deduced a trap composed of 19 places in 316 ms of which 1 ms to minimize.
[2024-05-29 20:27:04] [INFO ] Deduced a trap composed of 20 places in 283 ms of which 1 ms to minimize.
[2024-05-29 20:27:04] [INFO ] Deduced a trap composed of 20 places in 276 ms of which 1 ms to minimize.
[2024-05-29 20:27:04] [INFO ] Deduced a trap composed of 18 places in 300 ms of which 1 ms to minimize.
[2024-05-29 20:27:10] [INFO ] Deduced a trap composed of 19 places in 339 ms of which 1 ms to minimize.
[2024-05-29 20:27:10] [INFO ] Deduced a trap composed of 18 places in 319 ms of which 1 ms to minimize.
[2024-05-29 20:27:11] [INFO ] Deduced a trap composed of 20 places in 304 ms of which 1 ms to minimize.
[2024-05-29 20:27:11] [INFO ] Deduced a trap composed of 19 places in 302 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 14/36 constraints. Problems are: Problem set: 18 solved, 1103 unsolved
[2024-05-29 20:27:16] [INFO ] Deduced a trap composed of 18 places in 298 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 174/1290 variables, and 37 constraints, problems are : Problem set: 18 solved, 1103 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/174 constraints, ReadFeed: 0/263 constraints, PredecessorRefiner: 1121/1121 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 18 solved, 1103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 18 solved, 1103 unsolved
At refinement iteration 1 (OVERLAPS) 4/174 variables, 2/2 constraints. Problems are: Problem set: 18 solved, 1103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 35/37 constraints. Problems are: Problem set: 18 solved, 1103 unsolved
[2024-05-29 20:27:21] [INFO ] Deduced a trap composed of 22 places in 333 ms of which 1 ms to minimize.
[2024-05-29 20:27:21] [INFO ] Deduced a trap composed of 27 places in 329 ms of which 1 ms to minimize.
[2024-05-29 20:27:21] [INFO ] Deduced a trap composed of 27 places in 307 ms of which 1 ms to minimize.
[2024-05-29 20:27:22] [INFO ] Deduced a trap composed of 22 places in 282 ms of which 1 ms to minimize.
[2024-05-29 20:27:22] [INFO ] Deduced a trap composed of 19 places in 287 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 5/42 constraints. Problems are: Problem set: 18 solved, 1103 unsolved
[2024-05-29 20:27:29] [INFO ] Deduced a trap composed of 20 places in 307 ms of which 1 ms to minimize.
[2024-05-29 20:27:29] [INFO ] Deduced a trap composed of 21 places in 281 ms of which 0 ms to minimize.
[2024-05-29 20:27:30] [INFO ] Deduced a trap composed of 18 places in 285 ms of which 1 ms to minimize.
[2024-05-29 20:27:36] [INFO ] Deduced a trap composed of 19 places in 325 ms of which 1 ms to minimize.
[2024-05-29 20:27:36] [INFO ] Deduced a trap composed of 22 places in 306 ms of which 1 ms to minimize.
[2024-05-29 20:27:37] [INFO ] Deduced a trap composed of 22 places in 296 ms of which 1 ms to minimize.
[2024-05-29 20:27:37] [INFO ] Deduced a trap composed of 21 places in 306 ms of which 1 ms to minimize.
[2024-05-29 20:27:37] [INFO ] Deduced a trap composed of 19 places in 296 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 8/50 constraints. Problems are: Problem set: 18 solved, 1103 unsolved
[2024-05-29 20:27:39] [INFO ] Deduced a trap composed of 21 places in 329 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 1/51 constraints. Problems are: Problem set: 18 solved, 1103 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 174/1290 variables, and 51 constraints, problems are : Problem set: 18 solved, 1103 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/174 constraints, ReadFeed: 0/263 constraints, PredecessorRefiner: 0/1121 constraints, Known Traps: 49/49 constraints]
After SMT, in 70087ms problems are : Problem set: 18 solved, 1103 unsolved
Search for dead transitions found 18 dead transitions in 70100ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 174/872 places, 1107/14329 transitions.
Graph (complete) has 1017 edges and 174 vertex of which 171 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Deduced a syphon composed of 73 places in 0 ms
Applied a total of 1 rules in 55 ms. Remains 171 /174 variables (removed 3) and now considering 1107/1107 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 171/872 places, 1107/14329 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 72628 ms. Remains : 171/872 places, 1107/14329 transitions.
Support contains 4 out of 872 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 872/872 places, 14329/14329 transitions.
Applied a total of 0 rules in 99 ms. Remains 872 /872 variables (removed 0) and now considering 14329/14329 (removed 0) transitions.
// Phase 1: matrix 14329 rows 872 cols
[2024-05-29 20:27:46] [INFO ] Computed 9 invariants in 273 ms
[2024-05-29 20:27:51] [INFO ] Implicit Places using invariants in 4378 ms returned []
Implicit Place search using SMT only with invariants took 4380 ms to find 0 implicit places.
Running 14328 sub problems to find dead transitions.
[2024-05-29 20:27:51] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 871/15201 variables, and 0 constraints, problems are : Problem set: 0 solved, 14328 unsolved in 30162 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/872 constraints, PredecessorRefiner: 14328/1157 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14328 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 timeout
1)
(s465 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 871/15201 variables, and 0 constraints, problems are : Problem set: 0 solved, 14328 unsolved in 30182 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/872 constraints, PredecessorRefiner: 13171/1157 constraints, Known Traps: 0/0 constraints]
After SMT, in 287419ms problems are : Problem set: 0 solved, 14328 unsolved
Search for dead transitions found 0 dead transitions in 287560ms
Finished structural reductions in LTL mode , in 1 iterations and 292076 ms. Remains : 872/872 places, 14329/14329 transitions.
Treatment of property StigmergyElection-PT-08b-LTLCardinality-05 finished in 934347 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&&X(p1)))))'
Support contains 4 out of 892 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 892/892 places, 14349/14349 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 879 transition count 14336
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 879 transition count 14336
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 872 transition count 14329
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 872 transition count 14329
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 870 transition count 14327
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 870 transition count 14327
Applied a total of 44 rules in 509 ms. Remains 870 /892 variables (removed 22) and now considering 14327/14349 (removed 22) transitions.
// Phase 1: matrix 14327 rows 870 cols
[2024-05-29 20:32:41] [INFO ] Computed 9 invariants in 245 ms
[2024-05-29 20:32:45] [INFO ] Implicit Places using invariants in 4043 ms returned []
Implicit Place search using SMT only with invariants took 4047 ms to find 0 implicit places.
Running 14326 sub problems to find dead transitions.
[2024-05-29 20:32:45] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 869/15197 variables, and 0 constraints, problems are : Problem set: 0 solved, 14326 unsolved in 30165 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/870 constraints, PredecessorRefiner: 14326/1156 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14326 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 869/15197 variables, and 0 constraints, problems are : Problem set: 0 solved, 14326 unsolved in 30154 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/870 constraints, PredecessorRefiner: 13170/1156 constraints, Known Traps: 0/0 constraints]
After SMT, in 262174ms problems are : Problem set: 0 solved, 14326 unsolved
Search for dead transitions found 0 dead transitions in 262344ms
Starting structural reductions in LTL mode, iteration 1 : 870/892 places, 14327/14349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 266942 ms. Remains : 870/892 places, 14327/14349 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-08b-LTLCardinality-06
Product exploration explored 100000 steps with 33342 reset in 650 ms.
Product exploration explored 100000 steps with 33307 reset in 661 ms.
Computed a total of 120 stabilizing places and 128 stable transitions
Computed a total of 120 stabilizing places and 128 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 155 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (290 resets) in 501 ms. (79 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (38 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
[2024-05-29 20:37:09] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 336/340 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 530/870 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/870 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 15197/15197 variables, and 879 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3062 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 870/870 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 336/340 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 530/870 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 20:37:17] [INFO ] Deduced a trap composed of 170 places in 4528 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/870 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/870 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 8123ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 870 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 870/870 places, 14327/14327 transitions.
Graph (trivial) has 886 edges and 870 vertex of which 136 / 870 are part of one of the 24 SCC in 1 ms
Free SCC test removed 112 places
Drop transitions (Empty/Sink Transition effects.) removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Graph (complete) has 2184 edges and 758 vertex of which 750 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.18 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 528 transitions
Trivial Post-agglo rules discarded 528 transitions
Performed 528 trivial Post agglomeration. Transition count delta: 528
Iterating post reduction 0 with 536 rules applied. Total rules applied 538 place count 750 transition count 13639
Reduce places removed 528 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 544 rules applied. Total rules applied 1082 place count 222 transition count 13623
Reduce places removed 8 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 11 rules applied. Total rules applied 1093 place count 214 transition count 13620
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1096 place count 211 transition count 13620
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 41 Pre rules applied. Total rules applied 1096 place count 211 transition count 13579
Deduced a syphon composed of 41 places in 5 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 1178 place count 170 transition count 13579
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1179 place count 170 transition count 13578
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 1261 place count 129 transition count 13537
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 1277 place count 129 transition count 13521
Discarding 32 places :
Symmetric choice reduction at 6 with 32 rule applications. Total rules 1309 place count 97 transition count 1007
Iterating global reduction 6 with 32 rules applied. Total rules applied 1341 place count 97 transition count 1007
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 1355 place count 97 transition count 993
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1363 place count 89 transition count 985
Iterating global reduction 7 with 8 rules applied. Total rules applied 1371 place count 89 transition count 985
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 1387 place count 81 transition count 977
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1393 place count 78 transition count 985
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 1402 place count 78 transition count 976
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1404 place count 77 transition count 982
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1412 place count 77 transition count 974
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1414 place count 76 transition count 980
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1422 place count 76 transition count 972
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1424 place count 75 transition count 978
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1432 place count 75 transition count 970
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1434 place count 74 transition count 976
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1442 place count 74 transition count 968
Free-agglomeration rule applied 41 times.
Iterating global reduction 7 with 41 rules applied. Total rules applied 1483 place count 74 transition count 927
Reduce places removed 41 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 7 with 106 rules applied. Total rules applied 1589 place count 33 transition count 862
Drop transitions (Redundant composition of simpler transitions.) removed 191 transitions
Redundant transition composition rules discarded 191 transitions
Iterating global reduction 8 with 191 rules applied. Total rules applied 1780 place count 33 transition count 671
Applied a total of 1780 rules in 1708 ms. Remains 33 /870 variables (removed 837) and now considering 671/14327 (removed 13656) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1708 ms. Remains : 33/870 places, 671/14327 transitions.
RANDOM walk for 206 steps (17 resets) in 8 ms. (22 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 327 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 870 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 14327/14327 transitions.
Applied a total of 0 rules in 109 ms. Remains 870 /870 variables (removed 0) and now considering 14327/14327 (removed 0) transitions.
[2024-05-29 20:37:20] [INFO ] Invariant cache hit.
[2024-05-29 20:37:24] [INFO ] Implicit Places using invariants in 3803 ms returned []
Implicit Place search using SMT only with invariants took 3804 ms to find 0 implicit places.
Running 14326 sub problems to find dead transitions.
[2024-05-29 20:37:24] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 869/15197 variables, and 0 constraints, problems are : Problem set: 0 solved, 14326 unsolved in 30158 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/870 constraints, PredecessorRefiner: 14326/1156 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14326 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 869/15197 variables, and 0 constraints, problems are : Problem set: 0 solved, 14326 unsolved in 30148 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/870 constraints, PredecessorRefiner: 13170/1156 constraints, Known Traps: 0/0 constraints]
After SMT, in 264160ms problems are : Problem set: 0 solved, 14326 unsolved
Search for dead transitions found 0 dead transitions in 264292ms
Finished structural reductions in LTL mode , in 1 iterations and 268233 ms. Remains : 870/870 places, 14327/14327 transitions.
Computed a total of 120 stabilizing places and 128 stable transitions
Computed a total of 120 stabilizing places and 128 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 113 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 31938 steps (231 resets) in 258 ms. (123 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 241 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 33253 reset in 651 ms.
Product exploration explored 100000 steps with 33221 reset in 660 ms.
Support contains 4 out of 870 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 14327/14327 transitions.
Applied a total of 0 rules in 111 ms. Remains 870 /870 variables (removed 0) and now considering 14327/14327 (removed 0) transitions.
[2024-05-29 20:41:51] [INFO ] Invariant cache hit.
[2024-05-29 20:41:54] [INFO ] Implicit Places using invariants in 3817 ms returned []
Implicit Place search using SMT only with invariants took 3821 ms to find 0 implicit places.
Running 14326 sub problems to find dead transitions.
[2024-05-29 20:41:55] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 869/15197 variables, and 0 constraints, problems are : Problem set: 0 solved, 14326 unsolved in 30150 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/870 constraints, PredecessorRefiner: 14326/1156 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14326 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 869/15197 variables, and 0 constraints, problems are : Problem set: 0 solved, 14326 unsolved in 30161 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/870 constraints, PredecessorRefiner: 13170/1156 constraints, Known Traps: 0/0 constraints]
After SMT, in 263709ms problems are : Problem set: 0 solved, 14326 unsolved
Search for dead transitions found 0 dead transitions in 263845ms
Finished structural reductions in LTL mode , in 1 iterations and 267807 ms. Remains : 870/870 places, 14327/14327 transitions.
Treatment of property StigmergyElection-PT-08b-LTLCardinality-06 finished in 819862 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (!p1&&X(p0)&&(X(!p3)||p2))))'
Support contains 6 out of 892 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 892/892 places, 14349/14349 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 883 transition count 14340
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 883 transition count 14340
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 877 transition count 14334
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 877 transition count 14334
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 875 transition count 14332
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 875 transition count 14332
Applied a total of 34 rules in 613 ms. Remains 875 /892 variables (removed 17) and now considering 14332/14349 (removed 17) transitions.
// Phase 1: matrix 14332 rows 875 cols
[2024-05-29 20:46:21] [INFO ] Computed 9 invariants in 223 ms
[2024-05-29 20:46:25] [INFO ] Implicit Places using invariants in 4358 ms returned []
Implicit Place search using SMT only with invariants took 4359 ms to find 0 implicit places.
Running 14331 sub problems to find dead transitions.
[2024-05-29 20:46:25] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 874/15207 variables, and 0 constraints, problems are : Problem set: 0 solved, 14331 unsolved in 30159 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/875 constraints, PredecessorRefiner: 14331/1160 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14331 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(timeout
s563 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 874/15207 variables, and 0 constraints, problems are : Problem set: 0 solved, 14331 unsolved in 30153 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/875 constraints, PredecessorRefiner: 13171/1160 constraints, Known Traps: 0/0 constraints]
After SMT, in 284723ms problems are : Problem set: 0 solved, 14331 unsolved
Search for dead transitions found 0 dead transitions in 284918ms
Starting structural reductions in LTL mode, iteration 1 : 875/892 places, 14332/14349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 289945 ms. Remains : 875/892 places, 14332/14349 transitions.
Stuttering acceptance computed with spot in 255 ms :[true, (OR (NOT p0) p1 (AND (NOT p2) p3)), (NOT p0), (NOT p0), (OR (NOT p0) p3), (OR (NOT p0) (AND (NOT p2) p3) (AND p1 p3))]
Running random walk in product with property : StigmergyElection-PT-08b-LTLCardinality-07
Stuttering criterion allowed to conclude after 135 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-08b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08b-LTLCardinality-07 finished in 290260 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 892 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 892/892 places, 14349/14349 transitions.
Graph (trivial) has 897 edges and 892 vertex of which 131 / 892 are part of one of the 23 SCC in 1 ms
Free SCC test removed 108 places
Ensure Unique test removed 123 transitions
Reduce isomorphic transitions removed 123 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 531 transitions
Trivial Post-agglo rules discarded 531 transitions
Performed 531 trivial Post agglomeration. Transition count delta: 531
Iterating post reduction 0 with 531 rules applied. Total rules applied 532 place count 784 transition count 13695
Reduce places removed 531 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 550 rules applied. Total rules applied 1082 place count 253 transition count 13676
Reduce places removed 10 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 18 rules applied. Total rules applied 1100 place count 243 transition count 13668
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 1108 place count 235 transition count 13668
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 30 Pre rules applied. Total rules applied 1108 place count 235 transition count 13638
Deduced a syphon composed of 30 places in 7 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 1168 place count 205 transition count 13638
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1178 place count 195 transition count 13627
Iterating global reduction 4 with 10 rules applied. Total rules applied 1188 place count 195 transition count 13627
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1188 place count 195 transition count 13626
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1190 place count 194 transition count 13626
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1192 place count 192 transition count 11437
Iterating global reduction 4 with 2 rules applied. Total rules applied 1194 place count 192 transition count 11437
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1195 place count 192 transition count 11436
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1196 place count 191 transition count 11434
Iterating global reduction 5 with 1 rules applied. Total rules applied 1197 place count 191 transition count 11434
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 4 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 1271 place count 154 transition count 11397
Discarding 30 places :
Symmetric choice reduction at 5 with 30 rule applications. Total rules 1301 place count 124 transition count 939
Iterating global reduction 5 with 30 rules applied. Total rules applied 1331 place count 124 transition count 939
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 1346 place count 124 transition count 924
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1351 place count 119 transition count 914
Iterating global reduction 6 with 5 rules applied. Total rules applied 1356 place count 119 transition count 914
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1361 place count 114 transition count 909
Iterating global reduction 6 with 5 rules applied. Total rules applied 1366 place count 114 transition count 909
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 6 with 20 rules applied. Total rules applied 1386 place count 104 transition count 899
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1394 place count 100 transition count 907
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1395 place count 100 transition count 906
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1403 place count 100 transition count 898
Applied a total of 1403 rules in 1828 ms. Remains 100 /892 variables (removed 792) and now considering 898/14349 (removed 13451) transitions.
[2024-05-29 20:51:12] [INFO ] Flow matrix only has 890 transitions (discarded 8 similar events)
// Phase 1: matrix 890 rows 100 cols
[2024-05-29 20:51:12] [INFO ] Computed 2 invariants in 14 ms
[2024-05-29 20:51:12] [INFO ] Implicit Places using invariants in 249 ms returned []
[2024-05-29 20:51:12] [INFO ] Flow matrix only has 890 transitions (discarded 8 similar events)
[2024-05-29 20:51:12] [INFO ] Invariant cache hit.
[2024-05-29 20:51:13] [INFO ] State equation strengthened by 263 read => feed constraints.
[2024-05-29 20:51:13] [INFO ] Implicit Places using invariants and state equation in 834 ms returned []
Implicit Place search using SMT with State Equation took 1085 ms to find 0 implicit places.
[2024-05-29 20:51:13] [INFO ] Redundant transitions in 9 ms returned []
Running 882 sub problems to find dead transitions.
[2024-05-29 20:51:13] [INFO ] Flow matrix only has 890 transitions (discarded 8 similar events)
[2024-05-29 20:51:13] [INFO ] Invariant cache hit.
[2024-05-29 20:51:13] [INFO ] State equation strengthened by 263 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-05-29 20:51:25] [INFO ] Deduced a trap composed of 14 places in 297 ms of which 1 ms to minimize.
[2024-05-29 20:51:25] [INFO ] Deduced a trap composed of 19 places in 280 ms of which 1 ms to minimize.
[2024-05-29 20:51:26] [INFO ] Deduced a trap composed of 16 places in 271 ms of which 0 ms to minimize.
[2024-05-29 20:51:26] [INFO ] Deduced a trap composed of 20 places in 242 ms of which 1 ms to minimize.
[2024-05-29 20:51:26] [INFO ] Deduced a trap composed of 12 places in 276 ms of which 1 ms to minimize.
[2024-05-29 20:51:26] [INFO ] Deduced a trap composed of 20 places in 232 ms of which 1 ms to minimize.
[2024-05-29 20:51:27] [INFO ] Deduced a trap composed of 19 places in 265 ms of which 1 ms to minimize.
[2024-05-29 20:51:27] [INFO ] Deduced a trap composed of 14 places in 243 ms of which 0 ms to minimize.
[2024-05-29 20:51:27] [INFO ] Deduced a trap composed of 18 places in 290 ms of which 1 ms to minimize.
[2024-05-29 20:51:27] [INFO ] Deduced a trap composed of 18 places in 256 ms of which 1 ms to minimize.
[2024-05-29 20:51:28] [INFO ] Deduced a trap composed of 20 places in 284 ms of which 1 ms to minimize.
[2024-05-29 20:51:28] [INFO ] Deduced a trap composed of 22 places in 283 ms of which 1 ms to minimize.
[2024-05-29 20:51:28] [INFO ] Deduced a trap composed of 18 places in 307 ms of which 0 ms to minimize.
[2024-05-29 20:51:29] [INFO ] Deduced a trap composed of 15 places in 281 ms of which 1 ms to minimize.
[2024-05-29 20:51:29] [INFO ] Deduced a trap composed of 20 places in 325 ms of which 1 ms to minimize.
[2024-05-29 20:51:29] [INFO ] Deduced a trap composed of 14 places in 267 ms of which 1 ms to minimize.
[2024-05-29 20:51:30] [INFO ] Deduced a trap composed of 23 places in 304 ms of which 1 ms to minimize.
[2024-05-29 20:51:30] [INFO ] Deduced a trap composed of 17 places in 296 ms of which 1 ms to minimize.
[2024-05-29 20:51:30] [INFO ] Deduced a trap composed of 19 places in 358 ms of which 1 ms to minimize.
[2024-05-29 20:51:31] [INFO ] Deduced a trap composed of 19 places in 339 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-05-29 20:51:31] [INFO ] Deduced a trap composed of 13 places in 382 ms of which 0 ms to minimize.
[2024-05-29 20:51:31] [INFO ] Deduced a trap composed of 27 places in 270 ms of which 1 ms to minimize.
[2024-05-29 20:51:32] [INFO ] Deduced a trap composed of 27 places in 277 ms of which 1 ms to minimize.
[2024-05-29 20:51:32] [INFO ] Deduced a trap composed of 21 places in 264 ms of which 0 ms to minimize.
[2024-05-29 20:51:32] [INFO ] Deduced a trap composed of 21 places in 259 ms of which 1 ms to minimize.
[2024-05-29 20:51:33] [INFO ] Deduced a trap composed of 20 places in 287 ms of which 1 ms to minimize.
[2024-05-29 20:51:33] [INFO ] Deduced a trap composed of 22 places in 248 ms of which 0 ms to minimize.
[2024-05-29 20:51:33] [INFO ] Deduced a trap composed of 24 places in 299 ms of which 1 ms to minimize.
[2024-05-29 20:51:33] [INFO ] Deduced a trap composed of 26 places in 300 ms of which 1 ms to minimize.
[2024-05-29 20:51:34] [INFO ] Deduced a trap composed of 22 places in 272 ms of which 0 ms to minimize.
[2024-05-29 20:51:34] [INFO ] Deduced a trap composed of 19 places in 288 ms of which 0 ms to minimize.
[2024-05-29 20:51:34] [INFO ] Deduced a trap composed of 15 places in 287 ms of which 1 ms to minimize.
[2024-05-29 20:51:35] [INFO ] Deduced a trap composed of 20 places in 268 ms of which 1 ms to minimize.
[2024-05-29 20:51:35] [INFO ] Deduced a trap composed of 21 places in 290 ms of which 2 ms to minimize.
[2024-05-29 20:51:35] [INFO ] Deduced a trap composed of 19 places in 238 ms of which 0 ms to minimize.
[2024-05-29 20:51:35] [INFO ] Deduced a trap composed of 22 places in 260 ms of which 1 ms to minimize.
[2024-05-29 20:51:36] [INFO ] Deduced a trap composed of 19 places in 280 ms of which 1 ms to minimize.
[2024-05-29 20:51:36] [INFO ] Deduced a trap composed of 18 places in 254 ms of which 0 ms to minimize.
[2024-05-29 20:51:36] [INFO ] Deduced a trap composed of 22 places in 263 ms of which 1 ms to minimize.
[2024-05-29 20:51:37] [INFO ] Deduced a trap composed of 22 places in 290 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-05-29 20:51:39] [INFO ] Deduced a trap composed of 20 places in 267 ms of which 1 ms to minimize.
[2024-05-29 20:51:39] [INFO ] Deduced a trap composed of 23 places in 259 ms of which 1 ms to minimize.
[2024-05-29 20:51:39] [INFO ] Deduced a trap composed of 21 places in 254 ms of which 1 ms to minimize.
[2024-05-29 20:51:40] [INFO ] Deduced a trap composed of 21 places in 260 ms of which 1 ms to minimize.
[2024-05-29 20:51:40] [INFO ] Deduced a trap composed of 19 places in 258 ms of which 1 ms to minimize.
[2024-05-29 20:51:40] [INFO ] Deduced a trap composed of 13 places in 284 ms of which 1 ms to minimize.
[2024-05-29 20:51:40] [INFO ] Deduced a trap composed of 21 places in 327 ms of which 1 ms to minimize.
[2024-05-29 20:51:41] [INFO ] Deduced a trap composed of 27 places in 263 ms of which 1 ms to minimize.
[2024-05-29 20:51:41] [INFO ] Deduced a trap composed of 22 places in 252 ms of which 6 ms to minimize.
[2024-05-29 20:51:41] [INFO ] Deduced a trap composed of 24 places in 239 ms of which 1 ms to minimize.
[2024-05-29 20:51:41] [INFO ] Deduced a trap composed of 22 places in 236 ms of which 1 ms to minimize.
[2024-05-29 20:51:42] [INFO ] Deduced a trap composed of 16 places in 235 ms of which 1 ms to minimize.
[2024-05-29 20:51:43] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 0 ms to minimize.
[2024-05-29 20:51:46] [INFO ] Deduced a trap composed of 19 places in 267 ms of which 1 ms to minimize.
[2024-05-29 20:51:46] [INFO ] Deduced a trap composed of 31 places in 264 ms of which 1 ms to minimize.
[2024-05-29 20:51:46] [INFO ] Deduced a trap composed of 22 places in 288 ms of which 1 ms to minimize.
[2024-05-29 20:51:47] [INFO ] Deduced a trap composed of 19 places in 309 ms of which 0 ms to minimize.
[2024-05-29 20:51:47] [INFO ] Deduced a trap composed of 12 places in 316 ms of which 1 ms to minimize.
[2024-05-29 20:51:47] [INFO ] Deduced a trap composed of 19 places in 338 ms of which 1 ms to minimize.
[2024-05-29 20:51:48] [INFO ] Deduced a trap composed of 27 places in 275 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-05-29 20:51:48] [INFO ] Deduced a trap composed of 19 places in 284 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 100/990 variables, and 63 constraints, problems are : Problem set: 0 solved, 882 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/100 constraints, ReadFeed: 0/263 constraints, PredecessorRefiner: 882/882 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 882 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-05-29 20:51:54] [INFO ] Deduced a trap composed of 14 places in 294 ms of which 0 ms to minimize.
[2024-05-29 20:51:54] [INFO ] Deduced a trap composed of 25 places in 292 ms of which 1 ms to minimize.
[2024-05-29 20:51:54] [INFO ] Deduced a trap composed of 25 places in 271 ms of which 1 ms to minimize.
[2024-05-29 20:51:55] [INFO ] Deduced a trap composed of 24 places in 274 ms of which 1 ms to minimize.
[2024-05-29 20:51:55] [INFO ] Deduced a trap composed of 23 places in 282 ms of which 1 ms to minimize.
[2024-05-29 20:51:55] [INFO ] Deduced a trap composed of 26 places in 260 ms of which 1 ms to minimize.
[2024-05-29 20:51:56] [INFO ] Deduced a trap composed of 21 places in 276 ms of which 1 ms to minimize.
[2024-05-29 20:51:56] [INFO ] Deduced a trap composed of 20 places in 272 ms of which 1 ms to minimize.
[2024-05-29 20:51:56] [INFO ] Deduced a trap composed of 26 places in 272 ms of which 0 ms to minimize.
[2024-05-29 20:51:56] [INFO ] Deduced a trap composed of 18 places in 251 ms of which 0 ms to minimize.
[2024-05-29 20:51:57] [INFO ] Deduced a trap composed of 20 places in 237 ms of which 1 ms to minimize.
[2024-05-29 20:51:57] [INFO ] Deduced a trap composed of 20 places in 225 ms of which 1 ms to minimize.
[2024-05-29 20:51:57] [INFO ] Deduced a trap composed of 20 places in 278 ms of which 0 ms to minimize.
[2024-05-29 20:51:57] [INFO ] Deduced a trap composed of 21 places in 252 ms of which 0 ms to minimize.
[2024-05-29 20:51:58] [INFO ] Deduced a trap composed of 20 places in 252 ms of which 1 ms to minimize.
[2024-05-29 20:51:58] [INFO ] Deduced a trap composed of 20 places in 237 ms of which 1 ms to minimize.
[2024-05-29 20:51:58] [INFO ] Deduced a trap composed of 21 places in 233 ms of which 1 ms to minimize.
[2024-05-29 20:51:58] [INFO ] Deduced a trap composed of 18 places in 252 ms of which 0 ms to minimize.
[2024-05-29 20:51:59] [INFO ] Deduced a trap composed of 18 places in 236 ms of which 0 ms to minimize.
[2024-05-29 20:51:59] [INFO ] Deduced a trap composed of 19 places in 228 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-05-29 20:51:59] [INFO ] Deduced a trap composed of 25 places in 289 ms of which 1 ms to minimize.
[2024-05-29 20:52:03] [INFO ] Deduced a trap composed of 23 places in 273 ms of which 1 ms to minimize.
[2024-05-29 20:52:04] [INFO ] Deduced a trap composed of 24 places in 259 ms of which 0 ms to minimize.
[2024-05-29 20:52:04] [INFO ] Deduced a trap composed of 19 places in 247 ms of which 1 ms to minimize.
[2024-05-29 20:52:04] [INFO ] Deduced a trap composed of 22 places in 245 ms of which 0 ms to minimize.
[2024-05-29 20:52:04] [INFO ] Deduced a trap composed of 22 places in 241 ms of which 0 ms to minimize.
[2024-05-29 20:52:05] [INFO ] Deduced a trap composed of 18 places in 231 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 7/90 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 6 (OVERLAPS) 889/989 variables, 100/190 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/989 variables, 262/452 constraints. Problems are: Problem set: 0 solved, 882 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 989/990 variables, and 1334 constraints, problems are : Problem set: 0 solved, 882 unsolved in 31706 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 262/263 constraints, PredecessorRefiner: 882/882 constraints, Known Traps: 88/88 constraints]
After SMT, in 69594ms problems are : Problem set: 0 solved, 882 unsolved
Search for dead transitions found 0 dead transitions in 69603ms
Starting structural reductions in SI_LTL mode, iteration 1 : 100/892 places, 898/14349 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72532 ms. Remains : 100/892 places, 898/14349 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-08b-LTLCardinality-09
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-08b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08b-LTLCardinality-09 finished in 72679 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G((p0&&F(p1)))||G(p1)||G(!p2)) U !p0))'
Support contains 6 out of 892 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 892/892 places, 14349/14349 transitions.
Graph (trivial) has 905 edges and 892 vertex of which 138 / 892 are part of one of the 24 SCC in 1 ms
Free SCC test removed 114 places
Ensure Unique test removed 130 transitions
Reduce isomorphic transitions removed 130 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 532 transitions
Trivial Post-agglo rules discarded 532 transitions
Performed 532 trivial Post agglomeration. Transition count delta: 532
Iterating post reduction 0 with 532 rules applied. Total rules applied 533 place count 777 transition count 13686
Reduce places removed 532 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 548 rules applied. Total rules applied 1081 place count 245 transition count 13670
Reduce places removed 8 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 12 rules applied. Total rules applied 1093 place count 237 transition count 13666
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1097 place count 233 transition count 13666
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 29 Pre rules applied. Total rules applied 1097 place count 233 transition count 13637
Deduced a syphon composed of 29 places in 7 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 1155 place count 204 transition count 13637
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1166 place count 193 transition count 13625
Iterating global reduction 4 with 11 rules applied. Total rules applied 1177 place count 193 transition count 13625
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1177 place count 193 transition count 13623
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1181 place count 191 transition count 13623
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1183 place count 189 transition count 11434
Iterating global reduction 4 with 2 rules applied. Total rules applied 1185 place count 189 transition count 11434
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1186 place count 189 transition count 11433
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1187 place count 188 transition count 11431
Iterating global reduction 5 with 1 rules applied. Total rules applied 1188 place count 188 transition count 11431
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 1256 place count 154 transition count 11397
Discarding 28 places :
Symmetric choice reduction at 5 with 28 rule applications. Total rules 1284 place count 126 transition count 955
Iterating global reduction 5 with 28 rules applied. Total rules applied 1312 place count 126 transition count 955
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 1325 place count 126 transition count 942
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1331 place count 120 transition count 930
Iterating global reduction 6 with 6 rules applied. Total rules applied 1337 place count 120 transition count 930
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1343 place count 114 transition count 918
Iterating global reduction 6 with 6 rules applied. Total rules applied 1349 place count 114 transition count 918
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 1375 place count 101 transition count 925
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1376 place count 100 transition count 907
Iterating global reduction 6 with 1 rules applied. Total rules applied 1377 place count 100 transition count 907
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1378 place count 100 transition count 906
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1386 place count 100 transition count 898
Applied a total of 1386 rules in 1582 ms. Remains 100 /892 variables (removed 792) and now considering 898/14349 (removed 13451) transitions.
[2024-05-29 20:52:25] [INFO ] Flow matrix only has 888 transitions (discarded 10 similar events)
// Phase 1: matrix 888 rows 100 cols
[2024-05-29 20:52:25] [INFO ] Computed 2 invariants in 8 ms
[2024-05-29 20:52:25] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-05-29 20:52:25] [INFO ] Flow matrix only has 888 transitions (discarded 10 similar events)
[2024-05-29 20:52:25] [INFO ] Invariant cache hit.
[2024-05-29 20:52:25] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-29 20:52:26] [INFO ] Implicit Places using invariants and state equation in 787 ms returned []
Implicit Place search using SMT with State Equation took 1039 ms to find 0 implicit places.
[2024-05-29 20:52:26] [INFO ] Redundant transitions in 13 ms returned []
Running 881 sub problems to find dead transitions.
[2024-05-29 20:52:26] [INFO ] Flow matrix only has 888 transitions (discarded 10 similar events)
[2024-05-29 20:52:26] [INFO ] Invariant cache hit.
[2024-05-29 20:52:26] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 881 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 881 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 881 unsolved
[2024-05-29 20:52:37] [INFO ] Deduced a trap composed of 18 places in 286 ms of which 1 ms to minimize.
[2024-05-29 20:52:37] [INFO ] Deduced a trap composed of 13 places in 270 ms of which 1 ms to minimize.
[2024-05-29 20:52:37] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 0 ms to minimize.
[2024-05-29 20:52:38] [INFO ] Deduced a trap composed of 21 places in 239 ms of which 1 ms to minimize.
[2024-05-29 20:52:38] [INFO ] Deduced a trap composed of 21 places in 291 ms of which 1 ms to minimize.
[2024-05-29 20:52:38] [INFO ] Deduced a trap composed of 21 places in 242 ms of which 1 ms to minimize.
[2024-05-29 20:52:38] [INFO ] Deduced a trap composed of 15 places in 238 ms of which 1 ms to minimize.
[2024-05-29 20:52:39] [INFO ] Deduced a trap composed of 15 places in 245 ms of which 1 ms to minimize.
[2024-05-29 20:52:39] [INFO ] Deduced a trap composed of 19 places in 266 ms of which 1 ms to minimize.
[2024-05-29 20:52:39] [INFO ] Deduced a trap composed of 21 places in 244 ms of which 0 ms to minimize.
[2024-05-29 20:52:40] [INFO ] Deduced a trap composed of 24 places in 230 ms of which 1 ms to minimize.
[2024-05-29 20:52:40] [INFO ] Deduced a trap composed of 13 places in 237 ms of which 1 ms to minimize.
[2024-05-29 20:52:40] [INFO ] Deduced a trap composed of 19 places in 386 ms of which 0 ms to minimize.
[2024-05-29 20:52:40] [INFO ] Deduced a trap composed of 18 places in 234 ms of which 0 ms to minimize.
[2024-05-29 20:52:41] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 1 ms to minimize.
[2024-05-29 20:52:41] [INFO ] Deduced a trap composed of 19 places in 232 ms of which 0 ms to minimize.
[2024-05-29 20:52:41] [INFO ] Deduced a trap composed of 22 places in 224 ms of which 0 ms to minimize.
[2024-05-29 20:52:41] [INFO ] Deduced a trap composed of 19 places in 277 ms of which 1 ms to minimize.
[2024-05-29 20:52:42] [INFO ] Deduced a trap composed of 20 places in 240 ms of which 1 ms to minimize.
[2024-05-29 20:52:42] [INFO ] Deduced a trap composed of 12 places in 235 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 881 unsolved
[2024-05-29 20:52:44] [INFO ] Deduced a trap composed of 19 places in 268 ms of which 1 ms to minimize.
[2024-05-29 20:52:44] [INFO ] Deduced a trap composed of 24 places in 237 ms of which 1 ms to minimize.
[2024-05-29 20:52:45] [INFO ] Deduced a trap composed of 26 places in 228 ms of which 1 ms to minimize.
[2024-05-29 20:52:45] [INFO ] Deduced a trap composed of 22 places in 215 ms of which 0 ms to minimize.
[2024-05-29 20:52:45] [INFO ] Deduced a trap composed of 22 places in 248 ms of which 1 ms to minimize.
[2024-05-29 20:52:45] [INFO ] Deduced a trap composed of 20 places in 225 ms of which 0 ms to minimize.
[2024-05-29 20:52:46] [INFO ] Deduced a trap composed of 19 places in 224 ms of which 1 ms to minimize.
[2024-05-29 20:52:46] [INFO ] Deduced a trap composed of 21 places in 237 ms of which 1 ms to minimize.
[2024-05-29 20:52:46] [INFO ] Deduced a trap composed of 17 places in 232 ms of which 1 ms to minimize.
[2024-05-29 20:52:46] [INFO ] Deduced a trap composed of 18 places in 242 ms of which 0 ms to minimize.
[2024-05-29 20:52:47] [INFO ] Deduced a trap composed of 18 places in 231 ms of which 0 ms to minimize.
[2024-05-29 20:52:47] [INFO ] Deduced a trap composed of 14 places in 220 ms of which 1 ms to minimize.
[2024-05-29 20:52:48] [INFO ] Deduced a trap composed of 25 places in 280 ms of which 1 ms to minimize.
[2024-05-29 20:52:48] [INFO ] Deduced a trap composed of 23 places in 251 ms of which 1 ms to minimize.
[2024-05-29 20:52:48] [INFO ] Deduced a trap composed of 23 places in 271 ms of which 3 ms to minimize.
[2024-05-29 20:52:48] [INFO ] Deduced a trap composed of 18 places in 260 ms of which 0 ms to minimize.
[2024-05-29 20:52:49] [INFO ] Deduced a trap composed of 19 places in 236 ms of which 1 ms to minimize.
[2024-05-29 20:52:49] [INFO ] Deduced a trap composed of 23 places in 240 ms of which 1 ms to minimize.
[2024-05-29 20:52:49] [INFO ] Deduced a trap composed of 24 places in 236 ms of which 0 ms to minimize.
[2024-05-29 20:52:49] [INFO ] Deduced a trap composed of 19 places in 231 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 881 unsolved
[2024-05-29 20:52:50] [INFO ] Deduced a trap composed of 24 places in 271 ms of which 1 ms to minimize.
[2024-05-29 20:52:50] [INFO ] Deduced a trap composed of 29 places in 306 ms of which 1 ms to minimize.
[2024-05-29 20:52:51] [INFO ] Deduced a trap composed of 23 places in 256 ms of which 0 ms to minimize.
[2024-05-29 20:52:51] [INFO ] Deduced a trap composed of 19 places in 247 ms of which 1 ms to minimize.
[2024-05-29 20:52:51] [INFO ] Deduced a trap composed of 21 places in 242 ms of which 0 ms to minimize.
[2024-05-29 20:52:51] [INFO ] Deduced a trap composed of 19 places in 236 ms of which 0 ms to minimize.
[2024-05-29 20:52:54] [INFO ] Deduced a trap composed of 18 places in 232 ms of which 0 ms to minimize.
[2024-05-29 20:52:55] [INFO ] Deduced a trap composed of 21 places in 225 ms of which 1 ms to minimize.
[2024-05-29 20:52:56] [INFO ] Deduced a trap composed of 19 places in 237 ms of which 1 ms to minimize.
[2024-05-29 20:52:56] [INFO ] Deduced a trap composed of 22 places in 220 ms of which 1 ms to minimize.
[2024-05-29 20:52:56] [INFO ] Deduced a trap composed of 21 places in 241 ms of which 1 ms to minimize.
[2024-05-29 20:52:56] [INFO ] Deduced a trap composed of 23 places in 270 ms of which 3 ms to minimize.
[2024-05-29 20:52:57] [INFO ] Deduced a trap composed of 22 places in 258 ms of which 0 ms to minimize.
[2024-05-29 20:52:57] [INFO ] Deduced a trap composed of 19 places in 220 ms of which 1 ms to minimize.
[2024-05-29 20:52:57] [INFO ] Deduced a trap composed of 25 places in 276 ms of which 0 ms to minimize.
[2024-05-29 20:52:57] [INFO ] Deduced a trap composed of 21 places in 231 ms of which 1 ms to minimize.
[2024-05-29 20:52:58] [INFO ] Deduced a trap composed of 19 places in 213 ms of which 0 ms to minimize.
[2024-05-29 20:52:58] [INFO ] Deduced a trap composed of 19 places in 237 ms of which 1 ms to minimize.
[2024-05-29 20:52:58] [INFO ] Deduced a trap composed of 22 places in 223 ms of which 3 ms to minimize.
[2024-05-29 20:52:58] [INFO ] Deduced a trap composed of 19 places in 237 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 881 unsolved
[2024-05-29 20:53:00] [INFO ] Deduced a trap composed of 19 places in 233 ms of which 1 ms to minimize.
[2024-05-29 20:53:03] [INFO ] Deduced a trap composed of 22 places in 240 ms of which 1 ms to minimize.
[2024-05-29 20:53:03] [INFO ] Deduced a trap composed of 27 places in 255 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 881 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 100/988 variables, and 65 constraints, problems are : Problem set: 0 solved, 881 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/100 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 881/881 constraints, Known Traps: 63/63 constraints]
Escalating to Integer solving :Problem set: 0 solved, 881 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 881 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 881 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 881 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 881 unsolved
[2024-05-29 20:53:07] [INFO ] Deduced a trap composed of 21 places in 245 ms of which 1 ms to minimize.
[2024-05-29 20:53:07] [INFO ] Deduced a trap composed of 24 places in 231 ms of which 1 ms to minimize.
[2024-05-29 20:53:07] [INFO ] Deduced a trap composed of 20 places in 228 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 881 unsolved
[2024-05-29 20:53:14] [INFO ] Deduced a trap composed of 23 places in 264 ms of which 0 ms to minimize.
[2024-05-29 20:53:15] [INFO ] Deduced a trap composed of 20 places in 263 ms of which 1 ms to minimize.
[2024-05-29 20:53:15] [INFO ] Deduced a trap composed of 21 places in 272 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 881 unsolved
[2024-05-29 20:53:19] [INFO ] Deduced a trap composed of 20 places in 220 ms of which 0 ms to minimize.
[2024-05-29 20:53:19] [INFO ] Deduced a trap composed of 23 places in 251 ms of which 0 ms to minimize.
[2024-05-29 20:53:20] [INFO ] Deduced a trap composed of 22 places in 264 ms of which 0 ms to minimize.
[2024-05-29 20:53:20] [INFO ] Deduced a trap composed of 21 places in 278 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 881 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 881 unsolved
At refinement iteration 8 (OVERLAPS) 887/987 variables, 100/175 constraints. Problems are: Problem set: 0 solved, 881 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/987 variables, 254/429 constraints. Problems are: Problem set: 0 solved, 881 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 987/988 variables, and 1310 constraints, problems are : Problem set: 0 solved, 881 unsolved in 31874 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 254/255 constraints, PredecessorRefiner: 881/881 constraints, Known Traps: 73/73 constraints]
After SMT, in 69483ms problems are : Problem set: 0 solved, 881 unsolved
Search for dead transitions found 0 dead transitions in 69491ms
Starting structural reductions in SI_LTL mode, iteration 1 : 100/892 places, 898/14349 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72131 ms. Remains : 100/892 places, 898/14349 transitions.
Stuttering acceptance computed with spot in 276 ms :[p0, (OR p0 (AND (NOT p1) p2)), (AND p2 (NOT p1)), true, (OR p0 p2), (OR (NOT p1) p0), p2, (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-08b-LTLCardinality-10
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-08b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08b-LTLCardinality-10 finished in 72431 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 892 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 892/892 places, 14349/14349 transitions.
Graph (trivial) has 911 edges and 892 vertex of which 138 / 892 are part of one of the 24 SCC in 1 ms
Free SCC test removed 114 places
Ensure Unique test removed 130 transitions
Reduce isomorphic transitions removed 130 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 538 transitions
Trivial Post-agglo rules discarded 538 transitions
Performed 538 trivial Post agglomeration. Transition count delta: 538
Iterating post reduction 0 with 538 rules applied. Total rules applied 539 place count 777 transition count 13680
Reduce places removed 538 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 554 rules applied. Total rules applied 1093 place count 239 transition count 13664
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 1103 place count 231 transition count 13662
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1105 place count 229 transition count 13662
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 29 Pre rules applied. Total rules applied 1105 place count 229 transition count 13633
Deduced a syphon composed of 29 places in 6 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 1163 place count 200 transition count 13633
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1174 place count 189 transition count 13621
Iterating global reduction 4 with 11 rules applied. Total rules applied 1185 place count 189 transition count 13621
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1185 place count 189 transition count 13619
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1189 place count 187 transition count 13619
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1191 place count 185 transition count 11430
Iterating global reduction 4 with 2 rules applied. Total rules applied 1193 place count 185 transition count 11430
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1194 place count 185 transition count 11429
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1195 place count 184 transition count 11427
Iterating global reduction 5 with 1 rules applied. Total rules applied 1196 place count 184 transition count 11427
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 1270 place count 147 transition count 11390
Discarding 30 places :
Symmetric choice reduction at 5 with 30 rule applications. Total rules 1300 place count 117 transition count 945
Iterating global reduction 5 with 30 rules applied. Total rules applied 1330 place count 117 transition count 945
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 1345 place count 117 transition count 930
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1352 place count 110 transition count 916
Iterating global reduction 6 with 7 rules applied. Total rules applied 1359 place count 110 transition count 916
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1366 place count 103 transition count 902
Iterating global reduction 6 with 7 rules applied. Total rules applied 1373 place count 103 transition count 902
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1397 place count 91 transition count 909
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1398 place count 90 transition count 893
Iterating global reduction 6 with 1 rules applied. Total rules applied 1399 place count 90 transition count 893
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1400 place count 90 transition count 892
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1408 place count 90 transition count 884
Applied a total of 1408 rules in 1559 ms. Remains 90 /892 variables (removed 802) and now considering 884/14349 (removed 13465) transitions.
[2024-05-29 20:53:37] [INFO ] Flow matrix only has 875 transitions (discarded 9 similar events)
// Phase 1: matrix 875 rows 90 cols
[2024-05-29 20:53:37] [INFO ] Computed 2 invariants in 13 ms
[2024-05-29 20:53:37] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-29 20:53:37] [INFO ] Flow matrix only has 875 transitions (discarded 9 similar events)
[2024-05-29 20:53:37] [INFO ] Invariant cache hit.
[2024-05-29 20:53:38] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-29 20:53:38] [INFO ] Implicit Places using invariants and state equation in 962 ms returned []
Implicit Place search using SMT with State Equation took 1233 ms to find 0 implicit places.
[2024-05-29 20:53:38] [INFO ] Redundant transitions in 15 ms returned []
Running 867 sub problems to find dead transitions.
[2024-05-29 20:53:38] [INFO ] Flow matrix only has 875 transitions (discarded 9 similar events)
[2024-05-29 20:53:38] [INFO ] Invariant cache hit.
[2024-05-29 20:53:38] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 867 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 867 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 867 unsolved
[2024-05-29 20:53:50] [INFO ] Deduced a trap composed of 15 places in 270 ms of which 0 ms to minimize.
[2024-05-29 20:53:51] [INFO ] Deduced a trap composed of 24 places in 265 ms of which 0 ms to minimize.
[2024-05-29 20:53:51] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 0 ms to minimize.
[2024-05-29 20:53:51] [INFO ] Deduced a trap composed of 12 places in 254 ms of which 1 ms to minimize.
[2024-05-29 20:53:51] [INFO ] Deduced a trap composed of 12 places in 260 ms of which 1 ms to minimize.
[2024-05-29 20:53:52] [INFO ] Deduced a trap composed of 12 places in 414 ms of which 0 ms to minimize.
[2024-05-29 20:53:52] [INFO ] Deduced a trap composed of 19 places in 257 ms of which 1 ms to minimize.
[2024-05-29 20:53:52] [INFO ] Deduced a trap composed of 18 places in 239 ms of which 1 ms to minimize.
[2024-05-29 20:53:53] [INFO ] Deduced a trap composed of 18 places in 253 ms of which 1 ms to minimize.
[2024-05-29 20:53:53] [INFO ] Deduced a trap composed of 14 places in 248 ms of which 1 ms to minimize.
[2024-05-29 20:53:53] [INFO ] Deduced a trap composed of 20 places in 266 ms of which 1 ms to minimize.
[2024-05-29 20:53:53] [INFO ] Deduced a trap composed of 21 places in 258 ms of which 0 ms to minimize.
[2024-05-29 20:53:54] [INFO ] Deduced a trap composed of 19 places in 255 ms of which 1 ms to minimize.
[2024-05-29 20:53:54] [INFO ] Deduced a trap composed of 20 places in 323 ms of which 0 ms to minimize.
[2024-05-29 20:53:54] [INFO ] Deduced a trap composed of 13 places in 267 ms of which 1 ms to minimize.
[2024-05-29 20:53:55] [INFO ] Deduced a trap composed of 18 places in 265 ms of which 0 ms to minimize.
[2024-05-29 20:53:55] [INFO ] Deduced a trap composed of 19 places in 254 ms of which 1 ms to minimize.
[2024-05-29 20:53:55] [INFO ] Deduced a trap composed of 20 places in 269 ms of which 1 ms to minimize.
[2024-05-29 20:53:55] [INFO ] Deduced a trap composed of 18 places in 250 ms of which 1 ms to minimize.
[2024-05-29 20:53:56] [INFO ] Deduced a trap composed of 18 places in 240 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 867 unsolved
[2024-05-29 20:53:58] [INFO ] Deduced a trap composed of 19 places in 254 ms of which 1 ms to minimize.
[2024-05-29 20:53:58] [INFO ] Deduced a trap composed of 18 places in 240 ms of which 1 ms to minimize.
[2024-05-29 20:53:58] [INFO ] Deduced a trap composed of 20 places in 234 ms of which 1 ms to minimize.
[2024-05-29 20:53:58] [INFO ] Deduced a trap composed of 18 places in 226 ms of which 1 ms to minimize.
[2024-05-29 20:53:59] [INFO ] Deduced a trap composed of 20 places in 223 ms of which 1 ms to minimize.
[2024-05-29 20:53:59] [INFO ] Deduced a trap composed of 13 places in 236 ms of which 1 ms to minimize.
[2024-05-29 20:53:59] [INFO ] Deduced a trap composed of 20 places in 236 ms of which 0 ms to minimize.
[2024-05-29 20:53:59] [INFO ] Deduced a trap composed of 18 places in 234 ms of which 0 ms to minimize.
[2024-05-29 20:53:59] [INFO ] Deduced a trap composed of 19 places in 228 ms of which 0 ms to minimize.
[2024-05-29 20:54:00] [INFO ] Deduced a trap composed of 18 places in 218 ms of which 1 ms to minimize.
[2024-05-29 20:54:00] [INFO ] Deduced a trap composed of 18 places in 231 ms of which 1 ms to minimize.
[2024-05-29 20:54:00] [INFO ] Deduced a trap composed of 18 places in 203 ms of which 1 ms to minimize.
[2024-05-29 20:54:00] [INFO ] Deduced a trap composed of 14 places in 239 ms of which 0 ms to minimize.
[2024-05-29 20:54:01] [INFO ] Deduced a trap composed of 21 places in 238 ms of which 1 ms to minimize.
[2024-05-29 20:54:01] [INFO ] Deduced a trap composed of 18 places in 235 ms of which 1 ms to minimize.
[2024-05-29 20:54:02] [INFO ] Deduced a trap composed of 12 places in 199 ms of which 1 ms to minimize.
[2024-05-29 20:54:05] [INFO ] Deduced a trap composed of 20 places in 237 ms of which 0 ms to minimize.
[2024-05-29 20:54:05] [INFO ] Deduced a trap composed of 18 places in 268 ms of which 1 ms to minimize.
[2024-05-29 20:54:05] [INFO ] Deduced a trap composed of 22 places in 243 ms of which 1 ms to minimize.
[2024-05-29 20:54:05] [INFO ] Deduced a trap composed of 19 places in 247 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 867 unsolved
[2024-05-29 20:54:06] [INFO ] Deduced a trap composed of 22 places in 290 ms of which 1 ms to minimize.
[2024-05-29 20:54:06] [INFO ] Deduced a trap composed of 26 places in 262 ms of which 0 ms to minimize.
[2024-05-29 20:54:07] [INFO ] Deduced a trap composed of 24 places in 252 ms of which 1 ms to minimize.
[2024-05-29 20:54:07] [INFO ] Deduced a trap composed of 19 places in 242 ms of which 1 ms to minimize.
[2024-05-29 20:54:07] [INFO ] Deduced a trap composed of 20 places in 242 ms of which 0 ms to minimize.
[2024-05-29 20:54:07] [INFO ] Deduced a trap composed of 19 places in 252 ms of which 1 ms to minimize.
[2024-05-29 20:54:08] [INFO ] Deduced a trap composed of 20 places in 251 ms of which 0 ms to minimize.
[2024-05-29 20:54:08] [INFO ] Deduced a trap composed of 19 places in 245 ms of which 0 ms to minimize.
[2024-05-29 20:54:08] [INFO ] Deduced a trap composed of 20 places in 248 ms of which 1 ms to minimize.
[2024-05-29 20:54:08] [INFO ] Deduced a trap composed of 18 places in 228 ms of which 1 ms to minimize.
[2024-05-29 20:54:09] [INFO ] Deduced a trap composed of 20 places in 245 ms of which 1 ms to minimize.
[2024-05-29 20:54:09] [INFO ] Deduced a trap composed of 20 places in 236 ms of which 0 ms to minimize.
[2024-05-29 20:54:12] [INFO ] Deduced a trap composed of 19 places in 233 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 867 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 867 unsolved
SMT process timed out in 38273ms, After SMT, problems are : Problem set: 0 solved, 867 unsolved
Search for dead transitions found 0 dead transitions in 38283ms
Starting structural reductions in SI_LTL mode, iteration 1 : 90/892 places, 884/14349 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41096 ms. Remains : 90/892 places, 884/14349 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-08b-LTLCardinality-11
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-08b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08b-LTLCardinality-11 finished in 41157 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(F(p1)))))'
Support contains 4 out of 892 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 892/892 places, 14349/14349 transitions.
Graph (trivial) has 907 edges and 892 vertex of which 138 / 892 are part of one of the 24 SCC in 2 ms
Free SCC test removed 114 places
Ensure Unique test removed 130 transitions
Reduce isomorphic transitions removed 130 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 535 transitions
Trivial Post-agglo rules discarded 535 transitions
Performed 535 trivial Post agglomeration. Transition count delta: 535
Iterating post reduction 0 with 535 rules applied. Total rules applied 536 place count 777 transition count 13683
Reduce places removed 535 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 551 rules applied. Total rules applied 1087 place count 242 transition count 13667
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 1097 place count 234 transition count 13665
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1099 place count 232 transition count 13665
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 30 Pre rules applied. Total rules applied 1099 place count 232 transition count 13635
Deduced a syphon composed of 30 places in 7 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 1159 place count 202 transition count 13635
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1169 place count 192 transition count 13625
Iterating global reduction 4 with 10 rules applied. Total rules applied 1179 place count 192 transition count 13625
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1179 place count 192 transition count 13623
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1183 place count 190 transition count 13623
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1184 place count 189 transition count 11436
Iterating global reduction 4 with 1 rules applied. Total rules applied 1185 place count 189 transition count 11436
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1186 place count 189 transition count 11435
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 3 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 1252 place count 156 transition count 11402
Discarding 28 places :
Symmetric choice reduction at 5 with 28 rule applications. Total rules 1280 place count 128 transition count 959
Iterating global reduction 5 with 28 rules applied. Total rules applied 1308 place count 128 transition count 959
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 1323 place count 128 transition count 944
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1330 place count 121 transition count 930
Iterating global reduction 6 with 7 rules applied. Total rules applied 1337 place count 121 transition count 930
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1344 place count 114 transition count 916
Iterating global reduction 6 with 7 rules applied. Total rules applied 1351 place count 114 transition count 916
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 1377 place count 101 transition count 923
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1378 place count 100 transition count 905
Iterating global reduction 6 with 1 rules applied. Total rules applied 1379 place count 100 transition count 905
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1380 place count 100 transition count 904
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1388 place count 100 transition count 896
Applied a total of 1388 rules in 1516 ms. Remains 100 /892 variables (removed 792) and now considering 896/14349 (removed 13453) transitions.
[2024-05-29 20:54:18] [INFO ] Flow matrix only has 886 transitions (discarded 10 similar events)
// Phase 1: matrix 886 rows 100 cols
[2024-05-29 20:54:18] [INFO ] Computed 2 invariants in 17 ms
[2024-05-29 20:54:18] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-29 20:54:18] [INFO ] Flow matrix only has 886 transitions (discarded 10 similar events)
[2024-05-29 20:54:18] [INFO ] Invariant cache hit.
[2024-05-29 20:54:19] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-29 20:54:19] [INFO ] Implicit Places using invariants and state equation in 835 ms returned []
Implicit Place search using SMT with State Equation took 1107 ms to find 0 implicit places.
[2024-05-29 20:54:19] [INFO ] Redundant transitions in 15 ms returned []
Running 879 sub problems to find dead transitions.
[2024-05-29 20:54:19] [INFO ] Flow matrix only has 886 transitions (discarded 10 similar events)
[2024-05-29 20:54:19] [INFO ] Invariant cache hit.
[2024-05-29 20:54:19] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 879 unsolved
[2024-05-29 20:54:31] [INFO ] Deduced a trap composed of 13 places in 298 ms of which 1 ms to minimize.
[2024-05-29 20:54:31] [INFO ] Deduced a trap composed of 19 places in 273 ms of which 0 ms to minimize.
[2024-05-29 20:54:32] [INFO ] Deduced a trap composed of 16 places in 255 ms of which 1 ms to minimize.
[2024-05-29 20:54:32] [INFO ] Deduced a trap composed of 19 places in 257 ms of which 1 ms to minimize.
[2024-05-29 20:54:32] [INFO ] Deduced a trap composed of 13 places in 239 ms of which 0 ms to minimize.
[2024-05-29 20:54:33] [INFO ] Deduced a trap composed of 12 places in 243 ms of which 1 ms to minimize.
[2024-05-29 20:54:33] [INFO ] Deduced a trap composed of 13 places in 243 ms of which 1 ms to minimize.
[2024-05-29 20:54:33] [INFO ] Deduced a trap composed of 14 places in 240 ms of which 0 ms to minimize.
[2024-05-29 20:54:33] [INFO ] Deduced a trap composed of 19 places in 241 ms of which 1 ms to minimize.
[2024-05-29 20:54:33] [INFO ] Deduced a trap composed of 21 places in 239 ms of which 1 ms to minimize.
[2024-05-29 20:54:34] [INFO ] Deduced a trap composed of 23 places in 245 ms of which 1 ms to minimize.
[2024-05-29 20:54:34] [INFO ] Deduced a trap composed of 25 places in 233 ms of which 1 ms to minimize.
[2024-05-29 20:54:34] [INFO ] Deduced a trap composed of 20 places in 217 ms of which 1 ms to minimize.
[2024-05-29 20:54:34] [INFO ] Deduced a trap composed of 12 places in 228 ms of which 1 ms to minimize.
[2024-05-29 20:54:35] [INFO ] Deduced a trap composed of 20 places in 272 ms of which 1 ms to minimize.
[2024-05-29 20:54:35] [INFO ] Deduced a trap composed of 22 places in 264 ms of which 0 ms to minimize.
[2024-05-29 20:54:35] [INFO ] Deduced a trap composed of 22 places in 245 ms of which 1 ms to minimize.
[2024-05-29 20:54:36] [INFO ] Deduced a trap composed of 16 places in 238 ms of which 1 ms to minimize.
[2024-05-29 20:54:36] [INFO ] Deduced a trap composed of 23 places in 240 ms of which 1 ms to minimize.
[2024-05-29 20:54:36] [INFO ] Deduced a trap composed of 25 places in 231 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 879 unsolved
[2024-05-29 20:54:38] [INFO ] Deduced a trap composed of 22 places in 310 ms of which 0 ms to minimize.
[2024-05-29 20:54:39] [INFO ] Deduced a trap composed of 27 places in 265 ms of which 0 ms to minimize.
[2024-05-29 20:54:39] [INFO ] Deduced a trap composed of 25 places in 260 ms of which 0 ms to minimize.
[2024-05-29 20:54:39] [INFO ] Deduced a trap composed of 22 places in 261 ms of which 1 ms to minimize.
[2024-05-29 20:54:39] [INFO ] Deduced a trap composed of 19 places in 250 ms of which 1 ms to minimize.
[2024-05-29 20:54:40] [INFO ] Deduced a trap composed of 28 places in 236 ms of which 1 ms to minimize.
[2024-05-29 20:54:40] [INFO ] Deduced a trap composed of 19 places in 234 ms of which 0 ms to minimize.
[2024-05-29 20:54:40] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 0 ms to minimize.
[2024-05-29 20:54:40] [INFO ] Deduced a trap composed of 20 places in 234 ms of which 0 ms to minimize.
[2024-05-29 20:54:41] [INFO ] Deduced a trap composed of 19 places in 227 ms of which 1 ms to minimize.
[2024-05-29 20:54:41] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 1 ms to minimize.
[2024-05-29 20:54:45] [INFO ] Deduced a trap composed of 19 places in 245 ms of which 0 ms to minimize.
[2024-05-29 20:54:45] [INFO ] Deduced a trap composed of 19 places in 253 ms of which 0 ms to minimize.
[2024-05-29 20:54:45] [INFO ] Deduced a trap composed of 20 places in 262 ms of which 1 ms to minimize.
[2024-05-29 20:54:45] [INFO ] Deduced a trap composed of 20 places in 264 ms of which 0 ms to minimize.
[2024-05-29 20:54:46] [INFO ] Deduced a trap composed of 18 places in 254 ms of which 1 ms to minimize.
[2024-05-29 20:54:46] [INFO ] Deduced a trap composed of 18 places in 240 ms of which 1 ms to minimize.
[2024-05-29 20:54:46] [INFO ] Deduced a trap composed of 20 places in 265 ms of which 1 ms to minimize.
[2024-05-29 20:54:46] [INFO ] Deduced a trap composed of 18 places in 243 ms of which 1 ms to minimize.
[2024-05-29 20:54:47] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 879 unsolved
[2024-05-29 20:54:47] [INFO ] Deduced a trap composed of 22 places in 268 ms of which 1 ms to minimize.
[2024-05-29 20:54:47] [INFO ] Deduced a trap composed of 20 places in 268 ms of which 1 ms to minimize.
[2024-05-29 20:54:48] [INFO ] Deduced a trap composed of 22 places in 269 ms of which 0 ms to minimize.
[2024-05-29 20:54:48] [INFO ] Deduced a trap composed of 22 places in 288 ms of which 0 ms to minimize.
[2024-05-29 20:54:48] [INFO ] Deduced a trap composed of 21 places in 248 ms of which 1 ms to minimize.
[2024-05-29 20:54:49] [INFO ] Deduced a trap composed of 19 places in 240 ms of which 0 ms to minimize.
[2024-05-29 20:54:49] [INFO ] Deduced a trap composed of 23 places in 229 ms of which 0 ms to minimize.
[2024-05-29 20:54:49] [INFO ] Deduced a trap composed of 21 places in 248 ms of which 0 ms to minimize.
[2024-05-29 20:54:49] [INFO ] Deduced a trap composed of 20 places in 236 ms of which 1 ms to minimize.
[2024-05-29 20:54:50] [INFO ] Deduced a trap composed of 19 places in 229 ms of which 1 ms to minimize.
[2024-05-29 20:54:53] [INFO ] Deduced a trap composed of 23 places in 253 ms of which 0 ms to minimize.
[2024-05-29 20:54:54] [INFO ] Deduced a trap composed of 22 places in 245 ms of which 0 ms to minimize.
[2024-05-29 20:54:54] [INFO ] Deduced a trap composed of 19 places in 229 ms of which 1 ms to minimize.
[2024-05-29 20:54:54] [INFO ] Deduced a trap composed of 19 places in 222 ms of which 2 ms to minimize.
[2024-05-29 20:54:54] [INFO ] Deduced a trap composed of 20 places in 277 ms of which 0 ms to minimize.
[2024-05-29 20:54:55] [INFO ] Deduced a trap composed of 20 places in 252 ms of which 0 ms to minimize.
[2024-05-29 20:54:55] [INFO ] Deduced a trap composed of 29 places in 251 ms of which 1 ms to minimize.
[2024-05-29 20:54:55] [INFO ] Deduced a trap composed of 20 places in 239 ms of which 0 ms to minimize.
[2024-05-29 20:54:55] [INFO ] Deduced a trap composed of 20 places in 224 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 879 unsolved
[2024-05-29 20:54:56] [INFO ] Deduced a trap composed of 25 places in 299 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 100/986 variables, and 62 constraints, problems are : Problem set: 0 solved, 879 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/100 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 879/879 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 879 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 879 unsolved
[2024-05-29 20:55:00] [INFO ] Deduced a trap composed of 27 places in 243 ms of which 1 ms to minimize.
[2024-05-29 20:55:00] [INFO ] Deduced a trap composed of 23 places in 229 ms of which 0 ms to minimize.
[2024-05-29 20:55:04] [INFO ] Deduced a trap composed of 21 places in 253 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 879 unsolved
[2024-05-29 20:55:04] [INFO ] Deduced a trap composed of 21 places in 237 ms of which 0 ms to minimize.
[2024-05-29 20:55:05] [INFO ] Deduced a trap composed of 21 places in 243 ms of which 1 ms to minimize.
[2024-05-29 20:55:05] [INFO ] Deduced a trap composed of 23 places in 259 ms of which 1 ms to minimize.
[2024-05-29 20:55:05] [INFO ] Deduced a trap composed of 20 places in 260 ms of which 1 ms to minimize.
[2024-05-29 20:55:05] [INFO ] Deduced a trap composed of 23 places in 246 ms of which 1 ms to minimize.
[2024-05-29 20:55:09] [INFO ] Deduced a trap composed of 18 places in 257 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 879 unsolved
[2024-05-29 20:55:10] [INFO ] Deduced a trap composed of 18 places in 256 ms of which 1 ms to minimize.
[2024-05-29 20:55:10] [INFO ] Deduced a trap composed of 18 places in 242 ms of which 1 ms to minimize.
[2024-05-29 20:55:10] [INFO ] Deduced a trap composed of 20 places in 238 ms of which 0 ms to minimize.
[2024-05-29 20:55:11] [INFO ] Deduced a trap composed of 19 places in 237 ms of which 1 ms to minimize.
[2024-05-29 20:55:11] [INFO ] Deduced a trap composed of 18 places in 236 ms of which 1 ms to minimize.
[2024-05-29 20:55:11] [INFO ] Deduced a trap composed of 20 places in 229 ms of which 1 ms to minimize.
[2024-05-29 20:55:15] [INFO ] Deduced a trap composed of 22 places in 298 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 7/78 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 8 (OVERLAPS) 885/985 variables, 100/178 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/985 variables, 254/432 constraints. Problems are: Problem set: 0 solved, 879 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 985/986 variables, and 1311 constraints, problems are : Problem set: 0 solved, 879 unsolved in 32512 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 254/255 constraints, PredecessorRefiner: 879/879 constraints, Known Traps: 76/76 constraints]
After SMT, in 70083ms problems are : Problem set: 0 solved, 879 unsolved
Search for dead transitions found 0 dead transitions in 70091ms
Starting structural reductions in SI_LTL mode, iteration 1 : 100/892 places, 896/14349 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72736 ms. Remains : 100/892 places, 896/14349 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-08b-LTLCardinality-12
Product exploration explored 100000 steps with 6936 reset in 457 ms.
Product exploration explored 100000 steps with 6909 reset in 461 ms.
Computed a total of 7 stabilizing places and 26 stable transitions
Computed a total of 7 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2764 resets) in 2089 ms. (19 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (211 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (213 resets) in 67 ms. (588 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (212 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 582745 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :0 out of 3
Probabilistic random walk after 582745 steps, saw 102544 distinct states, run finished after 3004 ms. (steps per millisecond=193 ) properties seen :0
[2024-05-29 20:55:34] [INFO ] Flow matrix only has 886 transitions (discarded 10 similar events)
[2024-05-29 20:55:34] [INFO ] Invariant cache hit.
[2024-05-29 20:55:34] [INFO ] State equation strengthened by 255 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 94/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 884/982 variables, 98/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/982 variables, 254/353 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/982 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 3/985 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/985 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/985 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/986 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/986 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/986 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 986/986 variables, and 357 constraints, problems are : Problem set: 0 solved, 3 unsolved in 670 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 94/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 20:55:35] [INFO ] Deduced a trap composed of 13 places in 289 ms of which 1 ms to minimize.
[2024-05-29 20:55:36] [INFO ] Deduced a trap composed of 13 places in 270 ms of which 0 ms to minimize.
[2024-05-29 20:55:36] [INFO ] Deduced a trap composed of 12 places in 260 ms of which 1 ms to minimize.
[2024-05-29 20:55:36] [INFO ] Deduced a trap composed of 21 places in 256 ms of which 1 ms to minimize.
[2024-05-29 20:55:36] [INFO ] Deduced a trap composed of 16 places in 234 ms of which 0 ms to minimize.
[2024-05-29 20:55:37] [INFO ] Deduced a trap composed of 14 places in 231 ms of which 1 ms to minimize.
[2024-05-29 20:55:37] [INFO ] Deduced a trap composed of 20 places in 238 ms of which 1 ms to minimize.
[2024-05-29 20:55:37] [INFO ] Deduced a trap composed of 20 places in 226 ms of which 1 ms to minimize.
[2024-05-29 20:55:37] [INFO ] Deduced a trap composed of 26 places in 231 ms of which 1 ms to minimize.
[2024-05-29 20:55:38] [INFO ] Deduced a trap composed of 19 places in 230 ms of which 0 ms to minimize.
[2024-05-29 20:55:38] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 884/982 variables, 98/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/982 variables, 254/364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/982 variables, 3/367 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/982 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 3/985 variables, 2/369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/985 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/985 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/986 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 20:55:39] [INFO ] Deduced a trap composed of 20 places in 255 ms of which 1 ms to minimize.
[2024-05-29 20:55:39] [INFO ] Deduced a trap composed of 22 places in 230 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/986 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/986 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/986 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 986/986 variables, and 373 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4219 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 13/13 constraints]
After SMT, in 5008ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 124 ms.
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 896/896 transitions.
Graph (complete) has 744 edges and 100 vertex of which 99 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 99 transition count 877
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 19 place count 99 transition count 874
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 96 transition count 874
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 28 rules applied. Total rules applied 53 place count 82 transition count 860
Free-agglomeration rule applied 42 times.
Iterating global reduction 1 with 42 rules applied. Total rules applied 95 place count 82 transition count 818
Reduce places removed 43 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 1 with 109 rules applied. Total rules applied 204 place count 39 transition count 752
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 204 place count 39 transition count 750
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 208 place count 37 transition count 750
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 216 place count 29 transition count 742
Iterating global reduction 2 with 8 rules applied. Total rules applied 224 place count 29 transition count 742
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 2 with 63 rules applied. Total rules applied 287 place count 29 transition count 679
Performed 8 Post agglomeration using F-continuation condition with reduction of 606 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 304 place count 20 transition count 65
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 3 with 45 rules applied. Total rules applied 349 place count 20 transition count 20
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 9 rules applied. Total rules applied 358 place count 14 transition count 17
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 360 place count 13 transition count 17
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 362 place count 13 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 363 place count 13 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 364 place count 12 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 365 place count 11 transition count 13
Applied a total of 365 rules in 87 ms. Remains 11 /100 variables (removed 89) and now considering 13/896 (removed 883) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 11/100 places, 13/896 transitions.
RANDOM walk for 84 steps (0 resets) in 5 ms. (14 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 163 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 896/896 transitions.
Applied a total of 0 rules in 39 ms. Remains 100 /100 variables (removed 0) and now considering 896/896 (removed 0) transitions.
[2024-05-29 20:55:40] [INFO ] Flow matrix only has 886 transitions (discarded 10 similar events)
[2024-05-29 20:55:40] [INFO ] Invariant cache hit.
[2024-05-29 20:55:40] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-05-29 20:55:40] [INFO ] Flow matrix only has 886 transitions (discarded 10 similar events)
[2024-05-29 20:55:40] [INFO ] Invariant cache hit.
[2024-05-29 20:55:40] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-29 20:55:41] [INFO ] Implicit Places using invariants and state equation in 815 ms returned []
Implicit Place search using SMT with State Equation took 1049 ms to find 0 implicit places.
[2024-05-29 20:55:41] [INFO ] Redundant transitions in 14 ms returned []
Running 879 sub problems to find dead transitions.
[2024-05-29 20:55:41] [INFO ] Flow matrix only has 886 transitions (discarded 10 similar events)
[2024-05-29 20:55:41] [INFO ] Invariant cache hit.
[2024-05-29 20:55:41] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 879 unsolved
[2024-05-29 20:55:53] [INFO ] Deduced a trap composed of 13 places in 298 ms of which 1 ms to minimize.
[2024-05-29 20:55:53] [INFO ] Deduced a trap composed of 19 places in 530 ms of which 1 ms to minimize.
[2024-05-29 20:55:53] [INFO ] Deduced a trap composed of 16 places in 254 ms of which 0 ms to minimize.
[2024-05-29 20:55:54] [INFO ] Deduced a trap composed of 19 places in 245 ms of which 0 ms to minimize.
[2024-05-29 20:55:54] [INFO ] Deduced a trap composed of 13 places in 241 ms of which 1 ms to minimize.
[2024-05-29 20:55:54] [INFO ] Deduced a trap composed of 12 places in 244 ms of which 0 ms to minimize.
[2024-05-29 20:55:54] [INFO ] Deduced a trap composed of 13 places in 233 ms of which 1 ms to minimize.
[2024-05-29 20:55:55] [INFO ] Deduced a trap composed of 14 places in 232 ms of which 1 ms to minimize.
[2024-05-29 20:55:55] [INFO ] Deduced a trap composed of 19 places in 230 ms of which 1 ms to minimize.
[2024-05-29 20:55:55] [INFO ] Deduced a trap composed of 21 places in 236 ms of which 1 ms to minimize.
[2024-05-29 20:55:55] [INFO ] Deduced a trap composed of 23 places in 234 ms of which 0 ms to minimize.
[2024-05-29 20:55:56] [INFO ] Deduced a trap composed of 25 places in 221 ms of which 1 ms to minimize.
[2024-05-29 20:55:56] [INFO ] Deduced a trap composed of 20 places in 209 ms of which 1 ms to minimize.
[2024-05-29 20:55:56] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 0 ms to minimize.
[2024-05-29 20:55:56] [INFO ] Deduced a trap composed of 20 places in 261 ms of which 1 ms to minimize.
[2024-05-29 20:55:57] [INFO ] Deduced a trap composed of 22 places in 256 ms of which 1 ms to minimize.
[2024-05-29 20:55:57] [INFO ] Deduced a trap composed of 22 places in 241 ms of which 1 ms to minimize.
[2024-05-29 20:55:57] [INFO ] Deduced a trap composed of 16 places in 241 ms of which 1 ms to minimize.
[2024-05-29 20:55:57] [INFO ] Deduced a trap composed of 23 places in 237 ms of which 1 ms to minimize.
[2024-05-29 20:55:58] [INFO ] Deduced a trap composed of 25 places in 225 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 879 unsolved
[2024-05-29 20:56:00] [INFO ] Deduced a trap composed of 22 places in 304 ms of which 0 ms to minimize.
[2024-05-29 20:56:00] [INFO ] Deduced a trap composed of 27 places in 271 ms of which 1 ms to minimize.
[2024-05-29 20:56:00] [INFO ] Deduced a trap composed of 25 places in 254 ms of which 1 ms to minimize.
[2024-05-29 20:56:01] [INFO ] Deduced a trap composed of 22 places in 242 ms of which 1 ms to minimize.
[2024-05-29 20:56:01] [INFO ] Deduced a trap composed of 19 places in 244 ms of which 0 ms to minimize.
[2024-05-29 20:56:01] [INFO ] Deduced a trap composed of 28 places in 239 ms of which 1 ms to minimize.
[2024-05-29 20:56:01] [INFO ] Deduced a trap composed of 19 places in 234 ms of which 0 ms to minimize.
[2024-05-29 20:56:02] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 1 ms to minimize.
[2024-05-29 20:56:02] [INFO ] Deduced a trap composed of 20 places in 235 ms of which 0 ms to minimize.
[2024-05-29 20:56:02] [INFO ] Deduced a trap composed of 19 places in 299 ms of which 1 ms to minimize.
[2024-05-29 20:56:02] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 1 ms to minimize.
[2024-05-29 20:56:06] [INFO ] Deduced a trap composed of 19 places in 249 ms of which 0 ms to minimize.
[2024-05-29 20:56:06] [INFO ] Deduced a trap composed of 19 places in 238 ms of which 1 ms to minimize.
[2024-05-29 20:56:07] [INFO ] Deduced a trap composed of 20 places in 251 ms of which 1 ms to minimize.
[2024-05-29 20:56:07] [INFO ] Deduced a trap composed of 20 places in 246 ms of which 1 ms to minimize.
[2024-05-29 20:56:07] [INFO ] Deduced a trap composed of 18 places in 253 ms of which 0 ms to minimize.
[2024-05-29 20:56:07] [INFO ] Deduced a trap composed of 18 places in 239 ms of which 0 ms to minimize.
[2024-05-29 20:56:08] [INFO ] Deduced a trap composed of 20 places in 253 ms of which 0 ms to minimize.
[2024-05-29 20:56:08] [INFO ] Deduced a trap composed of 18 places in 245 ms of which 1 ms to minimize.
[2024-05-29 20:56:08] [INFO ] Deduced a trap composed of 21 places in 241 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 879 unsolved
[2024-05-29 20:56:09] [INFO ] Deduced a trap composed of 22 places in 277 ms of which 1 ms to minimize.
[2024-05-29 20:56:09] [INFO ] Deduced a trap composed of 20 places in 278 ms of which 1 ms to minimize.
[2024-05-29 20:56:09] [INFO ] Deduced a trap composed of 22 places in 265 ms of which 0 ms to minimize.
[2024-05-29 20:56:10] [INFO ] Deduced a trap composed of 22 places in 278 ms of which 1 ms to minimize.
[2024-05-29 20:56:10] [INFO ] Deduced a trap composed of 21 places in 248 ms of which 0 ms to minimize.
[2024-05-29 20:56:10] [INFO ] Deduced a trap composed of 19 places in 246 ms of which 1 ms to minimize.
[2024-05-29 20:56:10] [INFO ] Deduced a trap composed of 23 places in 232 ms of which 0 ms to minimize.
[2024-05-29 20:56:11] [INFO ] Deduced a trap composed of 21 places in 249 ms of which 1 ms to minimize.
[2024-05-29 20:56:11] [INFO ] Deduced a trap composed of 20 places in 235 ms of which 1 ms to minimize.
[2024-05-29 20:56:11] [INFO ] Deduced a trap composed of 19 places in 233 ms of which 0 ms to minimize.
[2024-05-29 20:56:15] [INFO ] Deduced a trap composed of 23 places in 252 ms of which 1 ms to minimize.
[2024-05-29 20:56:15] [INFO ] Deduced a trap composed of 22 places in 235 ms of which 1 ms to minimize.
[2024-05-29 20:56:15] [INFO ] Deduced a trap composed of 19 places in 217 ms of which 1 ms to minimize.
[2024-05-29 20:56:16] [INFO ] Deduced a trap composed of 19 places in 206 ms of which 1 ms to minimize.
[2024-05-29 20:56:16] [INFO ] Deduced a trap composed of 20 places in 262 ms of which 0 ms to minimize.
[2024-05-29 20:56:16] [INFO ] Deduced a trap composed of 20 places in 247 ms of which 1 ms to minimize.
[2024-05-29 20:56:16] [INFO ] Deduced a trap composed of 29 places in 242 ms of which 1 ms to minimize.
[2024-05-29 20:56:17] [INFO ] Deduced a trap composed of 20 places in 231 ms of which 1 ms to minimize.
[2024-05-29 20:56:17] [INFO ] Deduced a trap composed of 20 places in 224 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 879 unsolved
[2024-05-29 20:56:17] [INFO ] Deduced a trap composed of 25 places in 288 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 100/986 variables, and 62 constraints, problems are : Problem set: 0 solved, 879 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/100 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 879/879 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 879 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 879 unsolved
[2024-05-29 20:56:21] [INFO ] Deduced a trap composed of 27 places in 245 ms of which 1 ms to minimize.
[2024-05-29 20:56:21] [INFO ] Deduced a trap composed of 23 places in 227 ms of which 0 ms to minimize.
[2024-05-29 20:56:25] [INFO ] Deduced a trap composed of 21 places in 256 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 879 unsolved
[2024-05-29 20:56:26] [INFO ] Deduced a trap composed of 21 places in 238 ms of which 1 ms to minimize.
[2024-05-29 20:56:26] [INFO ] Deduced a trap composed of 21 places in 239 ms of which 1 ms to minimize.
[2024-05-29 20:56:26] [INFO ] Deduced a trap composed of 23 places in 256 ms of which 1 ms to minimize.
[2024-05-29 20:56:27] [INFO ] Deduced a trap composed of 20 places in 256 ms of which 1 ms to minimize.
[2024-05-29 20:56:27] [INFO ] Deduced a trap composed of 23 places in 240 ms of which 1 ms to minimize.
[2024-05-29 20:56:31] [INFO ] Deduced a trap composed of 18 places in 241 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 879 unsolved
[2024-05-29 20:56:31] [INFO ] Deduced a trap composed of 18 places in 243 ms of which 1 ms to minimize.
[2024-05-29 20:56:32] [INFO ] Deduced a trap composed of 18 places in 231 ms of which 0 ms to minimize.
[2024-05-29 20:56:32] [INFO ] Deduced a trap composed of 20 places in 226 ms of which 0 ms to minimize.
[2024-05-29 20:56:32] [INFO ] Deduced a trap composed of 19 places in 228 ms of which 0 ms to minimize.
[2024-05-29 20:56:32] [INFO ] Deduced a trap composed of 18 places in 221 ms of which 0 ms to minimize.
[2024-05-29 20:56:33] [INFO ] Deduced a trap composed of 20 places in 219 ms of which 1 ms to minimize.
[2024-05-29 20:56:37] [INFO ] Deduced a trap composed of 22 places in 307 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 7/78 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 8 (OVERLAPS) 885/985 variables, 100/178 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/985 variables, 254/432 constraints. Problems are: Problem set: 0 solved, 879 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 985/986 variables, and 1311 constraints, problems are : Problem set: 0 solved, 879 unsolved in 32463 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 254/255 constraints, PredecessorRefiner: 879/879 constraints, Known Traps: 76/76 constraints]
After SMT, in 70121ms problems are : Problem set: 0 solved, 879 unsolved
Search for dead transitions found 0 dead transitions in 70129ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71239 ms. Remains : 100/100 places, 896/896 transitions.
Computed a total of 7 stabilizing places and 26 stable transitions
Computed a total of 7 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2776 resets) in 876 ms. (45 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (212 resets) in 79 ms. (500 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (213 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (218 resets) in 74 ms. (533 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 541633 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :0 out of 3
Probabilistic random walk after 541633 steps, saw 95115 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :0
[2024-05-29 20:56:55] [INFO ] Flow matrix only has 886 transitions (discarded 10 similar events)
[2024-05-29 20:56:55] [INFO ] Invariant cache hit.
[2024-05-29 20:56:55] [INFO ] State equation strengthened by 255 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 94/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 884/982 variables, 98/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/982 variables, 254/353 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/982 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 3/985 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/985 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/985 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/986 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/986 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/986 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 986/986 variables, and 357 constraints, problems are : Problem set: 0 solved, 3 unsolved in 682 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 94/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 20:56:56] [INFO ] Deduced a trap composed of 13 places in 303 ms of which 1 ms to minimize.
[2024-05-29 20:56:56] [INFO ] Deduced a trap composed of 13 places in 263 ms of which 1 ms to minimize.
[2024-05-29 20:56:56] [INFO ] Deduced a trap composed of 12 places in 256 ms of which 1 ms to minimize.
[2024-05-29 20:56:56] [INFO ] Deduced a trap composed of 21 places in 248 ms of which 0 ms to minimize.
[2024-05-29 20:56:57] [INFO ] Deduced a trap composed of 16 places in 240 ms of which 1 ms to minimize.
[2024-05-29 20:56:57] [INFO ] Deduced a trap composed of 14 places in 236 ms of which 1 ms to minimize.
[2024-05-29 20:56:57] [INFO ] Deduced a trap composed of 20 places in 236 ms of which 0 ms to minimize.
[2024-05-29 20:56:57] [INFO ] Deduced a trap composed of 20 places in 238 ms of which 0 ms to minimize.
[2024-05-29 20:56:58] [INFO ] Deduced a trap composed of 26 places in 224 ms of which 0 ms to minimize.
[2024-05-29 20:56:58] [INFO ] Deduced a trap composed of 19 places in 225 ms of which 1 ms to minimize.
[2024-05-29 20:56:58] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 884/982 variables, 98/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/982 variables, 254/364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/982 variables, 3/367 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/982 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 3/985 variables, 2/369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/985 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/985 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/986 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 20:56:59] [INFO ] Deduced a trap composed of 20 places in 248 ms of which 1 ms to minimize.
[2024-05-29 20:56:59] [INFO ] Deduced a trap composed of 22 places in 231 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/986 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/986 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/986 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 986/986 variables, and 373 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4248 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 13/13 constraints]
After SMT, in 4989ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 235 ms.
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 896/896 transitions.
Graph (complete) has 744 edges and 100 vertex of which 99 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 99 transition count 877
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 19 place count 99 transition count 874
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 96 transition count 874
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 28 rules applied. Total rules applied 53 place count 82 transition count 860
Free-agglomeration rule applied 42 times.
Iterating global reduction 1 with 42 rules applied. Total rules applied 95 place count 82 transition count 818
Reduce places removed 43 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 1 with 109 rules applied. Total rules applied 204 place count 39 transition count 752
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 204 place count 39 transition count 750
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 208 place count 37 transition count 750
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 216 place count 29 transition count 742
Iterating global reduction 2 with 8 rules applied. Total rules applied 224 place count 29 transition count 742
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 2 with 63 rules applied. Total rules applied 287 place count 29 transition count 679
Performed 8 Post agglomeration using F-continuation condition with reduction of 606 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 304 place count 20 transition count 65
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 3 with 45 rules applied. Total rules applied 349 place count 20 transition count 20
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 9 rules applied. Total rules applied 358 place count 14 transition count 17
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 360 place count 13 transition count 17
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 362 place count 13 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 363 place count 13 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 364 place count 12 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 365 place count 11 transition count 13
Applied a total of 365 rules in 84 ms. Remains 11 /100 variables (removed 89) and now considering 13/896 (removed 883) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 11/100 places, 13/896 transitions.
RANDOM walk for 32 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 176 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 6924 reset in 355 ms.
Product exploration explored 100000 steps with 6931 reset in 356 ms.
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 896/896 transitions.
Applied a total of 0 rules in 39 ms. Remains 100 /100 variables (removed 0) and now considering 896/896 (removed 0) transitions.
[2024-05-29 20:57:01] [INFO ] Flow matrix only has 886 transitions (discarded 10 similar events)
[2024-05-29 20:57:01] [INFO ] Invariant cache hit.
[2024-05-29 20:57:01] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-05-29 20:57:01] [INFO ] Flow matrix only has 886 transitions (discarded 10 similar events)
[2024-05-29 20:57:01] [INFO ] Invariant cache hit.
[2024-05-29 20:57:02] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-29 20:57:02] [INFO ] Implicit Places using invariants and state equation in 850 ms returned []
Implicit Place search using SMT with State Equation took 1103 ms to find 0 implicit places.
[2024-05-29 20:57:02] [INFO ] Redundant transitions in 15 ms returned []
Running 879 sub problems to find dead transitions.
[2024-05-29 20:57:02] [INFO ] Flow matrix only has 886 transitions (discarded 10 similar events)
[2024-05-29 20:57:02] [INFO ] Invariant cache hit.
[2024-05-29 20:57:02] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 879 unsolved
[2024-05-29 20:57:14] [INFO ] Deduced a trap composed of 13 places in 298 ms of which 1 ms to minimize.
[2024-05-29 20:57:15] [INFO ] Deduced a trap composed of 19 places in 274 ms of which 1 ms to minimize.
[2024-05-29 20:57:15] [INFO ] Deduced a trap composed of 16 places in 256 ms of which 1 ms to minimize.
[2024-05-29 20:57:15] [INFO ] Deduced a trap composed of 19 places in 249 ms of which 1 ms to minimize.
[2024-05-29 20:57:15] [INFO ] Deduced a trap composed of 13 places in 262 ms of which 0 ms to minimize.
[2024-05-29 20:57:16] [INFO ] Deduced a trap composed of 12 places in 235 ms of which 1 ms to minimize.
[2024-05-29 20:57:16] [INFO ] Deduced a trap composed of 13 places in 379 ms of which 1 ms to minimize.
[2024-05-29 20:57:16] [INFO ] Deduced a trap composed of 14 places in 243 ms of which 0 ms to minimize.
[2024-05-29 20:57:17] [INFO ] Deduced a trap composed of 19 places in 242 ms of which 1 ms to minimize.
[2024-05-29 20:57:17] [INFO ] Deduced a trap composed of 21 places in 243 ms of which 1 ms to minimize.
[2024-05-29 20:57:17] [INFO ] Deduced a trap composed of 23 places in 250 ms of which 5 ms to minimize.
[2024-05-29 20:57:17] [INFO ] Deduced a trap composed of 25 places in 222 ms of which 0 ms to minimize.
[2024-05-29 20:57:18] [INFO ] Deduced a trap composed of 20 places in 208 ms of which 1 ms to minimize.
[2024-05-29 20:57:18] [INFO ] Deduced a trap composed of 12 places in 223 ms of which 0 ms to minimize.
[2024-05-29 20:57:18] [INFO ] Deduced a trap composed of 20 places in 324 ms of which 0 ms to minimize.
[2024-05-29 20:57:18] [INFO ] Deduced a trap composed of 22 places in 264 ms of which 1 ms to minimize.
[2024-05-29 20:57:19] [INFO ] Deduced a trap composed of 22 places in 243 ms of which 1 ms to minimize.
[2024-05-29 20:57:19] [INFO ] Deduced a trap composed of 16 places in 232 ms of which 1 ms to minimize.
[2024-05-29 20:57:19] [INFO ] Deduced a trap composed of 23 places in 243 ms of which 1 ms to minimize.
[2024-05-29 20:57:19] [INFO ] Deduced a trap composed of 25 places in 233 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 879 unsolved
[2024-05-29 20:57:21] [INFO ] Deduced a trap composed of 22 places in 299 ms of which 1 ms to minimize.
[2024-05-29 20:57:22] [INFO ] Deduced a trap composed of 27 places in 261 ms of which 0 ms to minimize.
[2024-05-29 20:57:22] [INFO ] Deduced a trap composed of 25 places in 272 ms of which 1 ms to minimize.
[2024-05-29 20:57:22] [INFO ] Deduced a trap composed of 22 places in 252 ms of which 1 ms to minimize.
[2024-05-29 20:57:23] [INFO ] Deduced a trap composed of 19 places in 235 ms of which 1 ms to minimize.
[2024-05-29 20:57:23] [INFO ] Deduced a trap composed of 28 places in 242 ms of which 0 ms to minimize.
[2024-05-29 20:57:23] [INFO ] Deduced a trap composed of 19 places in 237 ms of which 1 ms to minimize.
[2024-05-29 20:57:23] [INFO ] Deduced a trap composed of 23 places in 222 ms of which 1 ms to minimize.
[2024-05-29 20:57:24] [INFO ] Deduced a trap composed of 20 places in 240 ms of which 1 ms to minimize.
[2024-05-29 20:57:24] [INFO ] Deduced a trap composed of 19 places in 224 ms of which 1 ms to minimize.
[2024-05-29 20:57:24] [INFO ] Deduced a trap composed of 23 places in 204 ms of which 1 ms to minimize.
[2024-05-29 20:57:28] [INFO ] Deduced a trap composed of 19 places in 242 ms of which 1 ms to minimize.
[2024-05-29 20:57:28] [INFO ] Deduced a trap composed of 19 places in 241 ms of which 1 ms to minimize.
[2024-05-29 20:57:28] [INFO ] Deduced a trap composed of 20 places in 251 ms of which 0 ms to minimize.
[2024-05-29 20:57:29] [INFO ] Deduced a trap composed of 20 places in 252 ms of which 0 ms to minimize.
[2024-05-29 20:57:29] [INFO ] Deduced a trap composed of 18 places in 261 ms of which 1 ms to minimize.
[2024-05-29 20:57:29] [INFO ] Deduced a trap composed of 18 places in 245 ms of which 1 ms to minimize.
[2024-05-29 20:57:29] [INFO ] Deduced a trap composed of 20 places in 258 ms of which 1 ms to minimize.
[2024-05-29 20:57:30] [INFO ] Deduced a trap composed of 18 places in 257 ms of which 1 ms to minimize.
[2024-05-29 20:57:30] [INFO ] Deduced a trap composed of 21 places in 242 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 879 unsolved
[2024-05-29 20:57:30] [INFO ] Deduced a trap composed of 22 places in 282 ms of which 1 ms to minimize.
[2024-05-29 20:57:31] [INFO ] Deduced a trap composed of 20 places in 276 ms of which 1 ms to minimize.
[2024-05-29 20:57:31] [INFO ] Deduced a trap composed of 22 places in 269 ms of which 0 ms to minimize.
[2024-05-29 20:57:31] [INFO ] Deduced a trap composed of 22 places in 280 ms of which 1 ms to minimize.
[2024-05-29 20:57:32] [INFO ] Deduced a trap composed of 21 places in 249 ms of which 1 ms to minimize.
[2024-05-29 20:57:32] [INFO ] Deduced a trap composed of 19 places in 241 ms of which 0 ms to minimize.
[2024-05-29 20:57:32] [INFO ] Deduced a trap composed of 23 places in 232 ms of which 0 ms to minimize.
[2024-05-29 20:57:32] [INFO ] Deduced a trap composed of 21 places in 244 ms of which 1 ms to minimize.
[2024-05-29 20:57:33] [INFO ] Deduced a trap composed of 20 places in 232 ms of which 0 ms to minimize.
[2024-05-29 20:57:33] [INFO ] Deduced a trap composed of 19 places in 231 ms of which 1 ms to minimize.
[2024-05-29 20:57:37] [INFO ] Deduced a trap composed of 23 places in 248 ms of which 1 ms to minimize.
[2024-05-29 20:57:37] [INFO ] Deduced a trap composed of 22 places in 241 ms of which 1 ms to minimize.
[2024-05-29 20:57:37] [INFO ] Deduced a trap composed of 19 places in 222 ms of which 1 ms to minimize.
[2024-05-29 20:57:37] [INFO ] Deduced a trap composed of 19 places in 217 ms of which 1 ms to minimize.
[2024-05-29 20:57:38] [INFO ] Deduced a trap composed of 20 places in 267 ms of which 1 ms to minimize.
[2024-05-29 20:57:38] [INFO ] Deduced a trap composed of 20 places in 295 ms of which 1 ms to minimize.
[2024-05-29 20:57:38] [INFO ] Deduced a trap composed of 29 places in 271 ms of which 1 ms to minimize.
[2024-05-29 20:57:39] [INFO ] Deduced a trap composed of 20 places in 250 ms of which 0 ms to minimize.
[2024-05-29 20:57:39] [INFO ] Deduced a trap composed of 20 places in 239 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 879 unsolved
[2024-05-29 20:57:39] [INFO ] Deduced a trap composed of 25 places in 308 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 100/986 variables, and 62 constraints, problems are : Problem set: 0 solved, 879 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/100 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 879/879 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 879 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 879 unsolved
[2024-05-29 20:57:43] [INFO ] Deduced a trap composed of 27 places in 255 ms of which 0 ms to minimize.
[2024-05-29 20:57:43] [INFO ] Deduced a trap composed of 23 places in 239 ms of which 0 ms to minimize.
[2024-05-29 20:57:47] [INFO ] Deduced a trap composed of 21 places in 258 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 879 unsolved
[2024-05-29 20:57:48] [INFO ] Deduced a trap composed of 21 places in 246 ms of which 1 ms to minimize.
[2024-05-29 20:57:48] [INFO ] Deduced a trap composed of 21 places in 235 ms of which 0 ms to minimize.
[2024-05-29 20:57:48] [INFO ] Deduced a trap composed of 23 places in 258 ms of which 1 ms to minimize.
[2024-05-29 20:57:48] [INFO ] Deduced a trap composed of 20 places in 256 ms of which 0 ms to minimize.
[2024-05-29 20:57:49] [INFO ] Deduced a trap composed of 23 places in 247 ms of which 1 ms to minimize.
[2024-05-29 20:57:52] [INFO ] Deduced a trap composed of 18 places in 250 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 879 unsolved
[2024-05-29 20:57:53] [INFO ] Deduced a trap composed of 18 places in 255 ms of which 0 ms to minimize.
[2024-05-29 20:57:53] [INFO ] Deduced a trap composed of 18 places in 241 ms of which 0 ms to minimize.
[2024-05-29 20:57:54] [INFO ] Deduced a trap composed of 20 places in 230 ms of which 1 ms to minimize.
[2024-05-29 20:57:54] [INFO ] Deduced a trap composed of 19 places in 229 ms of which 0 ms to minimize.
[2024-05-29 20:57:54] [INFO ] Deduced a trap composed of 18 places in 223 ms of which 0 ms to minimize.
[2024-05-29 20:57:54] [INFO ] Deduced a trap composed of 20 places in 214 ms of which 0 ms to minimize.
[2024-05-29 20:57:58] [INFO ] Deduced a trap composed of 22 places in 302 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 7/78 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 8 (OVERLAPS) 885/985 variables, 100/178 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/985 variables, 254/432 constraints. Problems are: Problem set: 0 solved, 879 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 985/986 variables, and 1311 constraints, problems are : Problem set: 0 solved, 879 unsolved in 32563 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 254/255 constraints, PredecessorRefiner: 879/879 constraints, Known Traps: 76/76 constraints]
After SMT, in 70534ms problems are : Problem set: 0 solved, 879 unsolved
Search for dead transitions found 0 dead transitions in 70542ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71705 ms. Remains : 100/100 places, 896/896 transitions.
Treatment of property StigmergyElection-PT-08b-LTLCardinality-12 finished in 237787 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))||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X(p1)))))'
Found a Shortening insensitive property : StigmergyElection-PT-08b-LTLCardinality-06
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 892 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 892/892 places, 14349/14349 transitions.
Graph (trivial) has 908 edges and 892 vertex of which 138 / 892 are part of one of the 24 SCC in 1 ms
Free SCC test removed 114 places
Ensure Unique test removed 130 transitions
Reduce isomorphic transitions removed 130 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 535 transitions
Trivial Post-agglo rules discarded 535 transitions
Performed 535 trivial Post agglomeration. Transition count delta: 535
Iterating post reduction 0 with 535 rules applied. Total rules applied 536 place count 777 transition count 13683
Reduce places removed 535 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 551 rules applied. Total rules applied 1087 place count 242 transition count 13667
Reduce places removed 8 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 11 rules applied. Total rules applied 1098 place count 234 transition count 13664
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1101 place count 231 transition count 13664
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 29 Pre rules applied. Total rules applied 1101 place count 231 transition count 13635
Deduced a syphon composed of 29 places in 6 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 1159 place count 202 transition count 13635
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1170 place count 191 transition count 13623
Iterating global reduction 4 with 11 rules applied. Total rules applied 1181 place count 191 transition count 13623
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1181 place count 191 transition count 13621
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1185 place count 189 transition count 13621
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1187 place count 187 transition count 11432
Iterating global reduction 4 with 2 rules applied. Total rules applied 1189 place count 187 transition count 11432
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1190 place count 187 transition count 11431
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1191 place count 186 transition count 11429
Iterating global reduction 5 with 1 rules applied. Total rules applied 1192 place count 186 transition count 11429
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 4 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 5 with 70 rules applied. Total rules applied 1262 place count 151 transition count 11394
Discarding 29 places :
Symmetric choice reduction at 5 with 29 rule applications. Total rules 1291 place count 122 transition count 1077
Iterating global reduction 5 with 29 rules applied. Total rules applied 1320 place count 122 transition count 1077
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 1333 place count 122 transition count 1064
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1340 place count 115 transition count 1050
Iterating global reduction 6 with 7 rules applied. Total rules applied 1347 place count 115 transition count 1050
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1354 place count 108 transition count 1036
Iterating global reduction 6 with 7 rules applied. Total rules applied 1361 place count 108 transition count 1036
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1385 place count 96 transition count 1043
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1386 place count 95 transition count 1027
Iterating global reduction 6 with 1 rules applied. Total rules applied 1387 place count 95 transition count 1027
Applied a total of 1387 rules in 1845 ms. Remains 95 /892 variables (removed 797) and now considering 1027/14349 (removed 13322) transitions.
[2024-05-29 20:58:17] [INFO ] Flow matrix only has 1018 transitions (discarded 9 similar events)
// Phase 1: matrix 1018 rows 95 cols
[2024-05-29 20:58:17] [INFO ] Computed 2 invariants in 6 ms
[2024-05-29 20:58:17] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-29 20:58:17] [INFO ] Flow matrix only has 1018 transitions (discarded 9 similar events)
[2024-05-29 20:58:17] [INFO ] Invariant cache hit.
[2024-05-29 20:58:17] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-29 20:58:18] [INFO ] Implicit Places using invariants and state equation in 998 ms returned []
Implicit Place search using SMT with State Equation took 1290 ms to find 0 implicit places.
Running 1009 sub problems to find dead transitions.
[2024-05-29 20:58:18] [INFO ] Flow matrix only has 1018 transitions (discarded 9 similar events)
[2024-05-29 20:58:18] [INFO ] Invariant cache hit.
[2024-05-29 20:58:18] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1009 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1009 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1009 unsolved
[2024-05-29 20:58:35] [INFO ] Deduced a trap composed of 12 places in 318 ms of which 1 ms to minimize.
[2024-05-29 20:58:36] [INFO ] Deduced a trap composed of 19 places in 312 ms of which 1 ms to minimize.
[2024-05-29 20:58:36] [INFO ] Deduced a trap composed of 13 places in 317 ms of which 1 ms to minimize.
[2024-05-29 20:58:36] [INFO ] Deduced a trap composed of 21 places in 308 ms of which 1 ms to minimize.
[2024-05-29 20:58:37] [INFO ] Deduced a trap composed of 12 places in 286 ms of which 1 ms to minimize.
[2024-05-29 20:58:37] [INFO ] Deduced a trap composed of 30 places in 285 ms of which 0 ms to minimize.
[2024-05-29 20:58:37] [INFO ] Deduced a trap composed of 21 places in 273 ms of which 0 ms to minimize.
[2024-05-29 20:58:37] [INFO ] Deduced a trap composed of 15 places in 271 ms of which 1 ms to minimize.
[2024-05-29 20:58:38] [INFO ] Deduced a trap composed of 18 places in 278 ms of which 1 ms to minimize.
[2024-05-29 20:58:38] [INFO ] Deduced a trap composed of 13 places in 267 ms of which 1 ms to minimize.
[2024-05-29 20:58:38] [INFO ] Deduced a trap composed of 22 places in 246 ms of which 0 ms to minimize.
[2024-05-29 20:58:39] [INFO ] Deduced a trap composed of 21 places in 269 ms of which 0 ms to minimize.
[2024-05-29 20:58:39] [INFO ] Deduced a trap composed of 24 places in 254 ms of which 1 ms to minimize.
[2024-05-29 20:58:39] [INFO ] Deduced a trap composed of 18 places in 265 ms of which 1 ms to minimize.
[2024-05-29 20:58:39] [INFO ] Deduced a trap composed of 14 places in 254 ms of which 0 ms to minimize.
[2024-05-29 20:58:40] [INFO ] Deduced a trap composed of 18 places in 283 ms of which 1 ms to minimize.
[2024-05-29 20:58:40] [INFO ] Deduced a trap composed of 20 places in 261 ms of which 0 ms to minimize.
[2024-05-29 20:58:40] [INFO ] Deduced a trap composed of 21 places in 278 ms of which 1 ms to minimize.
[2024-05-29 20:58:40] [INFO ] Deduced a trap composed of 25 places in 283 ms of which 0 ms to minimize.
[2024-05-29 20:58:41] [INFO ] Deduced a trap composed of 22 places in 279 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1009 unsolved
[2024-05-29 20:58:43] [INFO ] Deduced a trap composed of 15 places in 319 ms of which 1 ms to minimize.
[2024-05-29 20:58:44] [INFO ] Deduced a trap composed of 18 places in 305 ms of which 0 ms to minimize.
[2024-05-29 20:58:44] [INFO ] Deduced a trap composed of 12 places in 310 ms of which 1 ms to minimize.
[2024-05-29 20:58:44] [INFO ] Deduced a trap composed of 28 places in 317 ms of which 0 ms to minimize.
[2024-05-29 20:58:45] [INFO ] Deduced a trap composed of 21 places in 310 ms of which 1 ms to minimize.
[2024-05-29 20:58:45] [INFO ] Deduced a trap composed of 18 places in 302 ms of which 1 ms to minimize.
[2024-05-29 20:58:45] [INFO ] Deduced a trap composed of 24 places in 300 ms of which 1 ms to minimize.
[2024-05-29 20:58:45] [INFO ] Deduced a trap composed of 29 places in 288 ms of which 1 ms to minimize.
[2024-05-29 20:58:46] [INFO ] Deduced a trap composed of 23 places in 290 ms of which 1 ms to minimize.
[2024-05-29 20:58:46] [INFO ] Deduced a trap composed of 25 places in 303 ms of which 0 ms to minimize.
[2024-05-29 20:58:46] [INFO ] Deduced a trap composed of 20 places in 305 ms of which 0 ms to minimize.
[2024-05-29 20:58:47] [INFO ] Deduced a trap composed of 21 places in 286 ms of which 1 ms to minimize.
[2024-05-29 20:58:53] [INFO ] Deduced a trap composed of 21 places in 249 ms of which 0 ms to minimize.
[2024-05-29 20:58:53] [INFO ] Deduced a trap composed of 22 places in 275 ms of which 1 ms to minimize.
[2024-05-29 20:58:53] [INFO ] Deduced a trap composed of 19 places in 236 ms of which 1 ms to minimize.
[2024-05-29 20:58:54] [INFO ] Deduced a trap composed of 21 places in 303 ms of which 1 ms to minimize.
[2024-05-29 20:58:54] [INFO ] Deduced a trap composed of 19 places in 292 ms of which 1 ms to minimize.
[2024-05-29 20:58:54] [INFO ] Deduced a trap composed of 24 places in 279 ms of which 1 ms to minimize.
[2024-05-29 20:58:55] [INFO ] Deduced a trap composed of 18 places in 269 ms of which 1 ms to minimize.
[2024-05-29 20:58:55] [INFO ] Deduced a trap composed of 18 places in 266 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1009 unsolved
[2024-05-29 20:58:56] [INFO ] Deduced a trap composed of 24 places in 304 ms of which 0 ms to minimize.
[2024-05-29 20:58:56] [INFO ] Deduced a trap composed of 20 places in 287 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1009 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 95/1113 variables, and 44 constraints, problems are : Problem set: 0 solved, 1009 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/95 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 1009/1009 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1009 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1009 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1009 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1009 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 1009 unsolved
[2024-05-29 20:59:04] [INFO ] Deduced a trap composed of 21 places in 303 ms of which 0 ms to minimize.
[2024-05-29 20:59:04] [INFO ] Deduced a trap composed of 25 places in 284 ms of which 1 ms to minimize.
[2024-05-29 20:59:04] [INFO ] Deduced a trap composed of 18 places in 274 ms of which 1 ms to minimize.
[2024-05-29 20:59:05] [INFO ] Deduced a trap composed of 21 places in 274 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 1009 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1009 unsolved
At refinement iteration 6 (OVERLAPS) 1017/1112 variables, 95/143 constraints. Problems are: Problem set: 0 solved, 1009 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1112 variables, 254/397 constraints. Problems are: Problem set: 0 solved, 1009 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1112/1113 variables, and 1406 constraints, problems are : Problem set: 0 solved, 1009 unsolved in 32231 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 254/255 constraints, PredecessorRefiner: 1009/1009 constraints, Known Traps: 46/46 constraints]
After SMT, in 74374ms problems are : Problem set: 0 solved, 1009 unsolved
Search for dead transitions found 0 dead transitions in 74391ms
Starting structural reductions in LI_LTL mode, iteration 1 : 95/892 places, 1027/14349 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 77529 ms. Remains : 95/892 places, 1027/14349 transitions.
Running random walk in product with property : StigmergyElection-PT-08b-LTLCardinality-06
Stuttering criterion allowed to conclude after 2488 steps with 825 reset in 10 ms.
Treatment of property StigmergyElection-PT-08b-LTLCardinality-06 finished in 77762 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(F(p1)))))'
[2024-05-29 20:59:34] [INFO ] Flatten gal took : 1076 ms
[2024-05-29 20:59:34] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-29 20:59:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 892 places, 14349 transitions and 216094 arcs took 106 ms.
Total runtime 2909952 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running StigmergyElection-PT-08b
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 892
TRANSITIONS: 14349
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.955s, Sys 0.032s]
SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.072s, Sys 0.011s]
----------------------------------------------------------------------
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: 3365
MODEL NAME: /home/mcc/execution/411/model
892 places, 14349 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 StigmergyElection-PT-08b-LTLCardinality-05 CANNOT_COMPUTE
FORMULA StigmergyElection-PT-08b-LTLCardinality-06 CANNOT_COMPUTE
FORMULA StigmergyElection-PT-08b-LTLCardinality-12 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1717017023157
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-08b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is StigmergyElection-PT-08b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r399-tall-171690530200355"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-08b.tgz
mv StigmergyElection-PT-08b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;