About the Execution of GreatSPN+red for CO4-PT-08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4143.132 | 357827.00 | 580140.00 | 1098.20 | FTFFFFTTFFFFTFTT | 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.r549-tall-171734897700059.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 CO4-PT-08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734897700059
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.1K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 138K Jun 2 16:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME CO4-PT-08-LTLCardinality-00
FORMULA_NAME CO4-PT-08-LTLCardinality-01
FORMULA_NAME CO4-PT-08-LTLCardinality-02
FORMULA_NAME CO4-PT-08-LTLCardinality-03
FORMULA_NAME CO4-PT-08-LTLCardinality-04
FORMULA_NAME CO4-PT-08-LTLCardinality-05
FORMULA_NAME CO4-PT-08-LTLCardinality-06
FORMULA_NAME CO4-PT-08-LTLCardinality-07
FORMULA_NAME CO4-PT-08-LTLCardinality-08
FORMULA_NAME CO4-PT-08-LTLCardinality-09
FORMULA_NAME CO4-PT-08-LTLCardinality-10
FORMULA_NAME CO4-PT-08-LTLCardinality-11
FORMULA_NAME CO4-PT-08-LTLCardinality-12
FORMULA_NAME CO4-PT-08-LTLCardinality-13
FORMULA_NAME CO4-PT-08-LTLCardinality-14
FORMULA_NAME CO4-PT-08-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717352476081
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:21:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 18:21:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:21:17] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-06-02 18:21:17] [INFO ] Transformed 467 places.
[2024-06-02 18:21:17] [INFO ] Transformed 600 transitions.
[2024-06-02 18:21:17] [INFO ] Found NUPN structural information;
[2024-06-02 18:21:17] [INFO ] Parsed PT model containing 467 places and 600 transitions and 1596 arcs in 200 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 108 places in 14 ms
Reduce places removed 108 places and 155 transitions.
FORMULA CO4-PT-08-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 445/445 transitions.
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 347 transition count 444
Discarding 74 places :
Symmetric choice reduction at 1 with 74 rule applications. Total rules 87 place count 273 transition count 368
Iterating global reduction 1 with 74 rules applied. Total rules applied 161 place count 273 transition count 368
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 166 place count 273 transition count 363
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 198 place count 241 transition count 316
Iterating global reduction 2 with 32 rules applied. Total rules applied 230 place count 241 transition count 316
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 232 place count 241 transition count 314
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 236 place count 237 transition count 308
Iterating global reduction 3 with 4 rules applied. Total rules applied 240 place count 237 transition count 308
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 241 place count 236 transition count 307
Iterating global reduction 3 with 1 rules applied. Total rules applied 242 place count 236 transition count 307
Applied a total of 242 rules in 103 ms. Remains 236 /359 variables (removed 123) and now considering 307/445 (removed 138) transitions.
// Phase 1: matrix 307 rows 236 cols
[2024-06-02 18:21:17] [INFO ] Computed 6 invariants in 19 ms
[2024-06-02 18:21:18] [INFO ] Implicit Places using invariants in 241 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 274 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 235/359 places, 307/445 transitions.
Applied a total of 0 rules in 5 ms. Remains 235 /235 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 398 ms. Remains : 235/359 places, 307/445 transitions.
Support contains 26 out of 235 places after structural reductions.
[2024-06-02 18:21:18] [INFO ] Flatten gal took : 66 ms
[2024-06-02 18:21:18] [INFO ] Flatten gal took : 29 ms
[2024-06-02 18:21:18] [INFO ] Input system was already deterministic with 307 transitions.
RANDOM walk for 40000 steps (159 resets) in 1383 ms. (28 steps per ms) remains 12/16 properties
BEST_FIRST walk for 40002 steps (180 resets) in 310 ms. (128 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (282 resets) in 216 ms. (184 steps per ms) remains 10/12 properties
BEST_FIRST walk for 40001 steps (208 resets) in 185 ms. (215 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (243 resets) in 175 ms. (227 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (146 resets) in 285 ms. (139 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (212 resets) in 148 ms. (268 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (137 resets) in 158 ms. (251 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40002 steps (265 resets) in 113 ms. (350 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40001 steps (273 resets) in 127 ms. (312 steps per ms) remains 7/7 properties
// Phase 1: matrix 307 rows 235 cols
[2024-06-02 18:21:19] [INFO ] Computed 5 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 11/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 16/38 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 90/128 variables, 38/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 213/341 variables, 81/124 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 160/501 variables, 88/212 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 35/536 variables, 24/236 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/536 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 6/542 variables, 4/240 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/542 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/542 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 542/542 variables, and 240 constraints, problems are : Problem set: 0 solved, 7 unsolved in 549 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 11/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 18:21:20] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 16/38 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 90/128 variables, 38/44 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 213/341 variables, 81/125 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 7/132 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 160/501 variables, 88/220 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/501 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 35/536 variables, 24/244 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/536 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 6/542 variables, 4/248 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/542 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 0/542 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 542/542 variables, and 248 constraints, problems are : Problem set: 0 solved, 7 unsolved in 729 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 1326ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 5 different solutions.
Finished Parikh walk after 850 steps, including 12 resets, run visited all 7 properties in 13 ms. (steps per millisecond=65 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 7 properties in 19 ms.
FORMULA CO4-PT-08-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 17 stabilizing places and 26 stable transitions
Graph (complete) has 434 edges and 235 vertex of which 231 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.8 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((G(F(p0)) U G(p1)))))'
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 307/307 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 234 transition count 306
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 17 place count 219 transition count 289
Iterating global reduction 1 with 15 rules applied. Total rules applied 32 place count 219 transition count 289
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 42 place count 209 transition count 276
Iterating global reduction 1 with 10 rules applied. Total rules applied 52 place count 209 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 53 place count 209 transition count 275
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 56 place count 206 transition count 272
Iterating global reduction 2 with 3 rules applied. Total rules applied 59 place count 206 transition count 272
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 204 transition count 270
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 204 transition count 270
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 204 transition count 268
Applied a total of 65 rules in 18 ms. Remains 204 /235 variables (removed 31) and now considering 268/307 (removed 39) transitions.
// Phase 1: matrix 268 rows 204 cols
[2024-06-02 18:21:21] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 18:21:21] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 18:21:21] [INFO ] Invariant cache hit.
[2024-06-02 18:21:21] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 267 sub problems to find dead transitions.
[2024-06-02 18:21:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-06-02 18:21:23] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:21:23] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:21:24] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 268/472 variables, 204/212 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-06-02 18:21:26] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:21:26] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (OVERLAPS) 0/472 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 214 constraints, problems are : Problem set: 0 solved, 267 unsolved in 11504 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 267 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 268/472 variables, 204/214 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 267/481 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (OVERLAPS) 0/472 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 481 constraints, problems are : Problem set: 0 solved, 267 unsolved in 11095 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 5/5 constraints]
After SMT, in 22678ms problems are : Problem set: 0 solved, 267 unsolved
Search for dead transitions found 0 dead transitions in 22684ms
Starting structural reductions in LTL mode, iteration 1 : 204/235 places, 268/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22901 ms. Remains : 204/235 places, 268/307 transitions.
Stuttering acceptance computed with spot in 394 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : CO4-PT-08-LTLCardinality-00
Product exploration explored 100000 steps with 34 reset in 212 ms.
Product exploration explored 100000 steps with 1 reset in 140 ms.
Computed a total of 14 stabilizing places and 21 stable transitions
Graph (complete) has 385 edges and 204 vertex of which 201 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 14 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 96 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (287 resets) in 326 ms. (122 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40001 steps (175 resets) in 154 ms. (258 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (179 resets) in 131 ms. (303 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (81 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
[2024-06-02 18:21:45] [INFO ] Invariant cache hit.
Problem apf0 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 66/96 variables, 30/35 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 193/289 variables, 67/102 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 147/436 variables, 85/187 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/436 variables, 0/187 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 30/466 variables, 18/205 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/466 variables, 0/205 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 6/472 variables, 4/209 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/472 variables, 0/209 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/472 variables, 0/209 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 209 constraints, problems are : Problem set: 1 solved, 2 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-02 18:21:45] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 66/96 variables, 30/36 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 193/289 variables, 67/103 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 2/105 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 147/436 variables, 85/190 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/436 variables, 0/190 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 30/466 variables, 18/208 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/466 variables, 0/208 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 6/472 variables, 4/212 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/472 variables, 0/212 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/472 variables, 0/212 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 212 constraints, problems are : Problem set: 1 solved, 2 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 492ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 49 ms.
Support contains 4 out of 204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 204/204 places, 268/268 transitions.
Graph (trivial) has 209 edges and 204 vertex of which 2 / 204 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 383 edges and 203 vertex of which 187 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 79 rules applied. Total rules applied 81 place count 187 transition count 173
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 149 place count 121 transition count 171
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 149 place count 121 transition count 148
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 195 place count 98 transition count 148
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 236 edges and 98 vertex of which 97 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 197 place count 97 transition count 147
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 199 place count 97 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 200 place count 96 transition count 145
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 202 place count 94 transition count 143
Iterating global reduction 5 with 2 rules applied. Total rules applied 204 place count 94 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 206 place count 94 transition count 141
Performed 30 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 266 place count 64 transition count 107
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 275 place count 64 transition count 98
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 280 place count 59 transition count 93
Iterating global reduction 7 with 5 rules applied. Total rules applied 285 place count 59 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 286 place count 59 transition count 92
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 296 place count 54 transition count 87
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 302 place count 54 transition count 81
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 305 place count 51 transition count 78
Iterating global reduction 9 with 3 rules applied. Total rules applied 308 place count 51 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 309 place count 51 transition count 77
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 310 place count 50 transition count 76
Iterating global reduction 10 with 1 rules applied. Total rules applied 311 place count 50 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 312 place count 50 transition count 75
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 11 with 2 rules applied. Total rules applied 314 place count 49 transition count 74
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 315 place count 49 transition count 73
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 316 place count 48 transition count 72
Iterating global reduction 12 with 1 rules applied. Total rules applied 317 place count 48 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 318 place count 48 transition count 71
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 13 with 18 rules applied. Total rules applied 336 place count 39 transition count 72
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 13 with 15 rules applied. Total rules applied 351 place count 39 transition count 57
Discarding 8 places :
Symmetric choice reduction at 14 with 8 rule applications. Total rules 359 place count 31 transition count 49
Iterating global reduction 14 with 8 rules applied. Total rules applied 367 place count 31 transition count 49
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 373 place count 31 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 375 place count 30 transition count 54
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 15 with 13 rules applied. Total rules applied 388 place count 30 transition count 41
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 389 place count 29 transition count 40
Iterating global reduction 15 with 1 rules applied. Total rules applied 390 place count 29 transition count 40
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 394 place count 29 transition count 36
Free-agglomeration rule applied 7 times.
Iterating global reduction 16 with 7 rules applied. Total rules applied 401 place count 29 transition count 29
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 8 rules applied. Total rules applied 409 place count 22 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 410 place count 21 transition count 27
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 412 place count 19 transition count 27
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 416 place count 17 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 417 place count 17 transition count 24
Applied a total of 417 rules in 62 ms. Remains 17 /204 variables (removed 187) and now considering 24/268 (removed 244) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 17/204 places, 24/268 transitions.
RANDOM walk for 53 steps (0 resets) in 4 ms. (10 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 175 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Support contains 4 out of 204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 268/268 transitions.
Applied a total of 0 rules in 4 ms. Remains 204 /204 variables (removed 0) and now considering 268/268 (removed 0) transitions.
[2024-06-02 18:21:46] [INFO ] Invariant cache hit.
[2024-06-02 18:21:46] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 18:21:46] [INFO ] Invariant cache hit.
[2024-06-02 18:21:47] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 267 sub problems to find dead transitions.
[2024-06-02 18:21:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-06-02 18:21:48] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:21:48] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-06-02 18:21:49] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 268/472 variables, 204/212 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-06-02 18:21:51] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 2 ms to minimize.
[2024-06-02 18:21:51] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (OVERLAPS) 0/472 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 214 constraints, problems are : Problem set: 0 solved, 267 unsolved in 11554 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 267 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 268/472 variables, 204/214 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 267/481 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (OVERLAPS) 0/472 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 481 constraints, problems are : Problem set: 0 solved, 267 unsolved in 10792 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 5/5 constraints]
After SMT, in 22393ms problems are : Problem set: 0 solved, 267 unsolved
Search for dead transitions found 0 dead transitions in 22398ms
Finished structural reductions in LTL mode , in 1 iterations and 22586 ms. Remains : 204/204 places, 268/268 transitions.
Computed a total of 14 stabilizing places and 21 stable transitions
Graph (complete) has 385 edges and 204 vertex of which 201 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Computed a total of 14 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (170 resets) in 135 ms. (294 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40000 steps (126 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
[2024-06-02 18:22:09] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/29 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/111 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/118 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/134 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/134 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 146/280 variables, 67/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/280 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 139/419 variables, 75/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/419 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 51/470 variables, 32/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/470 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/472 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/472 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/472 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 209 constraints, problems are : Problem set: 0 solved, 1 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/29 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 82/111 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/118 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/134 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/134 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 146/280 variables, 67/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/280 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 139/419 variables, 75/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/419 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 51/470 variables, 32/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/470 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/472 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/472 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/472 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 175 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 378ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 2774 steps, including 97 resets, run visited all 1 properties in 6 ms. (steps per millisecond=462 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8 reset in 107 ms.
Product exploration explored 100000 steps with 34 reset in 106 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Support contains 4 out of 204 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 204/204 places, 268/268 transitions.
Graph (trivial) has 209 edges and 204 vertex of which 2 / 204 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 384 edges and 203 vertex of which 200 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 200 transition count 264
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 70 place count 200 transition count 262
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 70 place count 200 transition count 280
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 90 place count 200 transition count 280
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 105 place count 185 transition count 265
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 120 place count 185 transition count 265
Performed 31 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 102 places in 1 ms
Iterating global reduction 2 with 31 rules applied. Total rules applied 151 place count 185 transition count 281
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 156 place count 185 transition count 276
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 175 place count 166 transition count 255
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 3 with 19 rules applied. Total rules applied 194 place count 166 transition count 255
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 195 place count 166 transition count 255
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 197 place count 166 transition count 253
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 199 place count 164 transition count 251
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 201 place count 164 transition count 251
Performed 23 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 107 places in 0 ms
Iterating global reduction 4 with 23 rules applied. Total rules applied 224 place count 164 transition count 374
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 242 place count 164 transition count 356
Discarding 46 places :
Symmetric choice reduction at 5 with 46 rule applications. Total rules 288 place count 118 transition count 223
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 5 with 46 rules applied. Total rules applied 334 place count 118 transition count 223
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 343 place count 118 transition count 214
Discarding 27 places :
Symmetric choice reduction at 6 with 27 rule applications. Total rules 370 place count 91 transition count 166
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 6 with 27 rules applied. Total rules applied 397 place count 91 transition count 166
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 402 place count 91 transition count 161
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 408 place count 85 transition count 149
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 7 with 6 rules applied. Total rules applied 414 place count 85 transition count 149
Deduced a syphon composed of 42 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 7 with 19 rules applied. Total rules applied 433 place count 85 transition count 130
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 434 place count 84 transition count 129
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 435 place count 84 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 436 place count 84 transition count 149
Deduced a syphon composed of 42 places in 0 ms
Applied a total of 436 rules in 71 ms. Remains 84 /204 variables (removed 120) and now considering 149/268 (removed 119) transitions.
[2024-06-02 18:22:11] [INFO ] Redundant transitions in 7 ms returned []
Running 148 sub problems to find dead transitions.
[2024-06-02 18:22:11] [INFO ] Flow matrix only has 146 transitions (discarded 3 similar events)
// Phase 1: matrix 146 rows 84 cols
[2024-06-02 18:22:11] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 18:22:11] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-06-02 18:22:12] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-02 18:22:12] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-02 18:22:12] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-02 18:22:12] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-06-02 18:22:12] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-06-02 18:22:12] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 2 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 6/11 constraints. Problems are: Problem set: 9 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/11 constraints. Problems are: Problem set: 9 solved, 139 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
At refinement iteration 4 (OVERLAPS) 145/229 variables, 84/95 constraints. Problems are: Problem set: 70 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 14/109 constraints. Problems are: Problem set: 70 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/109 constraints. Problems are: Problem set: 70 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 1/230 variables, 1/110 constraints. Problems are: Problem set: 70 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/110 constraints. Problems are: Problem set: 70 solved, 78 unsolved
At refinement iteration 9 (OVERLAPS) 0/230 variables, 0/110 constraints. Problems are: Problem set: 70 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 110 constraints, problems are : Problem set: 70 solved, 78 unsolved in 2918 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 84/84 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 70 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 70 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 10/51 variables, 5/5 constraints. Problems are: Problem set: 70 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 6/11 constraints. Problems are: Problem set: 70 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 70 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 140/191 variables, 51/62 constraints. Problems are: Problem set: 70 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 14/76 constraints. Problems are: Problem set: 70 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 78/154 constraints. Problems are: Problem set: 70 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/154 constraints. Problems are: Problem set: 70 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 38/229 variables, 33/187 constraints. Problems are: Problem set: 70 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 0/187 constraints. Problems are: Problem set: 70 solved, 78 unsolved
At refinement iteration 10 (OVERLAPS) 1/230 variables, 1/188 constraints. Problems are: Problem set: 70 solved, 78 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 0/188 constraints. Problems are: Problem set: 70 solved, 78 unsolved
At refinement iteration 12 (OVERLAPS) 0/230 variables, 0/188 constraints. Problems are: Problem set: 70 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 188 constraints, problems are : Problem set: 70 solved, 78 unsolved in 2619 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 84/84 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 78/148 constraints, Known Traps: 6/6 constraints]
After SMT, in 5610ms problems are : Problem set: 70 solved, 78 unsolved
Search for dead transitions found 70 dead transitions in 5611ms
Found 70 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 70 transitions
Dead transitions reduction (with SMT) removed 70 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 84/204 places, 79/268 transitions.
Graph (complete) has 171 edges and 84 vertex of which 42 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1 ms
Discarding 42 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 42 /84 variables (removed 42) and now considering 79/79 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 42/204 places, 79/268 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5698 ms. Remains : 42/204 places, 79/268 transitions.
Support contains 4 out of 204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 268/268 transitions.
Applied a total of 0 rules in 3 ms. Remains 204 /204 variables (removed 0) and now considering 268/268 (removed 0) transitions.
// Phase 1: matrix 268 rows 204 cols
[2024-06-02 18:22:17] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 18:22:17] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 18:22:17] [INFO ] Invariant cache hit.
[2024-06-02 18:22:17] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 267 sub problems to find dead transitions.
[2024-06-02 18:22:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-06-02 18:22:19] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:22:19] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-06-02 18:22:20] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 268/472 variables, 204/212 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-06-02 18:22:22] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 12 ms to minimize.
[2024-06-02 18:22:22] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (OVERLAPS) 0/472 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 214 constraints, problems are : Problem set: 0 solved, 267 unsolved in 11195 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 267 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 268/472 variables, 204/214 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 267/481 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (OVERLAPS) 0/472 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 481 constraints, problems are : Problem set: 0 solved, 267 unsolved in 10987 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 5/5 constraints]
After SMT, in 22239ms problems are : Problem set: 0 solved, 267 unsolved
Search for dead transitions found 0 dead transitions in 22241ms
Finished structural reductions in LTL mode , in 1 iterations and 22425 ms. Remains : 204/204 places, 268/268 transitions.
Treatment of property CO4-PT-08-LTLCardinality-00 finished in 78502 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 X(!p1)))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 307/307 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 234 transition count 306
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 217 transition count 284
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 217 transition count 284
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 45 place count 208 transition count 273
Iterating global reduction 1 with 9 rules applied. Total rules applied 54 place count 208 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 55 place count 208 transition count 272
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 204 transition count 268
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 204 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 204 transition count 267
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 66 place count 202 transition count 265
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 202 transition count 265
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 70 place count 202 transition count 263
Applied a total of 70 rules in 15 ms. Remains 202 /235 variables (removed 33) and now considering 263/307 (removed 44) transitions.
// Phase 1: matrix 263 rows 202 cols
[2024-06-02 18:22:39] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:22:39] [INFO ] Implicit Places using invariants in 165 ms returned [138]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 174 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 201/235 places, 263/307 transitions.
Applied a total of 0 rules in 4 ms. Remains 201 /201 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 193 ms. Remains : 201/235 places, 263/307 transitions.
Stuttering acceptance computed with spot in 150 ms :[p1, true, p1, p1]
Running random walk in product with property : CO4-PT-08-LTLCardinality-02
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 1 ms.
FORMULA CO4-PT-08-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-08-LTLCardinality-02 finished in 362 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(F(p1)))))'
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 307/307 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 218 transition count 285
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 218 transition count 285
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 44 place count 208 transition count 273
Iterating global reduction 0 with 10 rules applied. Total rules applied 54 place count 208 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 208 transition count 272
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 59 place count 204 transition count 268
Iterating global reduction 1 with 4 rules applied. Total rules applied 63 place count 204 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 204 transition count 267
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 202 transition count 265
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 202 transition count 265
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 70 place count 202 transition count 263
Applied a total of 70 rules in 9 ms. Remains 202 /235 variables (removed 33) and now considering 263/307 (removed 44) transitions.
// Phase 1: matrix 263 rows 202 cols
[2024-06-02 18:22:40] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:22:40] [INFO ] Implicit Places using invariants in 67 ms returned [136]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 68 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 201/235 places, 263/307 transitions.
Applied a total of 0 rules in 2 ms. Remains 201 /201 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 79 ms. Remains : 201/235 places, 263/307 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : CO4-PT-08-LTLCardinality-04
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 0 ms.
FORMULA CO4-PT-08-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-08-LTLCardinality-04 finished in 217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(!p0) U ((!p1&&X(!p0))||X(G(!p0)))) U X(X((G(p2)||F(G(p1)))))))'
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 307/307 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 234 transition count 306
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 17 place count 219 transition count 286
Iterating global reduction 1 with 15 rules applied. Total rules applied 32 place count 219 transition count 286
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 41 place count 210 transition count 276
Iterating global reduction 1 with 9 rules applied. Total rules applied 50 place count 210 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 210 transition count 275
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 208 transition count 273
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 208 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 208 transition count 272
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 207 transition count 271
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 207 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 59 place count 207 transition count 270
Applied a total of 59 rules in 9 ms. Remains 207 /235 variables (removed 28) and now considering 270/307 (removed 37) transitions.
// Phase 1: matrix 270 rows 207 cols
[2024-06-02 18:22:40] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 18:22:40] [INFO ] Implicit Places using invariants in 104 ms returned [141]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 121 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 206/235 places, 270/307 transitions.
Applied a total of 0 rules in 2 ms. Remains 206 /206 variables (removed 0) and now considering 270/270 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 132 ms. Remains : 206/235 places, 270/307 transitions.
Stuttering acceptance computed with spot in 389 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : CO4-PT-08-LTLCardinality-05
Product exploration explored 100000 steps with 108 reset in 66 ms.
Product exploration explored 100000 steps with 0 reset in 113 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 367 edges and 206 vertex of which 203 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (AND p1 (NOT p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 222 ms. Reduced automaton from 11 states, 28 edges and 3 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
RANDOM walk for 40000 steps (212 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
BEST_FIRST walk for 30401 steps (100 resets) in 25 ms. (1169 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (AND p1 (NOT p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 13 factoid took 163 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Support contains 2 out of 206 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 270/270 transitions.
Graph (trivial) has 209 edges and 206 vertex of which 2 / 206 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 366 edges and 205 vertex of which 202 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 201 transition count 200
Reduce places removed 65 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 69 rules applied. Total rules applied 136 place count 136 transition count 196
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 138 place count 134 transition count 196
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 138 place count 134 transition count 174
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 182 place count 112 transition count 174
Performed 35 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 252 place count 77 transition count 130
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 257 place count 77 transition count 125
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 259 place count 75 transition count 123
Iterating global reduction 4 with 2 rules applied. Total rules applied 261 place count 75 transition count 123
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 265 place count 73 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 267 place count 73 transition count 119
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 293 place count 60 transition count 122
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 299 place count 60 transition count 116
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 308 place count 51 transition count 98
Iterating global reduction 6 with 9 rules applied. Total rules applied 317 place count 51 transition count 98
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 322 place count 51 transition count 93
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 323 place count 50 transition count 90
Iterating global reduction 7 with 1 rules applied. Total rules applied 324 place count 50 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 326 place count 49 transition count 102
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 335 place count 49 transition count 93
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 336 place count 49 transition count 93
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 338 place count 47 transition count 91
Applied a total of 338 rules in 43 ms. Remains 47 /206 variables (removed 159) and now considering 91/270 (removed 179) transitions.
[2024-06-02 18:22:41] [INFO ] Flow matrix only has 85 transitions (discarded 6 similar events)
// Phase 1: matrix 85 rows 47 cols
[2024-06-02 18:22:41] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 18:22:41] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-02 18:22:41] [INFO ] Flow matrix only has 85 transitions (discarded 6 similar events)
[2024-06-02 18:22:41] [INFO ] Invariant cache hit.
[2024-06-02 18:22:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:22:41] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2024-06-02 18:22:41] [INFO ] Redundant transitions in 1 ms returned []
Running 76 sub problems to find dead transitions.
[2024-06-02 18:22:41] [INFO ] Flow matrix only has 85 transitions (discarded 6 similar events)
[2024-06-02 18:22:41] [INFO ] Invariant cache hit.
[2024-06-02 18:22:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 84/131 variables, 47/51 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 1/132 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 0/132 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 52 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1090 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 84/131 variables, 47/51 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 76/127 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 1/132 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/132 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 128 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1288 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
After SMT, in 2441ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 2443ms
Starting structural reductions in SI_LTL mode, iteration 1 : 47/206 places, 91/270 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2665 ms. Remains : 47/206 places, 91/270 transitions.
Computed a total of 7 stabilizing places and 11 stable transitions
Computed a total of 7 stabilizing places and 11 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
RANDOM walk for 1018 steps (119 resets) in 7 ms. (127 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Product exploration explored 100000 steps with 109 reset in 134 ms.
Product exploration explored 100000 steps with 55 reset in 63 ms.
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 91/91 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 46 transition count 90
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 46 transition count 88
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 6 place count 44 transition count 88
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 10 place count 42 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 42 transition count 84
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 13 place count 41 transition count 82
Iterating global reduction 3 with 1 rules applied. Total rules applied 14 place count 41 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 16 place count 41 transition count 80
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 17 place count 40 transition count 78
Iterating global reduction 4 with 1 rules applied. Total rules applied 18 place count 40 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 20 place count 40 transition count 76
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 5 with 2 rules applied. Total rules applied 22 place count 39 transition count 76
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 26 place count 39 transition count 72
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 27 place count 39 transition count 71
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 28 place count 38 transition count 69
Iterating global reduction 6 with 1 rules applied. Total rules applied 29 place count 38 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 31 place count 38 transition count 67
Applied a total of 31 rules in 34 ms. Remains 38 /47 variables (removed 9) and now considering 67/91 (removed 24) transitions.
[2024-06-02 18:22:44] [INFO ] Flow matrix only has 63 transitions (discarded 4 similar events)
// Phase 1: matrix 63 rows 38 cols
[2024-06-02 18:22:44] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:22:44] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-02 18:22:44] [INFO ] Flow matrix only has 63 transitions (discarded 4 similar events)
[2024-06-02 18:22:44] [INFO ] Invariant cache hit.
[2024-06-02 18:22:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:22:44] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2024-06-02 18:22:44] [INFO ] Redundant transitions in 1 ms returned []
Running 52 sub problems to find dead transitions.
[2024-06-02 18:22:44] [INFO ] Flow matrix only has 63 transitions (discarded 4 similar events)
[2024-06-02 18:22:44] [INFO ] Invariant cache hit.
[2024-06-02 18:22:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 62/100 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 1/101 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 0/101 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 43 constraints, problems are : Problem set: 0 solved, 52 unsolved in 658 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 38/38 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 62/100 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 52/94 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 1/101 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 0/101 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 95 constraints, problems are : Problem set: 0 solved, 52 unsolved in 798 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 38/38 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 1487ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1487ms
Starting structural reductions in SI_LTL mode, iteration 1 : 38/47 places, 67/91 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1652 ms. Remains : 38/47 places, 67/91 transitions.
Treatment of property CO4-PT-08-LTLCardinality-05 finished in 6190 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(F(!p0))||(F(!p0)&&X(!p1)))))'
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 307/307 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 234 transition count 306
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 17 place count 219 transition count 286
Iterating global reduction 1 with 15 rules applied. Total rules applied 32 place count 219 transition count 286
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 39 place count 212 transition count 278
Iterating global reduction 1 with 7 rules applied. Total rules applied 46 place count 212 transition count 278
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 209 transition count 275
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 209 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 53 place count 209 transition count 274
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 208 transition count 273
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 208 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 208 transition count 272
Applied a total of 56 rules in 17 ms. Remains 208 /235 variables (removed 27) and now considering 272/307 (removed 35) transitions.
// Phase 1: matrix 272 rows 208 cols
[2024-06-02 18:22:46] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:22:47] [INFO ] Implicit Places using invariants in 598 ms returned [138]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 599 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 207/235 places, 272/307 transitions.
Applied a total of 0 rules in 1 ms. Remains 207 /207 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 617 ms. Remains : 207/235 places, 272/307 transitions.
Stuttering acceptance computed with spot in 96 ms :[p0, (AND p1 p0), p0]
Running random walk in product with property : CO4-PT-08-LTLCardinality-10
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 0 ms.
FORMULA CO4-PT-08-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-08-LTLCardinality-10 finished in 761 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(p0)||G(p1))))))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 307/307 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 234 transition count 306
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 217 transition count 285
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 217 transition count 285
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 46 place count 207 transition count 273
Iterating global reduction 1 with 10 rules applied. Total rules applied 56 place count 207 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 207 transition count 272
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 61 place count 203 transition count 268
Iterating global reduction 2 with 4 rules applied. Total rules applied 65 place count 203 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 203 transition count 267
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 68 place count 201 transition count 265
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 201 transition count 265
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 72 place count 201 transition count 263
Applied a total of 72 rules in 11 ms. Remains 201 /235 variables (removed 34) and now considering 263/307 (removed 44) transitions.
// Phase 1: matrix 263 rows 201 cols
[2024-06-02 18:22:47] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 18:22:47] [INFO ] Implicit Places using invariants in 56 ms returned [137]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/235 places, 263/307 transitions.
Applied a total of 0 rules in 2 ms. Remains 200 /200 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 200/235 places, 263/307 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-08-LTLCardinality-12
Product exploration explored 100000 steps with 25000 reset in 128 ms.
Product exploration explored 100000 steps with 25000 reset in 143 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 360 edges and 200 vertex of which 197 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 89 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (516 resets) in 86 ms. (459 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40000 steps (80 resets) in 66 ms. (597 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (202 resets) in 37 ms. (1052 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (317 resets) in 23 ms. (1666 steps per ms) remains 1/3 properties
// Phase 1: matrix 263 rows 200 cols
[2024-06-02 18:22:48] [INFO ] Computed 4 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/27 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/89 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 188/277 variables, 66/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 147/424 variables, 83/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 30/454 variables, 19/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/454 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 9/463 variables, 5/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/463 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/463 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 204 constraints, problems are : Problem set: 0 solved, 1 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 200/200 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/27 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/89 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 188/277 variables, 66/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 147/424 variables, 83/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 30/454 variables, 19/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/454 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 9/463 variables, 5/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/463 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/463 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 205 constraints, problems are : Problem set: 0 solved, 1 unsolved in 134 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 272ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 38 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=38 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 149 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 217 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 263/263 transitions.
Applied a total of 0 rules in 2 ms. Remains 200 /200 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2024-06-02 18:22:49] [INFO ] Invariant cache hit.
[2024-06-02 18:22:49] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-02 18:22:49] [INFO ] Invariant cache hit.
[2024-06-02 18:22:49] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-06-02 18:22:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-02 18:22:51] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:22:51] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 263/463 variables, 200/206 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-02 18:22:53] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/463 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 207 constraints, problems are : Problem set: 0 solved, 262 unsolved in 10489 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 263/463 variables, 200/207 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 262/469 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/463 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 469 constraints, problems are : Problem set: 0 solved, 262 unsolved in 10163 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 3/3 constraints]
After SMT, in 20691ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 20693ms
Finished structural reductions in LTL mode , in 1 iterations and 20871 ms. Remains : 200/200 places, 263/263 transitions.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 360 edges and 200 vertex of which 197 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 70 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (388 resets) in 96 ms. (412 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40000 steps (194 resets) in 64 ms. (615 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40000 steps (133 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
[2024-06-02 18:23:10] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/27 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/89 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 188/277 variables, 66/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 147/424 variables, 83/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 30/454 variables, 19/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/454 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 9/463 variables, 5/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/463 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/463 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 204 constraints, problems are : Problem set: 0 solved, 1 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 200/200 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/27 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/89 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 188/277 variables, 66/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 147/424 variables, 83/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:23:10] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 30/454 variables, 19/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/454 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 9/463 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/463 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/463 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 206 constraints, problems are : Problem set: 0 solved, 1 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 341ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 23 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 202 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 218 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 85 ms.
Product exploration explored 100000 steps with 25000 reset in 86 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 263/263 transitions.
Graph (trivial) has 207 edges and 200 vertex of which 2 / 200 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 359 edges and 199 vertex of which 196 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 196 transition count 259
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 69 place count 196 transition count 257
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 69 place count 196 transition count 276
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 89 place count 196 transition count 276
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 105 place count 180 transition count 260
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 121 place count 180 transition count 260
Performed 31 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 2 with 31 rules applied. Total rules applied 152 place count 180 transition count 281
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 158 place count 180 transition count 275
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 174 place count 164 transition count 257
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 3 with 16 rules applied. Total rules applied 190 place count 164 transition count 257
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 191 place count 164 transition count 257
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 193 place count 164 transition count 255
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 196 place count 161 transition count 252
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 199 place count 161 transition count 252
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: -91
Deduced a syphon composed of 107 places in 0 ms
Iterating global reduction 4 with 23 rules applied. Total rules applied 222 place count 161 transition count 343
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 244 place count 161 transition count 321
Discarding 45 places :
Symmetric choice reduction at 5 with 45 rule applications. Total rules 289 place count 116 transition count 217
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 5 with 45 rules applied. Total rules applied 334 place count 116 transition count 217
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 344 place count 116 transition count 207
Discarding 29 places :
Symmetric choice reduction at 6 with 29 rule applications. Total rules 373 place count 87 transition count 153
Deduced a syphon composed of 47 places in 1 ms
Iterating global reduction 6 with 29 rules applied. Total rules applied 402 place count 87 transition count 153
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 405 place count 87 transition count 150
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 411 place count 81 transition count 138
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 7 with 6 rules applied. Total rules applied 417 place count 81 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 418 place count 81 transition count 153
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 421 place count 81 transition count 150
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 424 place count 78 transition count 132
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 427 place count 78 transition count 132
Deduced a syphon composed of 39 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 437 place count 78 transition count 122
Deduced a syphon composed of 39 places in 0 ms
Applied a total of 437 rules in 33 ms. Remains 78 /200 variables (removed 122) and now considering 122/263 (removed 141) transitions.
[2024-06-02 18:23:12] [INFO ] Redundant transitions in 2 ms returned []
Running 121 sub problems to find dead transitions.
[2024-06-02 18:23:12] [INFO ] Flow matrix only has 118 transitions (discarded 4 similar events)
// Phase 1: matrix 118 rows 78 cols
[2024-06-02 18:23:12] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:23:12] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-02 18:23:12] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD5 is UNSAT
[2024-06-02 18:23:12] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-02 18:23:12] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-06-02 18:23:12] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 4/8 constraints. Problems are: Problem set: 9 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/8 constraints. Problems are: Problem set: 9 solved, 112 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
At refinement iteration 4 (OVERLAPS) 117/195 variables, 78/86 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 13/99 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/99 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 1/196 variables, 1/100 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/100 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/100 constraints. Problems are: Problem set: 62 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 100 constraints, problems are : Problem set: 62 solved, 59 unsolved in 1959 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 78/78 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 62 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 10/48 variables, 4/4 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 4/8 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/8 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 112/160 variables, 48/56 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 13/69 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 59/128 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/128 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 35/195 variables, 30/158 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/158 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 1/196 variables, 1/159 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 0/159 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 12 (OVERLAPS) 0/196 variables, 0/159 constraints. Problems are: Problem set: 62 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 159 constraints, problems are : Problem set: 62 solved, 59 unsolved in 1605 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 78/78 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 59/121 constraints, Known Traps: 4/4 constraints]
After SMT, in 3584ms problems are : Problem set: 62 solved, 59 unsolved
Search for dead transitions found 62 dead transitions in 3585ms
Found 62 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 62 transitions
Dead transitions reduction (with SMT) removed 62 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 78/200 places, 60/263 transitions.
Graph (complete) has 127 edges and 78 vertex of which 39 are kept as prefixes of interest. Removing 39 places using SCC suffix rule.0 ms
Discarding 39 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 39 transition count 76
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 5 ms. Remains 39 /78 variables (removed 39) and now considering 76/60 (removed -16) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/200 places, 76/263 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3630 ms. Remains : 39/200 places, 76/263 transitions.
Support contains 3 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 263/263 transitions.
Applied a total of 0 rules in 3 ms. Remains 200 /200 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 200 cols
[2024-06-02 18:23:15] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 18:23:15] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 18:23:15] [INFO ] Invariant cache hit.
[2024-06-02 18:23:15] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-06-02 18:23:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-02 18:23:17] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:23:17] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 263/463 variables, 200/206 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-02 18:23:20] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/463 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 207 constraints, problems are : Problem set: 0 solved, 262 unsolved in 10583 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 263/463 variables, 200/207 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 262/469 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/463 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 469 constraints, problems are : Problem set: 0 solved, 262 unsolved in 10115 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 3/3 constraints]
After SMT, in 20756ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 20758ms
Finished structural reductions in LTL mode , in 1 iterations and 20918 ms. Remains : 200/200 places, 263/263 transitions.
Treatment of property CO4-PT-08-LTLCardinality-12 finished in 49285 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(p1))))'
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 307/307 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 234 transition count 306
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 217 transition count 284
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 217 transition count 284
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 46 place count 207 transition count 272
Iterating global reduction 1 with 10 rules applied. Total rules applied 56 place count 207 transition count 272
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 207 transition count 271
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 61 place count 203 transition count 267
Iterating global reduction 2 with 4 rules applied. Total rules applied 65 place count 203 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 203 transition count 266
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 68 place count 201 transition count 264
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 201 transition count 264
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 72 place count 201 transition count 262
Applied a total of 72 rules in 12 ms. Remains 201 /235 variables (removed 34) and now considering 262/307 (removed 45) transitions.
// Phase 1: matrix 262 rows 201 cols
[2024-06-02 18:23:36] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 18:23:36] [INFO ] Implicit Places using invariants in 65 ms returned [139]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/235 places, 262/307 transitions.
Applied a total of 0 rules in 2 ms. Remains 200 /200 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 81 ms. Remains : 200/235 places, 262/307 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-08-LTLCardinality-13
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 1 ms.
FORMULA CO4-PT-08-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-08-LTLCardinality-13 finished in 198 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((G(F(p0)) U G(p1)))))'
Found a Lengthening insensitive property : CO4-PT-08-LTLCardinality-00
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 235/235 places, 307/307 transitions.
Graph (trivial) has 243 edges and 235 vertex of which 2 / 235 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 433 edges and 234 vertex of which 230 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 89 rules applied. Total rules applied 91 place count 229 transition count 213
Reduce places removed 88 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 94 rules applied. Total rules applied 185 place count 141 transition count 207
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 188 place count 139 transition count 206
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 188 place count 139 transition count 190
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 220 place count 123 transition count 190
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 225 place count 118 transition count 183
Iterating global reduction 3 with 5 rules applied. Total rules applied 230 place count 118 transition count 183
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 230 place count 118 transition count 181
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 234 place count 116 transition count 181
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 236 place count 114 transition count 178
Iterating global reduction 3 with 2 rules applied. Total rules applied 238 place count 114 transition count 178
Performed 37 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 312 place count 77 transition count 134
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 318 place count 77 transition count 128
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 320 place count 75 transition count 126
Iterating global reduction 4 with 2 rules applied. Total rules applied 322 place count 75 transition count 126
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 328 place count 72 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 331 place count 72 transition count 120
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 359 place count 58 transition count 123
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 366 place count 58 transition count 116
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 377 place count 47 transition count 94
Iterating global reduction 6 with 11 rules applied. Total rules applied 388 place count 47 transition count 94
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 394 place count 47 transition count 88
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 397 place count 44 transition count 79
Iterating global reduction 7 with 3 rules applied. Total rules applied 400 place count 44 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 402 place count 44 transition count 77
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 406 place count 44 transition count 77
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 410 place count 44 transition count 73
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 412 place count 42 transition count 71
Applied a total of 412 rules in 25 ms. Remains 42 /235 variables (removed 193) and now considering 71/307 (removed 236) transitions.
[2024-06-02 18:23:37] [INFO ] Flow matrix only has 67 transitions (discarded 4 similar events)
// Phase 1: matrix 67 rows 42 cols
[2024-06-02 18:23:37] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 18:23:37] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-02 18:23:37] [INFO ] Flow matrix only has 67 transitions (discarded 4 similar events)
[2024-06-02 18:23:37] [INFO ] Invariant cache hit.
[2024-06-02 18:23:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:23:37] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Running 54 sub problems to find dead transitions.
[2024-06-02 18:23:37] [INFO ] Flow matrix only has 67 transitions (discarded 4 similar events)
[2024-06-02 18:23:37] [INFO ] Invariant cache hit.
[2024-06-02 18:23:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 66/108 variables, 42/47 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 1/109 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 0/109 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 48 constraints, problems are : Problem set: 0 solved, 54 unsolved in 599 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 66/108 variables, 42/47 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 54/101 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 1/109 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 0/109 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 102 constraints, problems are : Problem set: 0 solved, 54 unsolved in 807 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
After SMT, in 1426ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 1426ms
Starting structural reductions in LI_LTL mode, iteration 1 : 42/235 places, 71/307 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1532 ms. Remains : 42/235 places, 71/307 transitions.
Running random walk in product with property : CO4-PT-08-LTLCardinality-00
Product exploration explored 100000 steps with 7 reset in 73 ms.
Product exploration explored 100000 steps with 441 reset in 72 ms.
Computed a total of 8 stabilizing places and 23 stable transitions
Computed a total of 8 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 131 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (4949 resets) in 77 ms. (512 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (602 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
[2024-06-02 18:23:39] [INFO ] Flow matrix only has 67 transitions (discarded 4 similar events)
[2024-06-02 18:23:39] [INFO ] Invariant cache hit.
[2024-06-02 18:23:39] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 4/109 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 17 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/42 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 20ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 205 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 237 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Support contains 4 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 71/71 transitions.
Applied a total of 0 rules in 0 ms. Remains 42 /42 variables (removed 0) and now considering 71/71 (removed 0) transitions.
[2024-06-02 18:23:39] [INFO ] Flow matrix only has 67 transitions (discarded 4 similar events)
[2024-06-02 18:23:39] [INFO ] Invariant cache hit.
[2024-06-02 18:23:39] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-02 18:23:39] [INFO ] Flow matrix only has 67 transitions (discarded 4 similar events)
[2024-06-02 18:23:39] [INFO ] Invariant cache hit.
[2024-06-02 18:23:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:23:39] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Running 54 sub problems to find dead transitions.
[2024-06-02 18:23:39] [INFO ] Flow matrix only has 67 transitions (discarded 4 similar events)
[2024-06-02 18:23:39] [INFO ] Invariant cache hit.
[2024-06-02 18:23:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 66/108 variables, 42/47 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 1/109 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 0/109 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 48 constraints, problems are : Problem set: 0 solved, 54 unsolved in 621 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 66/108 variables, 42/47 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 54/101 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 1/109 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 0/109 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 102 constraints, problems are : Problem set: 0 solved, 54 unsolved in 773 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
After SMT, in 1411ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 1411ms
Finished structural reductions in LTL mode , in 1 iterations and 1496 ms. Remains : 42/42 places, 71/71 transitions.
Computed a total of 8 stabilizing places and 23 stable transitions
Computed a total of 8 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
RANDOM walk for 1164 steps (137 resets) in 7 ms. (145 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 162 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 217 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20 reset in 59 ms.
Product exploration explored 100000 steps with 11 reset in 58 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 229 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Support contains 4 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 71/71 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 42 transition count 64
Applied a total of 7 rules in 5 ms. Remains 42 /42 variables (removed 0) and now considering 64/71 (removed 7) transitions.
[2024-06-02 18:23:43] [INFO ] Redundant transitions in 0 ms returned []
Running 49 sub problems to find dead transitions.
[2024-06-02 18:23:43] [INFO ] Flow matrix only has 60 transitions (discarded 4 similar events)
// Phase 1: matrix 60 rows 42 cols
[2024-06-02 18:23:43] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 18:23:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 59/101 variables, 42/47 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 1/102 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 0/102 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 48 constraints, problems are : Problem set: 0 solved, 49 unsolved in 607 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 59/101 variables, 42/47 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 49/96 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 1/102 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 0/102 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 97 constraints, problems are : Problem set: 0 solved, 49 unsolved in 665 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
After SMT, in 1285ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 1286ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/42 places, 64/71 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1299 ms. Remains : 42/42 places, 64/71 transitions.
Support contains 4 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 71/71 transitions.
Applied a total of 0 rules in 0 ms. Remains 42 /42 variables (removed 0) and now considering 71/71 (removed 0) transitions.
[2024-06-02 18:23:44] [INFO ] Flow matrix only has 67 transitions (discarded 4 similar events)
// Phase 1: matrix 67 rows 42 cols
[2024-06-02 18:23:44] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 18:23:44] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-02 18:23:44] [INFO ] Flow matrix only has 67 transitions (discarded 4 similar events)
[2024-06-02 18:23:44] [INFO ] Invariant cache hit.
[2024-06-02 18:23:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:23:44] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Running 54 sub problems to find dead transitions.
[2024-06-02 18:23:44] [INFO ] Flow matrix only has 67 transitions (discarded 4 similar events)
[2024-06-02 18:23:44] [INFO ] Invariant cache hit.
[2024-06-02 18:23:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 66/108 variables, 42/47 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 1/109 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 0/109 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 48 constraints, problems are : Problem set: 0 solved, 54 unsolved in 668 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 66/108 variables, 42/47 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 54/101 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 1/109 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 0/109 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 102 constraints, problems are : Problem set: 0 solved, 54 unsolved in 771 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
After SMT, in 1462ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 1464ms
Finished structural reductions in LTL mode , in 1 iterations and 1548 ms. Remains : 42/42 places, 71/71 transitions.
Treatment of property CO4-PT-08-LTLCardinality-00 finished in 9107 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(!p0) U ((!p1&&X(!p0))||X(G(!p0)))) U X(X((G(p2)||F(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' '!(X(X(X((F(p0)||G(p1))))))'
[2024-06-02 18:23:46] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:23:46] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-02 18:23:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 235 places, 307 transitions and 746 arcs took 20 ms.
Total runtime 148898 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running CO4-PT-08
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: 235
TRANSITIONS: 307
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.004s]
SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1744
MODEL NAME: /home/mcc/execution/411/model
235 places, 307 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 CO4-PT-08-LTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CO4-PT-08-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CO4-PT-08-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1717352833908
--------------------
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
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="CO4-PT-08"
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 CO4-PT-08, 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 r549-tall-171734897700059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-08.tgz
mv CO4-PT-08 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 ;