About the Execution of ITS-Tools for ShieldIIPs-PT-010B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 11799.355 | 3600000.00 | 9171398.00 | 4385.40 | FFTFT?TTTFT???FF | 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.r356-tall-171683760300092.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 itstools
Input is ShieldIIPs-PT-010B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760300092
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 14:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 11 14:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 11 14:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 11 14:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 164K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716893455169
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-010B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-28 10:50:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 10:50:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 10:50:56] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2024-05-28 10:50:56] [INFO ] Transformed 603 places.
[2024-05-28 10:50:56] [INFO ] Transformed 593 transitions.
[2024-05-28 10:50:56] [INFO ] Found NUPN structural information;
[2024-05-28 10:50:56] [INFO ] Parsed PT model containing 603 places and 593 transitions and 1786 arcs in 230 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldIIPs-PT-010B-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010B-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010B-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 603/603 places, 593/593 transitions.
Discarding 67 places :
Symmetric choice reduction at 0 with 67 rule applications. Total rules 67 place count 536 transition count 526
Iterating global reduction 0 with 67 rules applied. Total rules applied 134 place count 536 transition count 526
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 135 place count 535 transition count 525
Iterating global reduction 0 with 1 rules applied. Total rules applied 136 place count 535 transition count 525
Applied a total of 136 rules in 125 ms. Remains 535 /603 variables (removed 68) and now considering 525/593 (removed 68) transitions.
// Phase 1: matrix 525 rows 535 cols
[2024-05-28 10:50:56] [INFO ] Computed 91 invariants in 25 ms
[2024-05-28 10:50:57] [INFO ] Implicit Places using invariants in 397 ms returned []
[2024-05-28 10:50:57] [INFO ] Invariant cache hit.
[2024-05-28 10:50:57] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
Running 524 sub problems to find dead transitions.
[2024-05-28 10:50:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (OVERLAPS) 1/535 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-05-28 10:51:06] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 12 ms to minimize.
[2024-05-28 10:51:06] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 2 ms to minimize.
[2024-05-28 10:51:06] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-05-28 10:51:06] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 2 ms to minimize.
[2024-05-28 10:51:06] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 2 ms to minimize.
[2024-05-28 10:51:06] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
[2024-05-28 10:51:07] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 3 ms to minimize.
[2024-05-28 10:51:07] [INFO ] Deduced a trap composed of 51 places in 133 ms of which 3 ms to minimize.
[2024-05-28 10:51:07] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 3 ms to minimize.
[2024-05-28 10:51:07] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 2 ms to minimize.
[2024-05-28 10:51:08] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 3 ms to minimize.
[2024-05-28 10:51:08] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-28 10:51:08] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 2 ms to minimize.
[2024-05-28 10:51:08] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:51:08] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-28 10:51:08] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:51:08] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-28 10:51:08] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:51:08] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 3 ms to minimize.
[2024-05-28 10:51:08] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/535 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-05-28 10:51:10] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 3 ms to minimize.
[2024-05-28 10:51:10] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
[2024-05-28 10:51:10] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 3 ms to minimize.
[2024-05-28 10:51:10] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:51:10] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 2 ms to minimize.
[2024-05-28 10:51:10] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2024-05-28 10:51:10] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 4 ms to minimize.
[2024-05-28 10:51:11] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-28 10:51:11] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:51:11] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2024-05-28 10:51:11] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-28 10:51:11] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:51:11] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:51:11] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 3 ms to minimize.
[2024-05-28 10:51:11] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-28 10:51:11] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-28 10:51:11] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-28 10:51:11] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:51:11] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:51:11] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/535 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-05-28 10:51:17] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-28 10:51:17] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:51:17] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-28 10:51:17] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-28 10:51:17] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-28 10:51:17] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
[2024-05-28 10:51:18] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 3 ms to minimize.
[2024-05-28 10:51:18] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 4 ms to minimize.
[2024-05-28 10:51:18] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 3 ms to minimize.
[2024-05-28 10:51:18] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-28 10:51:18] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:51:18] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-28 10:51:18] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:51:18] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:51:19] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2024-05-28 10:51:19] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 5 ms to minimize.
[2024-05-28 10:51:19] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 2 ms to minimize.
[2024-05-28 10:51:19] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-28 10:51:19] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-28 10:51:19] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-05-28 10:51:20] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 2 ms to minimize.
[2024-05-28 10:51:21] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 3 ms to minimize.
[2024-05-28 10:51:21] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-28 10:51:22] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:51:22] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-28 10:51:22] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:51:22] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:51:22] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:51:22] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:51:22] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 0 ms to minimize.
[2024-05-28 10:51:22] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 3 ms to minimize.
[2024-05-28 10:51:22] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 3 ms to minimize.
[2024-05-28 10:51:22] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 2 ms to minimize.
[2024-05-28 10:51:23] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-05-28 10:51:23] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-28 10:51:23] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-28 10:51:23] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:51:23] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:51:23] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:51:23] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-05-28 10:51:25] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2024-05-28 10:51:25] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:51:25] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:51:26] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:51:26] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-28 10:51:26] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-28 10:51:26] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-28 10:51:26] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:51:26] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2024-05-28 10:51:26] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:51:26] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:51:26] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 2 ms to minimize.
[2024-05-28 10:51:26] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 2 ms to minimize.
[2024-05-28 10:51:26] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-28 10:51:26] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:51:27] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:51:27] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:51:27] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:51:27] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-28 10:51:27] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 535/1060 variables, and 191 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/535 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 524 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (OVERLAPS) 1/535 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/535 variables, 100/191 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-05-28 10:51:33] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-28 10:51:33] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:51:33] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:51:33] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:51:34] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:51:34] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-28 10:51:34] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 1 ms to minimize.
[2024-05-28 10:51:34] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:51:35] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-05-28 10:51:35] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 2 ms to minimize.
[2024-05-28 10:51:35] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-28 10:51:35] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 2 ms to minimize.
[2024-05-28 10:51:35] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 2 ms to minimize.
[2024-05-28 10:51:36] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 5 ms to minimize.
[2024-05-28 10:51:36] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2024-05-28 10:51:36] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-05-28 10:51:36] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-05-28 10:51:36] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-28 10:51:36] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-28 10:51:36] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/535 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-05-28 10:51:38] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-28 10:51:38] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:51:38] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-28 10:51:38] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-28 10:51:39] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-28 10:51:39] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-28 10:51:39] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
[2024-05-28 10:51:39] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 2 ms to minimize.
[2024-05-28 10:51:39] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-28 10:51:40] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:51:40] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-28 10:51:40] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-05-28 10:51:40] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 2 ms to minimize.
[2024-05-28 10:51:40] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-28 10:51:40] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2024-05-28 10:51:40] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:51:40] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:51:40] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:51:40] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-28 10:51:41] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-05-28 10:51:42] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2024-05-28 10:51:42] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-28 10:51:43] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:51:43] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-28 10:51:43] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 3 ms to minimize.
[2024-05-28 10:51:44] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:51:44] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:51:45] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-05-28 10:51:45] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-28 10:51:45] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 2 ms to minimize.
[2024-05-28 10:51:45] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-28 10:51:45] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-28 10:51:45] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-28 10:51:45] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-28 10:51:45] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-28 10:51:45] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-28 10:51:45] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-28 10:51:46] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-28 10:51:46] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 2 ms to minimize.
[2024-05-28 10:51:46] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-05-28 10:51:48] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-28 10:51:48] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:51:48] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-28 10:51:49] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 3 ms to minimize.
[2024-05-28 10:51:49] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 3 ms to minimize.
[2024-05-28 10:51:49] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 1 ms to minimize.
[2024-05-28 10:51:50] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 2 ms to minimize.
[2024-05-28 10:51:50] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
[2024-05-28 10:51:50] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-28 10:51:50] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-28 10:51:50] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:51:50] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-28 10:51:51] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-28 10:51:51] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-28 10:51:51] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-28 10:51:51] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:51:51] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:51:51] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-28 10:51:51] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-28 10:51:51] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-05-28 10:51:53] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 2 ms to minimize.
[2024-05-28 10:51:53] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 3 ms to minimize.
[2024-05-28 10:51:53] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 4 ms to minimize.
[2024-05-28 10:51:54] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2024-05-28 10:51:54] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:51:54] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-05-28 10:51:54] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-28 10:51:56] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-28 10:51:56] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 2 ms to minimize.
[2024-05-28 10:51:56] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-05-28 10:51:56] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 2 ms to minimize.
[2024-05-28 10:51:57] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-05-28 10:51:57] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
[2024-05-28 10:51:57] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-28 10:51:57] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:51:57] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:51:57] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 535/1060 variables, and 288 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/535 constraints, PredecessorRefiner: 0/524 constraints, Known Traps: 197/197 constraints]
After SMT, in 60191ms problems are : Problem set: 0 solved, 524 unsolved
Search for dead transitions found 0 dead transitions in 60211ms
Starting structural reductions in LTL mode, iteration 1 : 535/603 places, 525/593 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61185 ms. Remains : 535/603 places, 525/593 transitions.
Support contains 43 out of 535 places after structural reductions.
[2024-05-28 10:51:58] [INFO ] Flatten gal took : 68 ms
[2024-05-28 10:51:58] [INFO ] Flatten gal took : 31 ms
[2024-05-28 10:51:58] [INFO ] Input system was already deterministic with 525 transitions.
Support contains 41 out of 535 places (down from 43) after GAL structural reductions.
RANDOM walk for 34030 steps (24 resets) in 1099 ms. (30 steps per ms) remains 0/25 properties
FORMULA ShieldIIPs-PT-010B-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 120 stabilizing places and 120 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 5 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 525/525 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 532 transition count 522
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 532 transition count 522
Applied a total of 6 rules in 32 ms. Remains 532 /535 variables (removed 3) and now considering 522/525 (removed 3) transitions.
// Phase 1: matrix 522 rows 532 cols
[2024-05-28 10:51:59] [INFO ] Computed 91 invariants in 9 ms
[2024-05-28 10:51:59] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-28 10:51:59] [INFO ] Invariant cache hit.
[2024-05-28 10:51:59] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
Running 521 sub problems to find dead transitions.
[2024-05-28 10:51:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (OVERLAPS) 1/532 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 10:52:07] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-28 10:52:07] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-05-28 10:52:07] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-05-28 10:52:08] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2024-05-28 10:52:08] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 2 ms to minimize.
[2024-05-28 10:52:08] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 2 ms to minimize.
[2024-05-28 10:52:08] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 2 ms to minimize.
[2024-05-28 10:52:09] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 2 ms to minimize.
[2024-05-28 10:52:09] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 3 ms to minimize.
[2024-05-28 10:52:09] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 3 ms to minimize.
[2024-05-28 10:52:09] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 3 ms to minimize.
[2024-05-28 10:52:09] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:52:09] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:52:09] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-28 10:52:09] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:52:10] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 6 ms to minimize.
[2024-05-28 10:52:10] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 3 ms to minimize.
[2024-05-28 10:52:10] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:52:10] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:52:10] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 10:52:11] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2024-05-28 10:52:12] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:52:12] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-28 10:52:12] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-28 10:52:12] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:52:12] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-28 10:52:12] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-28 10:52:12] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 3 ms to minimize.
[2024-05-28 10:52:13] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 3 ms to minimize.
[2024-05-28 10:52:13] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-28 10:52:13] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-28 10:52:13] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-28 10:52:13] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-05-28 10:52:13] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:52:13] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:52:13] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:52:13] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:52:13] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:52:13] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2024-05-28 10:52:13] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 10:52:19] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 2 ms to minimize.
[2024-05-28 10:52:19] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 2 ms to minimize.
[2024-05-28 10:52:19] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 3 ms to minimize.
[2024-05-28 10:52:19] [INFO ] Deduced a trap composed of 20 places in 160 ms of which 4 ms to minimize.
[2024-05-28 10:52:19] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 3 ms to minimize.
[2024-05-28 10:52:20] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2024-05-28 10:52:20] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-28 10:52:20] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:52:20] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-28 10:52:20] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-28 10:52:20] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-28 10:52:20] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 2 ms to minimize.
[2024-05-28 10:52:21] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 2 ms to minimize.
[2024-05-28 10:52:21] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-28 10:52:21] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-28 10:52:21] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-05-28 10:52:21] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:52:21] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-28 10:52:21] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 3 ms to minimize.
[2024-05-28 10:52:21] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 10:52:24] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 3 ms to minimize.
[2024-05-28 10:52:24] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-28 10:52:24] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 2 ms to minimize.
[2024-05-28 10:52:24] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 2 ms to minimize.
[2024-05-28 10:52:24] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:52:24] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 2 ms to minimize.
[2024-05-28 10:52:24] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-28 10:52:24] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 2 ms to minimize.
[2024-05-28 10:52:24] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-28 10:52:25] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:52:25] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 3 ms to minimize.
[2024-05-28 10:52:25] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 3 ms to minimize.
[2024-05-28 10:52:25] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-28 10:52:25] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-05-28 10:52:25] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-28 10:52:25] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-28 10:52:25] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 2 ms to minimize.
[2024-05-28 10:52:26] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 2 ms to minimize.
[2024-05-28 10:52:26] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 3 ms to minimize.
[2024-05-28 10:52:26] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 10:52:28] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-28 10:52:28] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-28 10:52:28] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-05-28 10:52:29] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-05-28 10:52:29] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:52:29] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:52:29] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:52:29] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-28 10:52:29] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-28 10:52:29] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-28 10:52:29] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
SMT process timed out in 30098ms, After SMT, problems are : Problem set: 0 solved, 521 unsolved
Search for dead transitions found 0 dead transitions in 30107ms
Starting structural reductions in LTL mode, iteration 1 : 532/535 places, 522/525 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30643 ms. Remains : 532/535 places, 522/525 transitions.
Stuttering acceptance computed with spot in 252 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA ShieldIIPs-PT-010B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010B-LTLFireability-00 finished in 30960 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 3 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 525/525 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 532 transition count 522
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 532 transition count 522
Applied a total of 6 rules in 33 ms. Remains 532 /535 variables (removed 3) and now considering 522/525 (removed 3) transitions.
[2024-05-28 10:52:29] [INFO ] Invariant cache hit.
[2024-05-28 10:52:30] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-28 10:52:30] [INFO ] Invariant cache hit.
[2024-05-28 10:52:30] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
Running 521 sub problems to find dead transitions.
[2024-05-28 10:52:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (OVERLAPS) 1/532 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 10:52:38] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-28 10:52:38] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2024-05-28 10:52:38] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-05-28 10:52:39] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 2 ms to minimize.
[2024-05-28 10:52:39] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 2 ms to minimize.
[2024-05-28 10:52:39] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 2 ms to minimize.
[2024-05-28 10:52:39] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 2 ms to minimize.
[2024-05-28 10:52:39] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 2 ms to minimize.
[2024-05-28 10:52:40] [INFO ] Deduced a trap composed of 48 places in 118 ms of which 3 ms to minimize.
[2024-05-28 10:52:40] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-28 10:52:40] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 3 ms to minimize.
[2024-05-28 10:52:40] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 10:52:40] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:52:40] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:52:40] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:52:41] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 2 ms to minimize.
[2024-05-28 10:52:41] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 3 ms to minimize.
[2024-05-28 10:52:41] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:52:41] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:52:41] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 10:52:42] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
[2024-05-28 10:52:43] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:52:43] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-28 10:52:43] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:52:43] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:52:43] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-28 10:52:43] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-28 10:52:43] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 3 ms to minimize.
[2024-05-28 10:52:43] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 3 ms to minimize.
[2024-05-28 10:52:43] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-28 10:52:44] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-28 10:52:44] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:52:44] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:52:44] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:52:44] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 10:52:44] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-28 10:52:44] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-28 10:52:44] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:52:44] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
[2024-05-28 10:52:44] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 10:52:49] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 3 ms to minimize.
[2024-05-28 10:52:49] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
[2024-05-28 10:52:50] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 2 ms to minimize.
[2024-05-28 10:52:50] [INFO ] Deduced a trap composed of 20 places in 160 ms of which 4 ms to minimize.
[2024-05-28 10:52:50] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 3 ms to minimize.
[2024-05-28 10:52:50] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-28 10:52:51] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-28 10:52:51] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:52:51] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:52:51] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-05-28 10:52:51] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:52:51] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-28 10:52:51] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-05-28 10:52:51] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-05-28 10:52:52] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 2 ms to minimize.
[2024-05-28 10:52:52] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:52:52] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:52:52] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-28 10:52:52] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-28 10:52:52] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 10:52:54] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 3 ms to minimize.
[2024-05-28 10:52:54] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-28 10:52:55] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 3 ms to minimize.
[2024-05-28 10:52:55] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-28 10:52:55] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:52:55] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 2 ms to minimize.
[2024-05-28 10:52:55] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
[2024-05-28 10:52:55] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-28 10:52:55] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-28 10:52:55] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:52:56] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 3 ms to minimize.
[2024-05-28 10:52:56] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 2 ms to minimize.
[2024-05-28 10:52:56] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-28 10:52:56] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-28 10:52:56] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:52:56] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:52:56] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 1 ms to minimize.
[2024-05-28 10:52:56] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-28 10:52:57] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 3 ms to minimize.
[2024-05-28 10:52:57] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 10:52:59] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-28 10:52:59] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 2 ms to minimize.
[2024-05-28 10:52:59] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-05-28 10:52:59] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-05-28 10:52:59] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-05-28 10:53:00] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-28 10:53:00] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:53:00] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:53:00] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-28 10:53:00] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:53:00] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
SMT process timed out in 30091ms, After SMT, problems are : Problem set: 0 solved, 521 unsolved
Search for dead transitions found 0 dead transitions in 30096ms
Starting structural reductions in LTL mode, iteration 1 : 532/535 places, 522/525 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30631 ms. Remains : 532/535 places, 522/525 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 322 ms.
Product exploration explored 100000 steps with 50000 reset in 228 ms.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Detected a total of 119/532 stabilizing places and 119/522 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 51 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-010B-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-010B-LTLFireability-02 finished in 31369 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 535 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 535/535 places, 525/525 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 534 transition count 473
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 483 transition count 473
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 102 place count 483 transition count 422
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 204 place count 432 transition count 422
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 207 place count 429 transition count 419
Iterating global reduction 2 with 3 rules applied. Total rules applied 210 place count 429 transition count 419
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 210 place count 429 transition count 418
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 212 place count 428 transition count 418
Performed 174 Post agglomeration using F-continuation condition.Transition count delta: 174
Deduced a syphon composed of 174 places in 1 ms
Reduce places removed 174 places and 0 transitions.
Iterating global reduction 2 with 348 rules applied. Total rules applied 560 place count 254 transition count 244
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 562 place count 252 transition count 242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 563 place count 251 transition count 242
Applied a total of 563 rules in 198 ms. Remains 251 /535 variables (removed 284) and now considering 242/525 (removed 283) transitions.
// Phase 1: matrix 242 rows 251 cols
[2024-05-28 10:53:01] [INFO ] Computed 90 invariants in 1 ms
[2024-05-28 10:53:01] [INFO ] Implicit Places using invariants in 381 ms returned []
[2024-05-28 10:53:01] [INFO ] Invariant cache hit.
[2024-05-28 10:53:02] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
[2024-05-28 10:53:02] [INFO ] Redundant transitions in 63 ms returned [241]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 239 sub problems to find dead transitions.
// Phase 1: matrix 241 rows 251 cols
[2024-05-28 10:53:02] [INFO ] Computed 90 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:53:03] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2024-05-28 10:53:03] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-28 10:53:03] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-28 10:53:03] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-28 10:53:03] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 2 ms to minimize.
[2024-05-28 10:53:03] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-28 10:53:03] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2024-05-28 10:53:03] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-28 10:53:03] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-28 10:53:04] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:53:04] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-05-28 10:53:04] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-28 10:53:04] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:53:04] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-05-28 10:53:04] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-28 10:53:04] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2024-05-28 10:53:05] [INFO ] Deduced a trap composed of 14 places in 642 ms of which 1 ms to minimize.
[2024-05-28 10:53:05] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-28 10:53:05] [INFO ] Deduced a trap composed of 14 places in 438 ms of which 1 ms to minimize.
[2024-05-28 10:53:06] [INFO ] Deduced a trap composed of 14 places in 600 ms of which 28 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:53:06] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-05-28 10:53:06] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:53:07] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 10:53:07] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 0 ms to minimize.
[2024-05-28 10:53:07] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-28 10:53:07] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-28 10:53:07] [INFO ] Deduced a trap composed of 10 places in 15 ms of which 0 ms to minimize.
[2024-05-28 10:53:08] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-05-28 10:53:08] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-05-28 10:53:08] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
[2024-05-28 10:53:08] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 10 ms to minimize.
[2024-05-28 10:53:08] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:53:08] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 13/117 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:53:09] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2024-05-28 10:53:09] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 0 ms to minimize.
[2024-05-28 10:53:09] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 0 ms to minimize.
[2024-05-28 10:53:09] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (OVERLAPS) 1/251 variables, 6/127 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:53:12] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 5 ms to minimize.
[2024-05-28 10:53:12] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:53:12] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-28 10:53:12] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-28 10:53:12] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
[2024-05-28 10:53:13] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-28 10:53:13] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-05-28 10:53:13] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-28 10:53:13] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:53:13] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:53:13] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 11/138 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:53:15] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-28 10:53:15] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 9 (OVERLAPS) 241/492 variables, 251/391 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:53:19] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 10:53:19] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 10:53:19] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-28 10:53:19] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 10:53:19] [INFO ] Deduced a trap composed of 8 places in 14 ms of which 0 ms to minimize.
[2024-05-28 10:53:19] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 10:53:19] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 10:53:19] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 8/399 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:53:20] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 10:53:20] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:53:21] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:53:21] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 4/403 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:53:22] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-28 10:53:22] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-28 10:53:22] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:53:22] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-28 10:53:22] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-05-28 10:53:22] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:53:23] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-28 10:53:23] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:53:23] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:53:24] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 10/413 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:53:25] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:53:27] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:53:27] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/492 variables, 2/416 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:53:28] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:53:29] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/492 variables, 2/418 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:53:32] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 492/492 variables, and 419 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 78/78 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 76/160 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (OVERLAPS) 1/251 variables, 6/166 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (OVERLAPS) 241/492 variables, 251/419 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 239/658 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:53:37] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-28 10:53:37] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
[2024-05-28 10:53:37] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 10:53:40] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-28 10:53:41] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 5/663 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:53:54] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 1/664 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 664 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 84/84 constraints]
After SMT, in 60100ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 60102ms
Starting structural reductions in SI_LTL mode, iteration 1 : 251/535 places, 241/525 transitions.
Applied a total of 0 rules in 17 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61062 ms. Remains : 251/535 places, 241/525 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-04
Product exploration explored 100000 steps with 27407 reset in 270 ms.
Product exploration explored 100000 steps with 27275 reset in 275 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/251 stabilizing places and 2/241 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 298 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 9 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 215 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2024-05-28 10:54:03] [INFO ] Invariant cache hit.
[2024-05-28 10:54:03] [INFO ] [Real]Absence check using 90 positive place invariants in 17 ms returned sat
[2024-05-28 10:54:03] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-28 10:54:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 10:54:04] [INFO ] [Nat]Absence check using 90 positive place invariants in 17 ms returned sat
[2024-05-28 10:54:04] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-28 10:54:04] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:54:04] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:54:04] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:54:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 149 ms
[2024-05-28 10:54:04] [INFO ] Computed and/alt/rep : 237/588/237 causal constraints (skipped 2 transitions) in 16 ms.
[2024-05-28 10:54:05] [INFO ] Added : 182 causal constraints over 37 iterations in 1235 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 241/241 transitions.
Applied a total of 0 rules in 10 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2024-05-28 10:54:05] [INFO ] Invariant cache hit.
[2024-05-28 10:54:05] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-28 10:54:05] [INFO ] Invariant cache hit.
[2024-05-28 10:54:05] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2024-05-28 10:54:05] [INFO ] Redundant transitions in 36 ms returned []
Running 239 sub problems to find dead transitions.
[2024-05-28 10:54:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:54:07] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:54:07] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:54:07] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:54:07] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:54:07] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:54:07] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-28 10:54:07] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-28 10:54:07] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 10:54:07] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 10:54:07] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-28 10:54:07] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 10:54:07] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 10:54:07] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-28 10:54:07] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:54:07] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 10:54:07] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:54:07] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-28 10:54:07] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-28 10:54:07] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-28 10:54:08] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:54:08] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:54:08] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:54:08] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:54:08] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:54:08] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-05-28 10:54:08] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 10:54:08] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-28 10:54:08] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 10:54:09] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:54:09] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 10:54:09] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 10:54:09] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 10:54:09] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 13/117 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:54:09] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 10:54:09] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:54:09] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (OVERLAPS) 1/251 variables, 6/126 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:54:12] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:54:13] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:54:13] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:54:13] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:54:13] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-05-28 10:54:13] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:54:13] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-05-28 10:54:14] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 10:54:14] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 9/135 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:54:15] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 9 (OVERLAPS) 241/492 variables, 251/387 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:54:19] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:54:19] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:54:19] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:54:19] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-28 10:54:20] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 5/392 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:54:20] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:54:20] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:54:20] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:54:20] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:54:20] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:54:20] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:54:21] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:54:21] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:54:21] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-28 10:54:21] [INFO ] Deduced a trap composed of 50 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 10/402 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:54:22] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 10:54:22] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 10:54:22] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-28 10:54:22] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-28 10:54:23] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:54:23] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-28 10:54:23] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-28 10:54:23] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:54:23] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 9/411 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:54:26] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:54:26] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 2/413 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:54:27] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:54:27] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:54:27] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-28 10:54:27] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 10:54:28] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/492 variables, 5/418 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:54:29] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-28 10:54:30] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/492 variables, 2/420 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:54:32] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/492 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:54:33] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:54:33] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:54:34] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2024-05-28 10:54:34] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 10:54:34] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:54:34] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:54:34] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:54:34] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-28 10:54:35] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/492 variables, 9/430 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:54:35] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 492/492 variables, and 431 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 90/90 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 88/172 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (OVERLAPS) 1/251 variables, 6/178 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (OVERLAPS) 241/492 variables, 251/431 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 239/670 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:54:40] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 1/671 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 10 (OVERLAPS) 0/492 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Int declared 492/492 variables, and 671 constraints, problems are : Problem set: 0 solved, 239 unsolved in 25412 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 91/91 constraints]
After SMT, in 55460ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 55462ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 55837 ms. Remains : 251/251 places, 241/241 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/251 stabilizing places and 2/241 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 199 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 217 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2024-05-28 10:55:02] [INFO ] Invariant cache hit.
[2024-05-28 10:55:02] [INFO ] [Real]Absence check using 90 positive place invariants in 17 ms returned sat
[2024-05-28 10:55:02] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-28 10:55:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 10:55:02] [INFO ] [Nat]Absence check using 90 positive place invariants in 16 ms returned sat
[2024-05-28 10:55:02] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-28 10:55:02] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-28 10:55:02] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-28 10:55:02] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-28 10:55:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 139 ms
[2024-05-28 10:55:02] [INFO ] Computed and/alt/rep : 237/588/237 causal constraints (skipped 2 transitions) in 15 ms.
[2024-05-28 10:55:03] [INFO ] Added : 182 causal constraints over 37 iterations in 1132 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 27283 reset in 226 ms.
Product exploration explored 100000 steps with 27287 reset in 260 ms.
Built C files in :
/tmp/ltsmin17063189803194271629
[2024-05-28 10:55:04] [INFO ] Computing symmetric may disable matrix : 241 transitions.
[2024-05-28 10:55:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:55:04] [INFO ] Computing symmetric may enable matrix : 241 transitions.
[2024-05-28 10:55:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:55:04] [INFO ] Computing Do-Not-Accords matrix : 241 transitions.
[2024-05-28 10:55:04] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:55:04] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17063189803194271629
Running compilation step : cd /tmp/ltsmin17063189803194271629;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 700 ms.
Running link step : cd /tmp/ltsmin17063189803194271629;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin17063189803194271629;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7770868927084400592.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 241/241 transitions.
Applied a total of 0 rules in 10 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2024-05-28 10:55:19] [INFO ] Invariant cache hit.
[2024-05-28 10:55:19] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-28 10:55:19] [INFO ] Invariant cache hit.
[2024-05-28 10:55:19] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-05-28 10:55:19] [INFO ] Redundant transitions in 31 ms returned []
Running 239 sub problems to find dead transitions.
[2024-05-28 10:55:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:55:21] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:55:21] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:55:21] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:55:21] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:55:21] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-28 10:55:21] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:55:21] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 10:55:21] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:55:21] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-28 10:55:21] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-28 10:55:21] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 10:55:21] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:55:21] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:55:21] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:55:21] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:55:21] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:55:21] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:55:21] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-28 10:55:21] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:55:22] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:55:22] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:55:22] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:55:22] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:55:22] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:55:22] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:55:22] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:55:22] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-28 10:55:23] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 10:55:23] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 10:55:23] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 10:55:23] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 10:55:23] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 10:55:23] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 13/117 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:55:23] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:55:23] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-28 10:55:23] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (OVERLAPS) 1/251 variables, 6/126 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:55:26] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:55:27] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:55:27] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-28 10:55:27] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:55:27] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:55:27] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:55:27] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-28 10:55:28] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 10:55:28] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 9/135 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:55:29] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 9 (OVERLAPS) 241/492 variables, 251/387 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:55:33] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:55:33] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:55:33] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:55:33] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-28 10:55:34] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 5/392 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:55:34] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:55:34] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-28 10:55:34] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:55:34] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:55:35] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:55:35] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:55:35] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 10:55:35] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-28 10:55:35] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2024-05-28 10:55:35] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 10/402 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:55:36] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 10:55:36] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-28 10:55:37] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-28 10:55:37] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-28 10:55:37] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 10:55:37] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 10:55:37] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 10:55:37] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:55:37] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 9/411 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:55:40] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:55:40] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 2/413 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:55:41] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 10:55:41] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:55:41] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:55:41] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:55:42] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/492 variables, 5/418 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:55:43] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:55:44] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/492 variables, 2/420 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:55:46] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/492 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:55:48] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-05-28 10:55:48] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-28 10:55:48] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-28 10:55:48] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:55:48] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-28 10:55:48] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 10:55:48] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:55:48] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2024-05-28 10:55:49] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/492 variables, 9/430 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:55:50] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
SMT process timed out in 30062ms, After SMT, problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 30065ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30424 ms. Remains : 251/251 places, 241/241 transitions.
Built C files in :
/tmp/ltsmin9756695056725337170
[2024-05-28 10:55:50] [INFO ] Computing symmetric may disable matrix : 241 transitions.
[2024-05-28 10:55:50] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:55:50] [INFO ] Computing symmetric may enable matrix : 241 transitions.
[2024-05-28 10:55:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:55:50] [INFO ] Computing Do-Not-Accords matrix : 241 transitions.
[2024-05-28 10:55:50] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:55:50] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9756695056725337170
Running compilation step : cd /tmp/ltsmin9756695056725337170;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 566 ms.
Running link step : cd /tmp/ltsmin9756695056725337170;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin9756695056725337170;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12777718726222492102.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 10:56:05] [INFO ] Flatten gal took : 17 ms
[2024-05-28 10:56:05] [INFO ] Flatten gal took : 16 ms
[2024-05-28 10:56:05] [INFO ] Time to serialize gal into /tmp/LTL9632847971516589512.gal : 7 ms
[2024-05-28 10:56:05] [INFO ] Time to serialize properties into /tmp/LTL5745063264766999913.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9632847971516589512.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12024345642971775376.hoa' '-atoms' '/tmp/LTL5745063264766999913.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5745063264766999913.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12024345642971775376.hoa
Detected timeout of ITS tools.
[2024-05-28 10:56:20] [INFO ] Flatten gal took : 14 ms
[2024-05-28 10:56:20] [INFO ] Flatten gal took : 16 ms
[2024-05-28 10:56:20] [INFO ] Time to serialize gal into /tmp/LTL17481096167563174860.gal : 4 ms
[2024-05-28 10:56:20] [INFO ] Time to serialize properties into /tmp/LTL17690787367263310522.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17481096167563174860.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17690787367263310522.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F("(p391==1)")))
Formula 0 simplified : G!"(p391==1)"
Detected timeout of ITS tools.
[2024-05-28 10:56:35] [INFO ] Flatten gal took : 13 ms
[2024-05-28 10:56:35] [INFO ] Applying decomposition
[2024-05-28 10:56:35] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6588963427453698798.txt' '-o' '/tmp/graph6588963427453698798.bin' '-w' '/tmp/graph6588963427453698798.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6588963427453698798.bin' '-l' '-1' '-v' '-w' '/tmp/graph6588963427453698798.weights' '-q' '0' '-e' '0.001'
[2024-05-28 10:56:35] [INFO ] Decomposing Gal with order
[2024-05-28 10:56:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 10:56:35] [INFO ] Removed a total of 157 redundant transitions.
[2024-05-28 10:56:35] [INFO ] Flatten gal took : 51 ms
[2024-05-28 10:56:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 146 labels/synchronizations in 9 ms.
[2024-05-28 10:56:35] [INFO ] Time to serialize gal into /tmp/LTL18311842350532165143.gal : 5 ms
[2024-05-28 10:56:35] [INFO ] Time to serialize properties into /tmp/LTL17959063985236975774.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18311842350532165143.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17959063985236975774.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F("(i6.i1.u60.p391==1)")))
Formula 0 simplified : G!"(i6.i1.u60.p391==1)"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-010B-LTLFireability-04 finished in 229343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F((p1||(p2 U (p3||G(p2)))))))))'
Support contains 7 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 525/525 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 532 transition count 522
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 532 transition count 522
Applied a total of 6 rules in 18 ms. Remains 532 /535 variables (removed 3) and now considering 522/525 (removed 3) transitions.
// Phase 1: matrix 522 rows 532 cols
[2024-05-28 10:56:50] [INFO ] Computed 91 invariants in 5 ms
[2024-05-28 10:56:50] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-28 10:56:50] [INFO ] Invariant cache hit.
[2024-05-28 10:56:51] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
Running 521 sub problems to find dead transitions.
[2024-05-28 10:56:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (OVERLAPS) 1/532 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 10:56:59] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:56:59] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:56:59] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 2 ms to minimize.
[2024-05-28 10:56:59] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 1 ms to minimize.
[2024-05-28 10:56:59] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 2 ms to minimize.
[2024-05-28 10:57:00] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
[2024-05-28 10:57:00] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 2 ms to minimize.
[2024-05-28 10:57:00] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 3 ms to minimize.
[2024-05-28 10:57:00] [INFO ] Deduced a trap composed of 48 places in 113 ms of which 2 ms to minimize.
[2024-05-28 10:57:01] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-05-28 10:57:01] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 3 ms to minimize.
[2024-05-28 10:57:01] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:57:01] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:57:01] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:57:01] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:57:01] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 2 ms to minimize.
[2024-05-28 10:57:01] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 3 ms to minimize.
[2024-05-28 10:57:01] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:57:02] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:57:02] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 10:57:03] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2024-05-28 10:57:03] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:57:03] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 2 ms to minimize.
[2024-05-28 10:57:03] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-28 10:57:03] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:57:03] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:57:04] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:57:04] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 3 ms to minimize.
[2024-05-28 10:57:04] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 3 ms to minimize.
[2024-05-28 10:57:04] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-28 10:57:04] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-28 10:57:04] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:57:04] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:57:04] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:57:04] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:57:04] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:57:05] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 4 ms to minimize.
[2024-05-28 10:57:05] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:57:05] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
[2024-05-28 10:57:05] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 10:57:10] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 3 ms to minimize.
[2024-05-28 10:57:10] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 3 ms to minimize.
[2024-05-28 10:57:11] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 2 ms to minimize.
[2024-05-28 10:57:11] [INFO ] Deduced a trap composed of 20 places in 160 ms of which 3 ms to minimize.
[2024-05-28 10:57:11] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 3 ms to minimize.
[2024-05-28 10:57:11] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-05-28 10:57:11] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-28 10:57:11] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:57:12] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:57:12] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-05-28 10:57:12] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 0 ms to minimize.
[2024-05-28 10:57:12] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-05-28 10:57:12] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-05-28 10:57:12] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-28 10:57:12] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-28 10:57:12] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-28 10:57:13] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-28 10:57:13] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-28 10:57:13] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-28 10:57:13] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 10:57:15] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 3 ms to minimize.
[2024-05-28 10:57:15] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-28 10:57:16] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 3 ms to minimize.
[2024-05-28 10:57:16] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-28 10:57:16] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-28 10:57:16] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-28 10:57:16] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
[2024-05-28 10:57:16] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 2 ms to minimize.
[2024-05-28 10:57:16] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-28 10:57:16] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-28 10:57:16] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 2 ms to minimize.
[2024-05-28 10:57:17] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 2 ms to minimize.
[2024-05-28 10:57:17] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:57:17] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-05-28 10:57:17] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:57:17] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:57:17] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 2 ms to minimize.
[2024-05-28 10:57:17] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 2 ms to minimize.
[2024-05-28 10:57:17] [INFO ] Deduced a trap composed of 33 places in 168 ms of which 3 ms to minimize.
[2024-05-28 10:57:18] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 10:57:20] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2024-05-28 10:57:20] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 2 ms to minimize.
[2024-05-28 10:57:20] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2024-05-28 10:57:20] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:57:20] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2024-05-28 10:57:20] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-28 10:57:20] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-05-28 10:57:21] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-28 10:57:21] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-28 10:57:21] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
SMT process timed out in 30092ms, After SMT, problems are : Problem set: 0 solved, 521 unsolved
Search for dead transitions found 0 dead transitions in 30098ms
Starting structural reductions in LTL mode, iteration 1 : 532/535 places, 522/525 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30662 ms. Remains : 532/535 places, 522/525 transitions.
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-05
Product exploration explored 100000 steps with 544 reset in 358 ms.
Product exploration explored 100000 steps with 532 reset in 420 ms.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Detected a total of 119/532 stabilizing places and 119/522 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) p3 p2), (X p2), (X p3), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 112 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
RANDOM walk for 40000 steps (28 resets) in 340 ms. (117 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 384 ms. (103 steps per ms) remains 1/1 properties
[2024-05-28 10:57:22] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 87/93 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 439/532 variables, 78/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 522/1054 variables, 532/623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1054 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1054 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1054/1054 variables, and 623 constraints, problems are : Problem set: 0 solved, 1 unsolved in 245 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 532/532 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 93/1054 variables, and 13 constraints, problems are : Problem set: 1 solved, 0 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 13/91 constraints, State Equation: 0/532 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 290ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p3 p2), (X p2), (X p3), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (G (OR p1 (NOT p2) p3))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p1 p2 p3))), (F (NOT p2)), (F (NOT p3))]
Knowledge based reduction with 13 factoid took 242 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Support contains 6 out of 532 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 : 532/532 places, 522/522 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 531 transition count 473
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 49 rules applied. Total rules applied 97 place count 483 transition count 472
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 482 transition count 472
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 98 place count 482 transition count 422
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 198 place count 432 transition count 422
Performed 172 Post agglomeration using F-continuation condition.Transition count delta: 172
Deduced a syphon composed of 172 places in 1 ms
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 3 with 344 rules applied. Total rules applied 542 place count 260 transition count 250
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 544 place count 258 transition count 248
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 545 place count 257 transition count 248
Applied a total of 545 rules in 90 ms. Remains 257 /532 variables (removed 275) and now considering 248/522 (removed 274) transitions.
// Phase 1: matrix 248 rows 257 cols
[2024-05-28 10:57:23] [INFO ] Computed 90 invariants in 4 ms
[2024-05-28 10:57:23] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-28 10:57:23] [INFO ] Invariant cache hit.
[2024-05-28 10:57:23] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2024-05-28 10:57:23] [INFO ] Redundant transitions in 29 ms returned [247]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 244 sub problems to find dead transitions.
// Phase 1: matrix 247 rows 257 cols
[2024-05-28 10:57:23] [INFO ] Computed 90 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-28 10:57:25] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 10:57:25] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-28 10:57:25] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:57:25] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 10:57:26] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:57:26] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-28 10:57:26] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 7/32 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 2/257 variables, 65/97 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-28 10:57:28] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-28 10:57:28] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-28 10:57:28] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:57:28] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:57:28] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-05-28 10:57:28] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:57:28] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:57:28] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-28 10:57:28] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 10:57:28] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-28 10:57:28] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-28 10:57:28] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:57:28] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:57:28] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 10:57:29] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:57:29] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-28 10:57:29] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-28 10:57:29] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-28 10:57:29] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:57:29] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-28 10:57:29] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-28 10:57:29] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:57:29] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-28 10:57:30] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-28 10:57:30] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-28 10:57:30] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-28 10:57:30] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:57:30] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-28 10:57:30] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-28 10:57:30] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-28 10:57:30] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2024-05-28 10:57:30] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 12/129 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-28 10:57:31] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 10:57:31] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:57:31] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-28 10:57:31] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 4/133 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (OVERLAPS) 247/504 variables, 257/390 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-28 10:57:34] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-28 10:57:34] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:57:35] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:57:35] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-28 10:57:35] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:57:35] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:57:35] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:57:35] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-28 10:57:35] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 0 ms to minimize.
[2024-05-28 10:57:35] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-28 10:57:36] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:57:36] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2024-05-28 10:57:36] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:57:36] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-28 10:57:36] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:57:36] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-28 10:57:36] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/504 variables, 17/407 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-28 10:57:39] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:57:39] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:57:39] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:57:40] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/504 variables, 4/411 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-28 10:57:40] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:57:40] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-28 10:57:40] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 2 ms to minimize.
[2024-05-28 10:57:41] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 7 ms to minimize.
[2024-05-28 10:57:42] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/504 variables, 5/416 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-28 10:57:42] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:57:42] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:57:42] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:57:43] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-28 10:57:43] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/504 variables, 5/421 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-28 10:57:46] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:57:46] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-28 10:57:46] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-28 10:57:46] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-05-28 10:57:46] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/504 variables, 5/426 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-28 10:57:48] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/504 variables, 1/427 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/504 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 244 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 504/504 variables, and 427 constraints, problems are : Problem set: 0 solved, 244 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 2/257 variables, 65/113 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 57/170 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-28 10:57:55] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-28 10:57:56] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (OVERLAPS) 247/504 variables, 257/429 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/504 variables, 244/673 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-28 10:58:03] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2024-05-28 10:58:03] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:58:03] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2024-05-28 10:58:04] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-28 10:58:04] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:58:04] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-28 10:58:04] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:58:05] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:58:05] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:58:07] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:58:07] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:58:16] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:58:17] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/504 variables, 13/686 constraints. Problems are: Problem set: 0 solved, 244 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/504 variables, and 686 constraints, problems are : Problem set: 0 solved, 244 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 95/95 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 60068ms
Starting structural reductions in SI_LTL mode, iteration 1 : 257/532 places, 247/522 transitions.
Applied a total of 0 rules in 8 ms. Remains 257 /257 variables (removed 0) and now considering 247/247 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60518 ms. Remains : 257/532 places, 247/522 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p1 p3)]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X p1), (X (NOT p1)), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 481 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
RANDOM walk for 15 steps (0 resets) in 6 ms. (2 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p3)]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X p1), (X (NOT p1)), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p3)), (F (NOT p1)), (F (NOT (OR p1 p3)))]
Knowledge based reduction with 1 factoid took 485 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 990 reset in 341 ms.
Product exploration explored 100000 steps with 932 reset in 417 ms.
Built C files in :
/tmp/ltsmin11141161646267156095
[2024-05-28 10:58:26] [INFO ] Computing symmetric may disable matrix : 247 transitions.
[2024-05-28 10:58:26] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:58:26] [INFO ] Computing symmetric may enable matrix : 247 transitions.
[2024-05-28 10:58:26] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:58:26] [INFO ] Computing Do-Not-Accords matrix : 247 transitions.
[2024-05-28 10:58:26] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:58:26] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11141161646267156095
Running compilation step : cd /tmp/ltsmin11141161646267156095;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 588 ms.
Running link step : cd /tmp/ltsmin11141161646267156095;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin11141161646267156095;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5386276290473092110.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 247/247 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 257 transition count 246
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 256 transition count 246
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 256 transition count 245
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 255 transition count 245
Applied a total of 4 rules in 20 ms. Remains 255 /257 variables (removed 2) and now considering 245/247 (removed 2) transitions.
// Phase 1: matrix 245 rows 255 cols
[2024-05-28 10:58:41] [INFO ] Computed 90 invariants in 3 ms
[2024-05-28 10:58:41] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-28 10:58:41] [INFO ] Invariant cache hit.
[2024-05-28 10:58:41] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2024-05-28 10:58:41] [INFO ] Redundant transitions in 29 ms returned []
Running 243 sub problems to find dead transitions.
[2024-05-28 10:58:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-28 10:58:42] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:58:42] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2024-05-28 10:58:42] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 10:58:43] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:58:43] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 10:58:43] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 10:58:43] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 7/33 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (OVERLAPS) 1/255 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-28 10:58:45] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:58:46] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-28 10:58:46] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-05-28 10:58:46] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:58:46] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:58:46] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-28 10:58:46] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-05-28 10:58:46] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:58:46] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-28 10:58:46] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:58:46] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:58:46] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2024-05-28 10:58:46] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-28 10:58:46] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 10:58:46] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-28 10:58:46] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-28 10:58:47] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:58:47] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:58:47] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-05-28 10:58:47] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-28 10:58:47] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:58:47] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-28 10:58:47] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:58:48] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-28 10:58:48] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-28 10:58:48] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-28 10:58:48] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-28 10:58:48] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-28 10:58:48] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:58:48] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:58:48] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-28 10:58:48] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 12/129 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-28 10:58:49] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:58:49] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-28 10:58:50] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (OVERLAPS) 245/500 variables, 255/387 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-28 10:58:53] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-28 10:58:53] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-28 10:58:53] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:58:54] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:58:54] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:58:54] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 10:58:54] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:58:54] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 8/395 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-28 10:58:56] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 10:58:56] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 8 ms to minimize.
[2024-05-28 10:58:56] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:58:56] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:58:56] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:58:57] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:58:57] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-28 10:58:58] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/500 variables, 8/403 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-28 10:58:58] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:58:58] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:58:58] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-28 10:58:59] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-28 10:58:59] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-28 10:58:59] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:59:00] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/500 variables, 7/410 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-28 10:59:00] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:59:00] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:59:01] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:59:01] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/500 variables, 4/414 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-28 10:59:04] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-28 10:59:04] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/500 variables, 2/416 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-28 10:59:05] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-28 10:59:06] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
[2024-05-28 10:59:06] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:59:06] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:59:06] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:59:06] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:59:06] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 10:59:07] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/500 variables, 8/424 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/500 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-28 10:59:11] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 500/500 variables, and 425 constraints, problems are : Problem set: 0 solved, 243 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (OVERLAPS) 1/255 variables, 64/110 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 60/170 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-28 10:59:13] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (OVERLAPS) 245/500 variables, 255/426 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 243/669 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-28 10:59:17] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:59:17] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-28 10:59:17] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 0 ms to minimize.
[2024-05-28 10:59:18] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-28 10:59:18] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:59:18] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:59:18] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-28 10:59:18] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:59:18] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:59:19] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-28 10:59:22] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:59:22] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:59:22] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-28 10:59:22] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:59:22] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:59:23] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 16/685 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-28 10:59:30] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-28 10:59:31] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:59:31] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:59:37] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:59:37] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:59:37] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:59:38] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-28 10:59:38] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 0 ms to minimize.
[2024-05-28 10:59:39] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/500 variables, 9/694 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 500/500 variables, and 694 constraints, problems are : Problem set: 0 solved, 243 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 106/106 constraints]
After SMT, in 60070ms problems are : Problem set: 0 solved, 243 unsolved
Search for dead transitions found 0 dead transitions in 60073ms
Starting structural reductions in SI_LTL mode, iteration 1 : 255/257 places, 245/247 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60472 ms. Remains : 255/257 places, 245/247 transitions.
Built C files in :
/tmp/ltsmin14415833393985965494
[2024-05-28 10:59:41] [INFO ] Computing symmetric may disable matrix : 245 transitions.
[2024-05-28 10:59:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:59:41] [INFO ] Computing symmetric may enable matrix : 245 transitions.
[2024-05-28 10:59:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:59:41] [INFO ] Computing Do-Not-Accords matrix : 245 transitions.
[2024-05-28 10:59:41] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:59:41] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14415833393985965494
Running compilation step : cd /tmp/ltsmin14415833393985965494;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 569 ms.
Running link step : cd /tmp/ltsmin14415833393985965494;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14415833393985965494;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3019719232935690329.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 10:59:56] [INFO ] Flatten gal took : 14 ms
[2024-05-28 10:59:56] [INFO ] Flatten gal took : 12 ms
[2024-05-28 10:59:56] [INFO ] Time to serialize gal into /tmp/LTL11023395523210130782.gal : 3 ms
[2024-05-28 10:59:56] [INFO ] Time to serialize properties into /tmp/LTL794415621467738417.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11023395523210130782.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8593521730349442870.hoa' '-atoms' '/tmp/LTL794415621467738417.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL794415621467738417.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8593521730349442870.hoa
Detected timeout of ITS tools.
[2024-05-28 11:00:11] [INFO ] Flatten gal took : 16 ms
[2024-05-28 11:00:11] [INFO ] Flatten gal took : 13 ms
[2024-05-28 11:00:11] [INFO ] Time to serialize gal into /tmp/LTL13265540402672712056.gal : 2 ms
[2024-05-28 11:00:11] [INFO ] Time to serialize properties into /tmp/LTL17857304529673048390.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13265540402672712056.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17857304529673048390.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(("(p517==1)")||(G(F(("(((p270==0)||(p348==0))&&(p367==0))")||(("(p367!=1)")U(("((!(((p331==1)&&(p353==1))&&(p361==1)))&&(p367!=1)...184
Formula 0 simplified : X(!"(p517==1)" & FG(!"(((p270==0)||(p348==0))&&(p367==0))" & (!"(p367!=1)" M !"((!(((p331==1)&&(p353==1))&&(p361==1)))&&(p367!=1))")...157
Detected timeout of ITS tools.
[2024-05-28 11:00:26] [INFO ] Flatten gal took : 18 ms
[2024-05-28 11:00:26] [INFO ] Applying decomposition
[2024-05-28 11:00:26] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9085850034785761095.txt' '-o' '/tmp/graph9085850034785761095.bin' '-w' '/tmp/graph9085850034785761095.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9085850034785761095.bin' '-l' '-1' '-v' '-w' '/tmp/graph9085850034785761095.weights' '-q' '0' '-e' '0.001'
[2024-05-28 11:00:26] [INFO ] Decomposing Gal with order
[2024-05-28 11:00:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 11:00:27] [INFO ] Removed a total of 160 redundant transitions.
[2024-05-28 11:00:27] [INFO ] Flatten gal took : 25 ms
[2024-05-28 11:00:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 132 labels/synchronizations in 13 ms.
[2024-05-28 11:00:27] [INFO ] Time to serialize gal into /tmp/LTL6770335744380267075.gal : 5 ms
[2024-05-28 11:00:27] [INFO ] Time to serialize properties into /tmp/LTL4052140273300939900.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6770335744380267075.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4052140273300939900.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(("(i8.i2.u79.p517==1)")||(G(F(("(((i4.u41.p270==0)||(i5.i2.u53.p348==0))&&(i6.i0.u62.p367==0))")||(("(i6.i0.u62.p367!=1)")U(("((!...281
Formula 0 simplified : X(!"(i8.i2.u79.p517==1)" & FG(!"(((i4.u41.p270==0)||(i5.i2.u53.p348==0))&&(i6.i0.u62.p367==0))" & (!"(i6.i0.u62.p367!=1)" M !"((!(((...244
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-010B-LTLFireability-05 finished in 231480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(F(p1))))'
Support contains 3 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 525/525 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 532 transition count 522
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 532 transition count 522
Applied a total of 6 rules in 19 ms. Remains 532 /535 variables (removed 3) and now considering 522/525 (removed 3) transitions.
// Phase 1: matrix 522 rows 532 cols
[2024-05-28 11:00:42] [INFO ] Computed 91 invariants in 4 ms
[2024-05-28 11:00:42] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-28 11:00:42] [INFO ] Invariant cache hit.
[2024-05-28 11:00:42] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
Running 521 sub problems to find dead transitions.
[2024-05-28 11:00:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (OVERLAPS) 1/532 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:00:50] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:00:50] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:00:51] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2024-05-28 11:00:51] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 2 ms to minimize.
[2024-05-28 11:00:51] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 2 ms to minimize.
[2024-05-28 11:00:51] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 2 ms to minimize.
[2024-05-28 11:00:51] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 2 ms to minimize.
[2024-05-28 11:00:52] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 2 ms to minimize.
[2024-05-28 11:00:52] [INFO ] Deduced a trap composed of 48 places in 122 ms of which 2 ms to minimize.
[2024-05-28 11:00:52] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-28 11:00:52] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 2 ms to minimize.
[2024-05-28 11:00:52] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-28 11:00:52] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-28 11:00:52] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 11:00:53] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:00:53] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 2 ms to minimize.
[2024-05-28 11:00:53] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 3 ms to minimize.
[2024-05-28 11:00:53] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:00:53] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-28 11:00:53] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:00:54] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-28 11:00:55] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-28 11:00:55] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-28 11:00:55] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-28 11:00:55] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-28 11:00:55] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-28 11:00:55] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 11:00:55] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 3 ms to minimize.
[2024-05-28 11:00:56] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 3 ms to minimize.
[2024-05-28 11:00:56] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-28 11:00:56] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-28 11:00:56] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:00:56] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:00:56] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-28 11:00:56] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-28 11:00:56] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:00:56] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2024-05-28 11:00:56] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-28 11:00:56] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-28 11:00:56] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:01:02] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 2 ms to minimize.
[2024-05-28 11:01:02] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 3 ms to minimize.
[2024-05-28 11:01:02] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 2 ms to minimize.
[2024-05-28 11:01:02] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 3 ms to minimize.
[2024-05-28 11:01:03] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 5 ms to minimize.
[2024-05-28 11:01:03] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-05-28 11:01:03] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:01:03] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-28 11:01:03] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-28 11:01:03] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
[2024-05-28 11:01:03] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 0 ms to minimize.
[2024-05-28 11:01:04] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-28 11:01:04] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 2 ms to minimize.
[2024-05-28 11:01:04] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2024-05-28 11:01:04] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-05-28 11:01:04] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-28 11:01:04] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-28 11:01:04] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-28 11:01:04] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-28 11:01:04] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:01:07] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 3 ms to minimize.
[2024-05-28 11:01:07] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 3 ms to minimize.
[2024-05-28 11:01:07] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 3 ms to minimize.
[2024-05-28 11:01:07] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-28 11:01:07] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-28 11:01:07] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-05-28 11:01:07] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-28 11:01:07] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-28 11:01:08] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-28 11:01:08] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-28 11:01:08] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 3 ms to minimize.
[2024-05-28 11:01:08] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 3 ms to minimize.
[2024-05-28 11:01:08] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-28 11:01:08] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 2 ms to minimize.
[2024-05-28 11:01:08] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 0 ms to minimize.
[2024-05-28 11:01:08] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-28 11:01:09] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 1 ms to minimize.
[2024-05-28 11:01:09] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-28 11:01:09] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 3 ms to minimize.
[2024-05-28 11:01:09] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:01:11] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2024-05-28 11:01:12] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-28 11:01:12] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-28 11:01:12] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-05-28 11:01:12] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 2 ms to minimize.
[2024-05-28 11:01:12] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-28 11:01:12] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 0 ms to minimize.
[2024-05-28 11:01:12] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:01:12] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:01:12] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:01:12] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
SMT process timed out in 30080ms, After SMT, problems are : Problem set: 0 solved, 521 unsolved
Search for dead transitions found 0 dead transitions in 30086ms
Starting structural reductions in LTL mode, iteration 1 : 532/535 places, 522/525 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30643 ms. Remains : 532/535 places, 522/525 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-06
Product exploration explored 100000 steps with 3393 reset in 257 ms.
Product exploration explored 100000 steps with 3382 reset in 223 ms.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Detected a total of 119/532 stabilizing places and 119/522 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 128 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 16473 steps (12 resets) in 72 ms. (225 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F p0), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 8 factoid took 249 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1)), (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 212 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-28 11:01:14] [INFO ] Invariant cache hit.
[2024-05-28 11:01:14] [INFO ] [Real]Absence check using 91 positive place invariants in 30 ms returned sat
[2024-05-28 11:01:15] [INFO ] [Real]Absence check using state equation in 742 ms returned sat
[2024-05-28 11:01:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 11:01:15] [INFO ] [Nat]Absence check using 91 positive place invariants in 29 ms returned sat
[2024-05-28 11:01:16] [INFO ] [Nat]Absence check using state equation in 926 ms returned sat
[2024-05-28 11:01:16] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 0 ms to minimize.
[2024-05-28 11:01:16] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:01:16] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2024-05-28 11:01:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 295 ms
[2024-05-28 11:01:16] [INFO ] Computed and/alt/rep : 521/1172/521 causal constraints (skipped 0 transitions) in 30 ms.
[2024-05-28 11:01:30] [INFO ] Added : 516 causal constraints over 110 iterations in 13573 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 522/522 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 531 transition count 471
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 481 transition count 471
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 100 place count 481 transition count 421
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 200 place count 431 transition count 421
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 0 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 2 with 350 rules applied. Total rules applied 550 place count 256 transition count 246
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 552 place count 254 transition count 244
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 553 place count 253 transition count 244
Applied a total of 553 rules in 41 ms. Remains 253 /532 variables (removed 279) and now considering 244/522 (removed 278) transitions.
// Phase 1: matrix 244 rows 253 cols
[2024-05-28 11:01:30] [INFO ] Computed 90 invariants in 3 ms
[2024-05-28 11:01:30] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-28 11:01:30] [INFO ] Invariant cache hit.
[2024-05-28 11:01:30] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2024-05-28 11:01:30] [INFO ] Redundant transitions in 28 ms returned [243]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 241 sub problems to find dead transitions.
// Phase 1: matrix 243 rows 253 cols
[2024-05-28 11:01:30] [INFO ] Computed 90 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 11:01:31] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-28 11:01:31] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-28 11:01:32] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-28 11:01:32] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:01:32] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:01:32] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:01:32] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-28 11:01:32] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:01:32] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 11:01:32] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:01:32] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:01:32] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 11:01:32] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:01:32] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 11:01:32] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-28 11:01:32] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:01:32] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-28 11:01:32] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-05-28 11:01:32] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:01:32] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 11:01:33] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-28 11:01:33] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-28 11:01:33] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-28 11:01:33] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-28 11:01:33] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-28 11:01:33] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:01:33] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:01:33] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 11:01:33] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 11:01:33] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-28 11:01:34] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 11:01:34] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 11:01:34] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 11:01:34] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 11:01:34] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 15/119 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 11:01:34] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:01:34] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 2/253 variables, 6/127 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 11:01:37] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:01:37] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:01:38] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:01:38] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-28 11:01:38] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-28 11:01:38] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-28 11:01:38] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:01:38] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-28 11:01:38] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 11:01:39] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 10/137 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 11:01:40] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-05-28 11:01:40] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-28 11:01:40] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 3/140 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 243/496 variables, 253/393 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 11:01:44] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-28 11:01:44] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 2/395 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 11:01:45] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-28 11:01:45] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:01:45] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 11:01:45] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:01:45] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:01:45] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-28 11:01:46] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:01:46] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-28 11:01:46] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-28 11:01:46] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:01:46] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:01:47] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-28 11:01:47] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:01:47] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 14/409 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 11:01:48] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-28 11:01:48] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:01:48] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 3/412 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 11:01:50] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:01:51] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:01:51] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-28 11:01:51] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 11:01:51] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-28 11:01:51] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 6/418 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 11:01:52] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-05-28 11:01:53] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-28 11:01:53] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:01:53] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-05-28 11:01:53] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/496 variables, 5/423 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 11:01:54] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:01:54] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:01:54] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:01:55] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-28 11:01:55] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/496 variables, 5/428 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 11:01:58] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:01:58] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:01:58] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-28 11:01:58] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/496 variables, 4/432 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 11:02:00] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 11:02:00] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 496/496 variables, and 434 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 91/91 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 87/171 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 11:02:01] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (OVERLAPS) 2/253 variables, 6/178 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 4/182 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 11:02:03] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 243/496 variables, 253/436 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 241/677 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 11:02:07] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:02:08] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:02:08] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 3/680 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 11:02:15] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 1/681 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/496 variables, and 681 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 97/97 constraints]
After SMT, in 60060ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 60063ms
Starting structural reductions in SI_LTL mode, iteration 1 : 253/532 places, 243/522 transitions.
Applied a total of 0 rules in 10 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60498 ms. Remains : 253/532 places, 243/522 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/253 stabilizing places and 2/243 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 15 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-010B-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-010B-LTLFireability-06 finished in 108789 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 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 525/525 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 532 transition count 522
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 532 transition count 522
Applied a total of 6 rules in 24 ms. Remains 532 /535 variables (removed 3) and now considering 522/525 (removed 3) transitions.
// Phase 1: matrix 522 rows 532 cols
[2024-05-28 11:02:30] [INFO ] Computed 91 invariants in 5 ms
[2024-05-28 11:02:31] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-28 11:02:31] [INFO ] Invariant cache hit.
[2024-05-28 11:02:31] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
Running 521 sub problems to find dead transitions.
[2024-05-28 11:02:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (OVERLAPS) 1/532 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:02:39] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-28 11:02:39] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-05-28 11:02:39] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-05-28 11:02:40] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 2 ms to minimize.
[2024-05-28 11:02:40] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 2 ms to minimize.
[2024-05-28 11:02:40] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 2 ms to minimize.
[2024-05-28 11:02:40] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 2 ms to minimize.
[2024-05-28 11:02:40] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
[2024-05-28 11:02:41] [INFO ] Deduced a trap composed of 48 places in 122 ms of which 2 ms to minimize.
[2024-05-28 11:02:41] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-28 11:02:41] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 3 ms to minimize.
[2024-05-28 11:02:41] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-28 11:02:41] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 11:02:41] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:02:41] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-28 11:02:42] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 2 ms to minimize.
[2024-05-28 11:02:42] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 3 ms to minimize.
[2024-05-28 11:02:42] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-28 11:02:42] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 11:02:42] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:02:43] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:02:44] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:02:44] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-28 11:02:44] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:02:44] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-28 11:02:44] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:02:44] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:02:44] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 2 ms to minimize.
[2024-05-28 11:02:44] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 3 ms to minimize.
[2024-05-28 11:02:45] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-28 11:02:45] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-28 11:02:45] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-28 11:02:45] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:02:45] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-28 11:02:45] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 11:02:45] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:02:45] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-28 11:02:45] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2024-05-28 11:02:45] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-28 11:02:45] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:02:51] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 2 ms to minimize.
[2024-05-28 11:02:51] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 2 ms to minimize.
[2024-05-28 11:02:51] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 2 ms to minimize.
[2024-05-28 11:02:52] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 3 ms to minimize.
[2024-05-28 11:02:52] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 3 ms to minimize.
[2024-05-28 11:02:52] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:02:52] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-28 11:02:52] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-28 11:02:52] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-28 11:02:52] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-28 11:02:53] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:02:53] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-28 11:02:53] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-28 11:02:53] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-05-28 11:02:53] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-28 11:02:53] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:02:53] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2024-05-28 11:02:53] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-28 11:02:53] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-28 11:02:54] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:02:56] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 3 ms to minimize.
[2024-05-28 11:02:56] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-28 11:02:56] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 3 ms to minimize.
[2024-05-28 11:02:56] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-28 11:02:56] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-28 11:02:57] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-05-28 11:02:57] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
[2024-05-28 11:02:57] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-28 11:02:57] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 5 ms to minimize.
[2024-05-28 11:02:57] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-28 11:02:57] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 3 ms to minimize.
[2024-05-28 11:02:57] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 2 ms to minimize.
[2024-05-28 11:02:57] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:02:57] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-05-28 11:02:57] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-28 11:02:58] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:02:58] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 2 ms to minimize.
[2024-05-28 11:02:58] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 2 ms to minimize.
[2024-05-28 11:02:58] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 2 ms to minimize.
[2024-05-28 11:02:58] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:03:01] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2024-05-28 11:03:01] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-28 11:03:01] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 2 ms to minimize.
[2024-05-28 11:03:01] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-05-28 11:03:01] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-05-28 11:03:01] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-28 11:03:01] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:03:01] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
SMT process timed out in 30117ms, After SMT, problems are : Problem set: 0 solved, 521 unsolved
Search for dead transitions found 0 dead transitions in 30123ms
Starting structural reductions in LTL mode, iteration 1 : 532/535 places, 522/525 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30721 ms. Remains : 532/535 places, 522/525 transitions.
Stuttering acceptance computed with spot in 112 ms :[p0, (AND (NOT p1) p0), p0]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 157 ms.
Product exploration explored 100000 steps with 50000 reset in 167 ms.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 16 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-010B-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-010B-LTLFireability-07 finished in 31210 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) U p1)&&G(F(p1)))))'
Support contains 3 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 525/525 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 532 transition count 522
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 532 transition count 522
Applied a total of 6 rules in 14 ms. Remains 532 /535 variables (removed 3) and now considering 522/525 (removed 3) transitions.
[2024-05-28 11:03:02] [INFO ] Invariant cache hit.
[2024-05-28 11:03:02] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-28 11:03:02] [INFO ] Invariant cache hit.
[2024-05-28 11:03:02] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
Running 521 sub problems to find dead transitions.
[2024-05-28 11:03:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (OVERLAPS) 1/532 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:03:10] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-28 11:03:10] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-28 11:03:10] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2024-05-28 11:03:11] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2024-05-28 11:03:11] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 2 ms to minimize.
[2024-05-28 11:03:11] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
[2024-05-28 11:03:11] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 2 ms to minimize.
[2024-05-28 11:03:11] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 2 ms to minimize.
[2024-05-28 11:03:12] [INFO ] Deduced a trap composed of 48 places in 116 ms of which 4 ms to minimize.
[2024-05-28 11:03:12] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-28 11:03:12] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 3 ms to minimize.
[2024-05-28 11:03:12] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-28 11:03:12] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 11:03:12] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:03:12] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:03:13] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 3 ms to minimize.
[2024-05-28 11:03:13] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 3 ms to minimize.
[2024-05-28 11:03:13] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-05-28 11:03:13] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-28 11:03:13] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:03:14] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:03:14] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-28 11:03:15] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-28 11:03:15] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:03:15] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:03:15] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:03:15] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 11:03:15] [INFO ] Deduced a trap composed of 25 places in 153 ms of which 3 ms to minimize.
[2024-05-28 11:03:15] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 3 ms to minimize.
[2024-05-28 11:03:15] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-28 11:03:16] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-28 11:03:16] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-28 11:03:16] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-28 11:03:16] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-28 11:03:16] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-28 11:03:16] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:03:16] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2024-05-28 11:03:16] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-28 11:03:16] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-28 11:03:16] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:03:21] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 3 ms to minimize.
[2024-05-28 11:03:21] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 2 ms to minimize.
[2024-05-28 11:03:22] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 3 ms to minimize.
[2024-05-28 11:03:22] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 3 ms to minimize.
[2024-05-28 11:03:22] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 3 ms to minimize.
[2024-05-28 11:03:22] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:03:23] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-28 11:03:23] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-28 11:03:23] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-28 11:03:23] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-28 11:03:23] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-28 11:03:23] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-28 11:03:23] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 2 ms to minimize.
[2024-05-28 11:03:23] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-28 11:03:24] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-28 11:03:24] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-28 11:03:24] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-28 11:03:24] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-28 11:03:24] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-28 11:03:24] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:03:26] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 3 ms to minimize.
[2024-05-28 11:03:26] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:03:27] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 2 ms to minimize.
[2024-05-28 11:03:27] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:03:27] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-28 11:03:27] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-28 11:03:27] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-28 11:03:27] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 2 ms to minimize.
[2024-05-28 11:03:27] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:03:27] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:03:28] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 2 ms to minimize.
[2024-05-28 11:03:28] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 2 ms to minimize.
[2024-05-28 11:03:28] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-28 11:03:28] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-05-28 11:03:28] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-28 11:03:28] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-28 11:03:28] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 1 ms to minimize.
[2024-05-28 11:03:28] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-28 11:03:29] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 3 ms to minimize.
[2024-05-28 11:03:29] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:03:31] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2024-05-28 11:03:31] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 2 ms to minimize.
[2024-05-28 11:03:31] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-28 11:03:31] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-05-28 11:03:31] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-05-28 11:03:32] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-28 11:03:32] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-28 11:03:32] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-28 11:03:32] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:03:32] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-28 11:03:32] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-28 11:03:32] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-28 11:03:32] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
SMT process timed out in 30069ms, After SMT, problems are : Problem set: 0 solved, 521 unsolved
Search for dead transitions found 0 dead transitions in 30075ms
Starting structural reductions in LTL mode, iteration 1 : 532/535 places, 522/525 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30569 ms. Remains : 532/535 places, 522/525 transitions.
Stuttering acceptance computed with spot in 261 ms :[(NOT p1), (NOT p1), true, (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-010B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010B-LTLFireability-09 finished in 30859 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(X((F(p0)||X(X(G(p1)))))))))'
Support contains 3 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 525/525 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 533 transition count 523
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 533 transition count 523
Applied a total of 4 rules in 16 ms. Remains 533 /535 variables (removed 2) and now considering 523/525 (removed 2) transitions.
// Phase 1: matrix 523 rows 533 cols
[2024-05-28 11:03:33] [INFO ] Computed 91 invariants in 4 ms
[2024-05-28 11:03:33] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-28 11:03:33] [INFO ] Invariant cache hit.
[2024-05-28 11:03:33] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
Running 522 sub problems to find dead transitions.
[2024-05-28 11:03:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (OVERLAPS) 1/533 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 11:03:41] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-28 11:03:41] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-28 11:03:41] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-05-28 11:03:42] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 2 ms to minimize.
[2024-05-28 11:03:42] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 1 ms to minimize.
[2024-05-28 11:03:42] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 2 ms to minimize.
[2024-05-28 11:03:42] [INFO ] Deduced a trap composed of 66 places in 100 ms of which 2 ms to minimize.
[2024-05-28 11:03:42] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 3 ms to minimize.
[2024-05-28 11:03:43] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 3 ms to minimize.
[2024-05-28 11:03:43] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-28 11:03:43] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-05-28 11:03:43] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 3 ms to minimize.
[2024-05-28 11:03:43] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-28 11:03:43] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 3 ms to minimize.
[2024-05-28 11:03:43] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 3 ms to minimize.
[2024-05-28 11:03:43] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-28 11:03:43] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:03:44] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-28 11:03:44] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 3 ms to minimize.
[2024-05-28 11:03:44] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 11:03:46] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 3 ms to minimize.
[2024-05-28 11:03:46] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 3 ms to minimize.
[2024-05-28 11:03:46] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 4 ms to minimize.
[2024-05-28 11:03:46] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-28 11:03:46] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-28 11:03:46] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:03:46] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 11:03:46] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-28 11:03:46] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-28 11:03:47] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 3 ms to minimize.
[2024-05-28 11:03:47] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 2 ms to minimize.
[2024-05-28 11:03:47] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2024-05-28 11:03:47] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-28 11:03:47] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:03:47] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 1 ms to minimize.
[2024-05-28 11:03:47] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-28 11:03:47] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2024-05-28 11:03:47] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:03:47] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-28 11:03:47] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 11:03:53] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 3 ms to minimize.
[2024-05-28 11:03:53] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2024-05-28 11:03:53] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 11:03:53] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:03:54] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 3 ms to minimize.
[2024-05-28 11:03:54] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-05-28 11:03:54] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:03:54] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-28 11:03:54] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-28 11:03:54] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-28 11:03:54] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-28 11:03:54] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-28 11:03:54] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-28 11:03:54] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-28 11:03:54] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-28 11:03:54] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-28 11:03:54] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-28 11:03:54] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 2 ms to minimize.
[2024-05-28 11:03:55] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-28 11:03:55] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 11:03:55] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
[2024-05-28 11:03:56] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:03:57] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 2 ms to minimize.
[2024-05-28 11:03:57] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-05-28 11:03:57] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 2 ms to minimize.
[2024-05-28 11:03:57] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 2 ms to minimize.
[2024-05-28 11:03:57] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-05-28 11:03:57] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-05-28 11:03:57] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
[2024-05-28 11:03:57] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 2 ms to minimize.
[2024-05-28 11:03:57] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-05-28 11:03:58] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-05-28 11:03:58] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 2 ms to minimize.
[2024-05-28 11:03:58] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-05-28 11:03:58] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 2 ms to minimize.
[2024-05-28 11:03:58] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 2 ms to minimize.
[2024-05-28 11:03:58] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-05-28 11:03:58] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 2 ms to minimize.
[2024-05-28 11:03:58] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 2 ms to minimize.
[2024-05-28 11:03:58] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 11:04:00] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:04:00] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-28 11:04:00] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-28 11:04:01] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 3 ms to minimize.
[2024-05-28 11:04:01] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 3 ms to minimize.
[2024-05-28 11:04:01] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:04:01] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-05-28 11:04:01] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:04:01] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-28 11:04:01] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:04:01] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:04:01] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 2 ms to minimize.
[2024-05-28 11:04:01] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-05-28 11:04:02] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-28 11:04:02] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-28 11:04:02] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-28 11:04:02] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-05-28 11:04:02] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-28 11:04:02] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-28 11:04:02] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 1.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 0.0)
(s348 0.0)
(s349 1.0)
(s350 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 533/1056 variables, and 191 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/533 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (OVERLAPS) 1/533 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 100/191 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 11:04:09] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 3 ms to minimize.
[2024-05-28 11:04:09] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-28 11:04:09] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-28 11:04:09] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-28 11:04:10] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:04:10] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-28 11:04:10] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-28 11:04:10] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-28 11:04:10] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-28 11:04:10] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 2 ms to minimize.
[2024-05-28 11:04:11] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-28 11:04:11] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-28 11:04:11] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2024-05-28 11:04:11] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
[2024-05-28 11:04:11] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-28 11:04:11] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-05-28 11:04:11] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-05-28 11:04:11] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-28 11:04:11] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
[2024-05-28 11:04:11] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 11:04:13] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:04:13] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-28 11:04:14] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 2 ms to minimize.
[2024-05-28 11:04:14] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2024-05-28 11:04:14] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-05-28 11:04:14] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-28 11:04:14] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-28 11:04:14] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-28 11:04:14] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-05-28 11:04:15] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-28 11:04:15] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-28 11:04:15] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-28 11:04:15] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-28 11:04:15] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-28 11:04:15] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-28 11:04:15] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-28 11:04:15] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-28 11:04:15] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-28 11:04:15] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-28 11:04:16] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 11:04:17] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:04:18] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:04:18] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 3 ms to minimize.
[2024-05-28 11:04:18] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-28 11:04:18] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:04:19] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 2 ms to minimize.
[2024-05-28 11:04:19] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 2 ms to minimize.
[2024-05-28 11:04:19] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-28 11:04:19] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-28 11:04:19] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-28 11:04:20] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 2 ms to minimize.
[2024-05-28 11:04:20] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 2 ms to minimize.
[2024-05-28 11:04:20] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2024-05-28 11:04:20] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 2 ms to minimize.
[2024-05-28 11:04:20] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-05-28 11:04:20] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
[2024-05-28 11:04:20] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-28 11:04:20] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-28 11:04:21] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-05-28 11:04:21] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 11:04:24] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 3 ms to minimize.
[2024-05-28 11:04:24] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-28 11:04:24] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2024-05-28 11:04:25] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 2 ms to minimize.
[2024-05-28 11:04:25] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-28 11:04:25] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-05-28 11:04:25] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 2 ms to minimize.
[2024-05-28 11:04:25] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 2 ms to minimize.
[2024-05-28 11:04:25] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2024-05-28 11:04:25] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
[2024-05-28 11:04:25] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-05-28 11:04:25] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-05-28 11:04:26] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-28 11:04:26] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 3 ms to minimize.
[2024-05-28 11:04:26] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-28 11:04:26] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-05-28 11:04:26] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-05-28 11:04:26] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 2 ms to minimize.
[2024-05-28 11:04:26] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 2 ms to minimize.
[2024-05-28 11:04:26] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 11:04:29] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-28 11:04:30] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-28 11:04:30] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
[2024-05-28 11:04:30] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-05-28 11:04:30] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 2 ms to minimize.
[2024-05-28 11:04:31] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-05-28 11:04:31] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
[2024-05-28 11:04:31] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 3 ms to minimize.
[2024-05-28 11:04:31] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 1 ms to minimize.
[2024-05-28 11:04:31] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 1 ms to minimize.
[2024-05-28 11:04:31] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 2 ms to minimize.
[2024-05-28 11:04:31] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 2 ms to minimize.
[2024-05-28 11:04:32] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-05-28 11:04:32] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 2 ms to minimize.
[2024-05-28 11:04:32] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-05-28 11:04:32] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2024-05-28 11:04:32] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 2 ms to minimize.
[2024-05-28 11:04:32] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-28 11:04:32] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-28 11:04:33] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 20/291 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 533/1056 variables, and 291 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/533 constraints, PredecessorRefiner: 0/522 constraints, Known Traps: 200/200 constraints]
After SMT, in 60103ms problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
Starting structural reductions in LTL mode, iteration 1 : 533/535 places, 523/525 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60693 ms. Remains : 533/535 places, 523/525 transitions.
Stuttering acceptance computed with spot in 351 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (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 : ShieldIIPs-PT-010B-LTLFireability-10
Product exploration explored 100000 steps with 20000 reset in 116 ms.
Product exploration explored 100000 steps with 20000 reset in 115 ms.
Computed a total of 120 stabilizing places and 120 stable transitions
Computed a total of 120 stabilizing places and 120 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 8 states, 9 edges and 2 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 323 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 9420 steps (5 resets) in 50 ms. (184 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 142 ms. Reduced automaton from 8 states, 9 edges and 2 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 304 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (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 325 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (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 533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 533/533 places, 523/523 transitions.
Applied a total of 0 rules in 5 ms. Remains 533 /533 variables (removed 0) and now considering 523/523 (removed 0) transitions.
[2024-05-28 11:04:35] [INFO ] Invariant cache hit.
[2024-05-28 11:04:35] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-28 11:04:35] [INFO ] Invariant cache hit.
[2024-05-28 11:04:36] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
Running 522 sub problems to find dead transitions.
[2024-05-28 11:04:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (OVERLAPS) 1/533 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 11:04:44] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-28 11:04:44] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-28 11:04:44] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 1 ms to minimize.
[2024-05-28 11:04:44] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 1 ms to minimize.
[2024-05-28 11:04:44] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 2 ms to minimize.
[2024-05-28 11:04:45] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 1 ms to minimize.
[2024-05-28 11:04:45] [INFO ] Deduced a trap composed of 66 places in 100 ms of which 2 ms to minimize.
[2024-05-28 11:04:45] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 2 ms to minimize.
[2024-05-28 11:04:45] [INFO ] Deduced a trap composed of 50 places in 123 ms of which 2 ms to minimize.
[2024-05-28 11:04:45] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2024-05-28 11:04:46] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-28 11:04:46] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 2 ms to minimize.
[2024-05-28 11:04:46] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:04:46] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 3 ms to minimize.
[2024-05-28 11:04:46] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 3 ms to minimize.
[2024-05-28 11:04:46] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:04:46] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-28 11:04:46] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-28 11:04:46] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 2 ms to minimize.
[2024-05-28 11:04:47] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 11:04:48] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 4 ms to minimize.
[2024-05-28 11:04:48] [INFO ] Deduced a trap composed of 24 places in 168 ms of which 3 ms to minimize.
[2024-05-28 11:04:49] [INFO ] Deduced a trap composed of 19 places in 182 ms of which 3 ms to minimize.
[2024-05-28 11:04:49] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-05-28 11:04:49] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-28 11:04:49] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-28 11:04:49] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-28 11:04:49] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-05-28 11:04:49] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-28 11:04:49] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 3 ms to minimize.
[2024-05-28 11:04:49] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-28 11:04:50] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2024-05-28 11:04:50] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-28 11:04:50] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:04:50] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 2 ms to minimize.
[2024-05-28 11:04:50] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:04:50] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-28 11:04:50] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-28 11:04:50] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-28 11:04:50] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 11:04:55] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 3 ms to minimize.
[2024-05-28 11:04:56] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 2 ms to minimize.
[2024-05-28 11:04:56] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 0 ms to minimize.
[2024-05-28 11:04:56] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 0 ms to minimize.
[2024-05-28 11:04:56] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 3 ms to minimize.
[2024-05-28 11:04:57] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 ms to minimize.
[2024-05-28 11:04:57] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-28 11:04:57] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-28 11:04:57] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-28 11:04:57] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-28 11:04:57] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-28 11:04:57] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
[2024-05-28 11:04:57] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-28 11:04:57] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-05-28 11:04:57] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-28 11:04:57] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-28 11:04:57] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-28 11:04:57] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-28 11:04:57] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-28 11:04:58] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 11:04:58] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
[2024-05-28 11:04:59] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2024-05-28 11:05:00] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 2 ms to minimize.
[2024-05-28 11:05:00] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-05-28 11:05:00] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 2 ms to minimize.
[2024-05-28 11:05:00] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 1 ms to minimize.
[2024-05-28 11:05:00] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-05-28 11:05:00] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2024-05-28 11:05:00] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2024-05-28 11:05:01] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-05-28 11:05:01] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
[2024-05-28 11:05:01] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 2 ms to minimize.
[2024-05-28 11:05:01] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 2 ms to minimize.
[2024-05-28 11:05:01] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 2 ms to minimize.
[2024-05-28 11:05:01] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 2 ms to minimize.
[2024-05-28 11:05:01] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 2 ms to minimize.
[2024-05-28 11:05:01] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 1 ms to minimize.
[2024-05-28 11:05:01] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
[2024-05-28 11:05:02] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 2 ms to minimize.
[2024-05-28 11:05:02] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 11:05:03] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-28 11:05:04] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:05:04] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-05-28 11:05:04] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 2 ms to minimize.
[2024-05-28 11:05:04] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 3 ms to minimize.
[2024-05-28 11:05:04] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 0 ms to minimize.
[2024-05-28 11:05:04] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 2 ms to minimize.
[2024-05-28 11:05:04] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:05:04] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-28 11:05:05] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 0 ms to minimize.
[2024-05-28 11:05:05] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-28 11:05:05] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-05-28 11:05:05] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2024-05-28 11:05:05] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
[2024-05-28 11:05:05] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-28 11:05:05] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-28 11:05:05] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-28 11:05:05] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-28 11:05:05] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-28 11:05:05] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 533/1056 variables, and 191 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/533 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (OVERLAPS) 1/533 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 100/191 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 11:05:11] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 3 ms to minimize.
[2024-05-28 11:05:12] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2024-05-28 11:05:12] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-28 11:05:12] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-05-28 11:05:12] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-28 11:05:12] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-28 11:05:12] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2024-05-28 11:05:12] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-28 11:05:13] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 1 ms to minimize.
[2024-05-28 11:05:13] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 3 ms to minimize.
[2024-05-28 11:05:13] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 0 ms to minimize.
[2024-05-28 11:05:13] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-28 11:05:13] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-28 11:05:13] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 2 ms to minimize.
[2024-05-28 11:05:13] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-28 11:05:14] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-05-28 11:05:14] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 1 ms to minimize.
[2024-05-28 11:05:14] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 0 ms to minimize.
[2024-05-28 11:05:14] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-28 11:05:14] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 11:05:15] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-28 11:05:16] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 0 ms to minimize.
[2024-05-28 11:05:17] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 2 ms to minimize.
[2024-05-28 11:05:17] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 2 ms to minimize.
[2024-05-28 11:05:17] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 0 ms to minimize.
[2024-05-28 11:05:17] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2024-05-28 11:05:17] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 0 ms to minimize.
[2024-05-28 11:05:17] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 0 ms to minimize.
[2024-05-28 11:05:17] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-28 11:05:17] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-28 11:05:17] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 2 ms to minimize.
[2024-05-28 11:05:18] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-05-28 11:05:18] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-28 11:05:18] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2024-05-28 11:05:18] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 1 ms to minimize.
[2024-05-28 11:05:18] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-28 11:05:18] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-05-28 11:05:18] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-05-28 11:05:18] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2024-05-28 11:05:18] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 11:05:20] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-28 11:05:21] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-28 11:05:21] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 3 ms to minimize.
[2024-05-28 11:05:21] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-05-28 11:05:21] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-28 11:05:22] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 2 ms to minimize.
[2024-05-28 11:05:22] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 2 ms to minimize.
[2024-05-28 11:05:22] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 1 ms to minimize.
[2024-05-28 11:05:22] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2024-05-28 11:05:23] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-28 11:05:23] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 2 ms to minimize.
[2024-05-28 11:05:23] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 2 ms to minimize.
[2024-05-28 11:05:23] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 1 ms to minimize.
[2024-05-28 11:05:23] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 2 ms to minimize.
[2024-05-28 11:05:23] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 1 ms to minimize.
[2024-05-28 11:05:23] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2024-05-28 11:05:24] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-28 11:05:24] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-05-28 11:05:24] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 1 ms to minimize.
[2024-05-28 11:05:24] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 11:05:27] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-28 11:05:28] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2024-05-28 11:05:28] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 1 ms to minimize.
[2024-05-28 11:05:28] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2024-05-28 11:05:28] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2024-05-28 11:05:28] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2024-05-28 11:05:29] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 2 ms to minimize.
[2024-05-28 11:05:29] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 1 ms to minimize.
[2024-05-28 11:05:29] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
[2024-05-28 11:05:29] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-05-28 11:05:29] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2024-05-28 11:05:29] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
[2024-05-28 11:05:29] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-05-28 11:05:29] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-05-28 11:05:30] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2024-05-28 11:05:30] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 2 ms to minimize.
[2024-05-28 11:05:30] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-05-28 11:05:30] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
[2024-05-28 11:05:30] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-05-28 11:05:30] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 11:05:33] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-28 11:05:34] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2024-05-28 11:05:34] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 2 ms to minimize.
[2024-05-28 11:05:34] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-28 11:05:34] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 3 ms to minimize.
[2024-05-28 11:05:35] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 1 ms to minimize.
[2024-05-28 11:05:35] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
[2024-05-28 11:05:35] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 7 ms to minimize.
[2024-05-28 11:05:35] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 2 ms to minimize.
[2024-05-28 11:05:35] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 1 ms to minimize.
[2024-05-28 11:05:35] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 1 ms to minimize.
[2024-05-28 11:05:36] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 2 ms to minimize.
[2024-05-28 11:05:36] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
SMT process timed out in 60140ms, After SMT, problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 60145ms
Finished structural reductions in LTL mode , in 1 iterations and 60681 ms. Remains : 533/533 places, 523/523 transitions.
Computed a total of 120 stabilizing places and 120 stable transitions
Computed a total of 120 stabilizing places and 120 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 67 ms. Reduced automaton from 8 states, 9 edges and 2 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 7158 steps (3 resets) in 31 ms. (223 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 164 ms. Reduced automaton from 8 states, 9 edges and 2 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (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 260 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (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 252 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (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 20000 reset in 129 ms.
Product exploration explored 100000 steps with 20000 reset in 113 ms.
Applying partial POR strategy [true, true, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 381 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (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 533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 533/533 places, 523/523 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 533 transition count 523
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 22 Pre rules applied. Total rules applied 49 place count 533 transition count 525
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 71 place count 533 transition count 525
Performed 209 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 280 places in 0 ms
Iterating global reduction 1 with 209 rules applied. Total rules applied 280 place count 533 transition count 525
Discarding 71 places :
Symmetric choice reduction at 1 with 71 rule applications. Total rules 351 place count 462 transition count 454
Deduced a syphon composed of 209 places in 0 ms
Iterating global reduction 1 with 71 rules applied. Total rules applied 422 place count 462 transition count 454
Deduced a syphon composed of 209 places in 1 ms
Applied a total of 422 rules in 129 ms. Remains 462 /533 variables (removed 71) and now considering 454/523 (removed 69) transitions.
[2024-05-28 11:05:38] [INFO ] Redundant transitions in 404 ms returned [453]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 452 sub problems to find dead transitions.
// Phase 1: matrix 453 rows 462 cols
[2024-05-28 11:05:38] [INFO ] Computed 91 invariants in 5 ms
[2024-05-28 11:05:38] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/461 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (OVERLAPS) 1/462 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-05-28 11:05:44] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2024-05-28 11:05:44] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-28 11:05:45] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2024-05-28 11:05:45] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-28 11:05:45] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-28 11:05:45] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-28 11:05:45] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-28 11:05:45] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-28 11:05:45] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-28 11:05:45] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-28 11:05:45] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-28 11:05:45] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-28 11:05:45] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-28 11:05:45] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-28 11:05:45] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-05-28 11:05:46] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-05-28 11:05:46] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 0 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-05-28 11:05:46] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-05-28 11:05:46] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
[2024-05-28 11:05:46] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD420 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 20/111 constraints. Problems are: Problem set: 85 solved, 367 unsolved
[2024-05-28 11:05:46] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-28 11:05:46] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-05-28 11:05:46] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-05-28 11:05:46] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-05-28 11:05:47] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-05-28 11:05:47] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 0 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-05-28 11:05:47] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
[2024-05-28 11:05:47] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-05-28 11:05:47] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
Problem TDEAD81 is UNSAT
[2024-05-28 11:05:47] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-05-28 11:05:47] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD87 is UNSAT
[2024-05-28 11:05:47] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
[2024-05-28 11:05:47] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD91 is UNSAT
[2024-05-28 11:05:47] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
Problem TDEAD92 is UNSAT
[2024-05-28 11:05:47] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Problem TDEAD93 is UNSAT
[2024-05-28 11:05:47] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
Problem TDEAD94 is UNSAT
[2024-05-28 11:05:47] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
[2024-05-28 11:05:47] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
Problem TDEAD98 is UNSAT
[2024-05-28 11:05:47] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
Problem TDEAD99 is UNSAT
[2024-05-28 11:05:47] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 4 ms to minimize.
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD87 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 TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 20/131 constraints. Problems are: Problem set: 142 solved, 310 unsolved
[2024-05-28 11:05:50] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
[2024-05-28 11:05:50] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
Problem TDEAD104 is UNSAT
[2024-05-28 11:05:50] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
Problem TDEAD105 is UNSAT
[2024-05-28 11:05:50] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
Problem TDEAD106 is UNSAT
[2024-05-28 11:05:50] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
[2024-05-28 11:05:50] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
Problem TDEAD110 is UNSAT
[2024-05-28 11:05:50] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
Problem TDEAD111 is UNSAT
[2024-05-28 11:05:50] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
[2024-05-28 11:05:50] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
Problem TDEAD116 is UNSAT
[2024-05-28 11:05:50] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
Problem TDEAD117 is UNSAT
[2024-05-28 11:05:50] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
Problem TDEAD118 is UNSAT
[2024-05-28 11:05:50] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
[2024-05-28 11:05:51] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
Problem TDEAD122 is UNSAT
[2024-05-28 11:05:51] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
Problem TDEAD123 is UNSAT
[2024-05-28 11:05:51] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
[2024-05-28 11:05:51] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
Problem TDEAD127 is UNSAT
[2024-05-28 11:05:51] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
Problem TDEAD128 is UNSAT
[2024-05-28 11:05:51] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
Problem TDEAD129 is UNSAT
[2024-05-28 11:05:51] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
Problem TDEAD130 is UNSAT
[2024-05-28 11:05:51] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 20/151 constraints. Problems are: Problem set: 180 solved, 272 unsolved
[2024-05-28 11:05:52] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
Problem TDEAD134 is UNSAT
[2024-05-28 11:05:52] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
Problem TDEAD135 is UNSAT
[2024-05-28 11:05:52] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
Problem TDEAD136 is UNSAT
[2024-05-28 11:05:52] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-28 11:05:52] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:05:52] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-28 11:05:52] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
[2024-05-28 11:05:52] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
Problem TDEAD140 is UNSAT
[2024-05-28 11:05:52] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 2 ms to minimize.
Problem TDEAD141 is UNSAT
[2024-05-28 11:05:52] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
Problem TDEAD142 is UNSAT
[2024-05-28 11:05:52] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
Problem TDEAD143 is UNSAT
[2024-05-28 11:05:52] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
[2024-05-28 11:05:53] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
Problem TDEAD147 is UNSAT
[2024-05-28 11:05:53] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 0 ms to minimize.
Problem TDEAD148 is UNSAT
[2024-05-28 11:05:53] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
Problem TDEAD150 is UNSAT
[2024-05-28 11:05:53] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-05-28 11:05:53] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:05:53] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
Problem TDEAD179 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
[2024-05-28 11:05:53] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 0 ms to minimize.
Problem TDEAD186 is UNSAT
Problem TDEAD211 is UNSAT
[2024-05-28 11:05:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD449 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 20/171 constraints. Problems are: Problem set: 203 solved, 249 unsolved
[2024-05-28 11:05:54] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
Problem TDEAD239 is UNSAT
[2024-05-28 11:05:54] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD266 is UNSAT
[2024-05-28 11:05:55] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD293 is UNSAT
[2024-05-28 11:05:55] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD320 is UNSAT
[2024-05-28 11:05:55] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:05:55] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:05:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD346 is UNSAT
[2024-05-28 11:05:55] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD373 is UNSAT
[2024-05-28 11:05:55] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD400 is UNSAT
[2024-05-28 11:05:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD426 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 10/181 constraints. Problems are: Problem set: 211 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 0/181 constraints. Problems are: Problem set: 211 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 453/915 variables, 462/643 constraints. Problems are: Problem set: 211 solved, 241 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/915 variables, 3/646 constraints. Problems are: Problem set: 211 solved, 241 unsolved
[2024-05-28 11:06:02] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/915 variables, 1/647 constraints. Problems are: Problem set: 211 solved, 241 unsolved
[2024-05-28 11:06:03] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-28 11:06:03] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-28 11:06:03] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:06:03] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-28 11:06:03] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-28 11:06:04] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 11:06:04] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-28 11:06:04] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-28 11:06:04] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:06:05] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/915 variables, 10/657 constraints. Problems are: Problem set: 211 solved, 241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 915/915 variables, and 657 constraints, problems are : Problem set: 211 solved, 241 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 462/462 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 101/101 constraints]
Escalating to Integer solving :Problem set: 211 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 0/0 constraints. Problems are: Problem set: 211 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 210/462 variables, 91/91 constraints. Problems are: Problem set: 211 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 101/192 constraints. Problems are: Problem set: 211 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 0/192 constraints. Problems are: Problem set: 211 solved, 241 unsolved
At refinement iteration 4 (OVERLAPS) 453/915 variables, 462/654 constraints. Problems are: Problem set: 211 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/915 variables, 3/657 constraints. Problems are: Problem set: 211 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/915 variables, 241/898 constraints. Problems are: Problem set: 211 solved, 241 unsolved
[2024-05-28 11:06:16] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-28 11:06:16] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:06:17] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-28 11:06:17] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:06:17] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:06:18] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:06:18] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-28 11:06:18] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:06:19] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:06:21] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-28 11:06:22] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-28 11:06:25] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-28 11:06:27] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/915 variables, 13/911 constraints. Problems are: Problem set: 211 solved, 241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 915/915 variables, and 911 constraints, problems are : Problem set: 211 solved, 241 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 462/462 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 241/452 constraints, Known Traps: 114/114 constraints]
After SMT, in 60130ms problems are : Problem set: 211 solved, 241 unsolved
Search for dead transitions found 211 dead transitions in 60134ms
Found 211 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 211 transitions
Dead transitions reduction (with SMT) removed 211 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 462/533 places, 242/523 transitions.
Graph (complete) has 881 edges and 462 vertex of which 253 are kept as prefixes of interest. Removing 209 places using SCC suffix rule.2 ms
Discarding 209 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 253 /462 variables (removed 209) and now considering 242/242 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 253/533 places, 242/523 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60708 ms. Remains : 253/533 places, 242/523 transitions.
Built C files in :
/tmp/ltsmin15323677159812606409
[2024-05-28 11:06:39] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15323677159812606409
Running compilation step : cd /tmp/ltsmin15323677159812606409;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 958 ms.
Running link step : cd /tmp/ltsmin15323677159812606409;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin15323677159812606409;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10965715057837371811.hoa' '--buchi-type=spotba'
LTSmin run took 1376 ms.
FORMULA ShieldIIPs-PT-010B-LTLFireability-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPs-PT-010B-LTLFireability-10 finished in 188485 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0&&X(!p1)&&F(!p2))||(p0&&X(G(!p1)))))))'
Support contains 7 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 525/525 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 532 transition count 522
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 532 transition count 522
Applied a total of 6 rules in 10 ms. Remains 532 /535 variables (removed 3) and now considering 522/525 (removed 3) transitions.
// Phase 1: matrix 522 rows 532 cols
[2024-05-28 11:06:41] [INFO ] Computed 91 invariants in 2 ms
[2024-05-28 11:06:41] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-28 11:06:41] [INFO ] Invariant cache hit.
[2024-05-28 11:06:42] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
Running 521 sub problems to find dead transitions.
[2024-05-28 11:06:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (OVERLAPS) 1/532 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:06:50] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-05-28 11:06:50] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 1 ms to minimize.
[2024-05-28 11:06:50] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 1 ms to minimize.
[2024-05-28 11:06:50] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 1 ms to minimize.
[2024-05-28 11:06:50] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 2 ms to minimize.
[2024-05-28 11:06:51] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
[2024-05-28 11:06:51] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 2 ms to minimize.
[2024-05-28 11:06:51] [INFO ] Deduced a trap composed of 34 places in 126 ms of which 3 ms to minimize.
[2024-05-28 11:06:51] [INFO ] Deduced a trap composed of 48 places in 138 ms of which 3 ms to minimize.
[2024-05-28 11:06:51] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 3 ms to minimize.
[2024-05-28 11:06:52] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 3 ms to minimize.
[2024-05-28 11:06:52] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-28 11:06:52] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 11:06:52] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-28 11:06:52] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-28 11:06:52] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 2 ms to minimize.
[2024-05-28 11:06:52] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 3 ms to minimize.
[2024-05-28 11:06:53] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-28 11:06:53] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:06:53] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:06:54] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-28 11:06:54] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-28 11:06:54] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
[2024-05-28 11:06:55] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-28 11:06:55] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:06:55] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2024-05-28 11:06:55] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 11:06:55] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 3 ms to minimize.
[2024-05-28 11:06:55] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 3 ms to minimize.
[2024-05-28 11:06:55] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-28 11:06:55] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-28 11:06:56] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 0 ms to minimize.
[2024-05-28 11:06:56] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-05-28 11:06:56] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2024-05-28 11:06:56] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-05-28 11:06:56] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 5 ms to minimize.
[2024-05-28 11:06:56] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-28 11:06:56] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-28 11:06:56] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-28 11:06:56] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:07:02] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 3 ms to minimize.
[2024-05-28 11:07:02] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 2 ms to minimize.
[2024-05-28 11:07:02] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 2 ms to minimize.
[2024-05-28 11:07:02] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 3 ms to minimize.
[2024-05-28 11:07:03] [INFO ] Deduced a trap composed of 15 places in 196 ms of which 4 ms to minimize.
[2024-05-28 11:07:03] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-28 11:07:03] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-28 11:07:03] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-28 11:07:03] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-28 11:07:04] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-05-28 11:07:04] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-28 11:07:04] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-05-28 11:07:04] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-05-28 11:07:04] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 1 ms to minimize.
[2024-05-28 11:07:04] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-28 11:07:04] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-28 11:07:04] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-28 11:07:04] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
[2024-05-28 11:07:05] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-05-28 11:07:05] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:07:07] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 2 ms to minimize.
[2024-05-28 11:07:07] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-05-28 11:07:08] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 3 ms to minimize.
[2024-05-28 11:07:08] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-05-28 11:07:08] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-05-28 11:07:08] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-28 11:07:08] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-28 11:07:08] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-28 11:07:08] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-28 11:07:08] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 0 ms to minimize.
[2024-05-28 11:07:08] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 3 ms to minimize.
[2024-05-28 11:07:09] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 2 ms to minimize.
[2024-05-28 11:07:09] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-05-28 11:07:09] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 2 ms to minimize.
[2024-05-28 11:07:09] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-05-28 11:07:09] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-28 11:07:09] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 2 ms to minimize.
[2024-05-28 11:07:09] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 1 ms to minimize.
[2024-05-28 11:07:10] [INFO ] Deduced a trap composed of 33 places in 150 ms of which 2 ms to minimize.
[2024-05-28 11:07:10] [INFO ] Deduced a trap composed of 33 places in 165 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/1054 variables, and 171 constraints, problems are : Problem set: 0 solved, 521 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/532 constraints, PredecessorRefiner: 521/521 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (OVERLAPS) 1/532 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 80/171 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:07:17] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:07:17] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-28 11:07:17] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 3 ms to minimize.
[2024-05-28 11:07:17] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 2 ms to minimize.
[2024-05-28 11:07:18] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-28 11:07:18] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2024-05-28 11:07:18] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 2 ms to minimize.
[2024-05-28 11:07:18] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:07:18] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-28 11:07:19] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2024-05-28 11:07:19] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 2 ms to minimize.
[2024-05-28 11:07:19] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-05-28 11:07:19] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-28 11:07:19] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-28 11:07:19] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2024-05-28 11:07:20] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 2 ms to minimize.
[2024-05-28 11:07:20] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-28 11:07:20] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-28 11:07:20] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
[2024-05-28 11:07:20] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:07:21] [INFO ] Deduced a trap composed of 29 places in 150 ms of which 2 ms to minimize.
[2024-05-28 11:07:22] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 0 ms to minimize.
[2024-05-28 11:07:22] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 3 ms to minimize.
[2024-05-28 11:07:23] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 0 ms to minimize.
[2024-05-28 11:07:23] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:07:23] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 0 ms to minimize.
[2024-05-28 11:07:23] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 1 ms to minimize.
[2024-05-28 11:07:23] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 0 ms to minimize.
[2024-05-28 11:07:24] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-28 11:07:24] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-28 11:07:24] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-28 11:07:24] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
[2024-05-28 11:07:24] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 2 ms to minimize.
[2024-05-28 11:07:24] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-28 11:07:24] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-28 11:07:24] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 0 ms to minimize.
[2024-05-28 11:07:24] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:07:24] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 4 ms to minimize.
[2024-05-28 11:07:24] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-28 11:07:25] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:07:26] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-28 11:07:27] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 3 ms to minimize.
[2024-05-28 11:07:27] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-05-28 11:07:28] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-28 11:07:28] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 2 ms to minimize.
[2024-05-28 11:07:28] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 2 ms to minimize.
[2024-05-28 11:07:28] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2024-05-28 11:07:29] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2024-05-28 11:07:29] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-28 11:07:29] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 2 ms to minimize.
[2024-05-28 11:07:29] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-28 11:07:29] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-28 11:07:29] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-05-28 11:07:29] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 2 ms to minimize.
[2024-05-28 11:07:29] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-28 11:07:29] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
[2024-05-28 11:07:29] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 2 ms to minimize.
[2024-05-28 11:07:30] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
[2024-05-28 11:07:30] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2024-05-28 11:07:30] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:07:32] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 3 ms to minimize.
[2024-05-28 11:07:32] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:07:33] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2024-05-28 11:07:33] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-05-28 11:07:33] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
[2024-05-28 11:07:33] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 2 ms to minimize.
[2024-05-28 11:07:33] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 1 ms to minimize.
[2024-05-28 11:07:34] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-05-28 11:07:34] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-28 11:07:34] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 2 ms to minimize.
[2024-05-28 11:07:34] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
[2024-05-28 11:07:34] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2024-05-28 11:07:34] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 1 ms to minimize.
[2024-05-28 11:07:34] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-05-28 11:07:34] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2024-05-28 11:07:35] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-05-28 11:07:35] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 2 ms to minimize.
[2024-05-28 11:07:35] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-05-28 11:07:35] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
[2024-05-28 11:07:35] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:07:38] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-28 11:07:38] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-05-28 11:07:39] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2024-05-28 11:07:39] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2024-05-28 11:07:39] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-28 11:07:39] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-05-28 11:07:40] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 2 ms to minimize.
[2024-05-28 11:07:40] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-05-28 11:07:40] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-28 11:07:40] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 2 ms to minimize.
[2024-05-28 11:07:40] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-28 11:07:40] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 1 ms to minimize.
[2024-05-28 11:07:40] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-05-28 11:07:40] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-05-28 11:07:41] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-28 11:07:41] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-28 11:07:41] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-28 11:07:41] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-28 11:07:41] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2024-05-28 11:07:41] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/1054 variables, and 271 constraints, problems are : Problem set: 0 solved, 521 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/532 constraints, PredecessorRefiner: 0/521 constraints, Known Traps: 180/180 constraints]
After SMT, in 60105ms problems are : Problem set: 0 solved, 521 unsolved
Search for dead transitions found 0 dead transitions in 60109ms
Starting structural reductions in LTL mode, iteration 1 : 532/535 places, 522/525 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60644 ms. Remains : 532/535 places, 522/525 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-11
Product exploration explored 100000 steps with 33370 reset in 151 ms.
Product exploration explored 100000 steps with 33357 reset in 144 ms.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 105 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
RANDOM walk for 40000 steps (28 resets) in 283 ms. (140 steps per ms) remains 2/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
[2024-05-28 11:07:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/75 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 457/532 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 522/1054 variables, 532/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1054 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/1054 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1054/1054 variables, and 623 constraints, problems are : Problem set: 0 solved, 2 unsolved in 397 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 532/532 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/75 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 457/532 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 11:07:43] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-28 11:07:43] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 522/1054 variables, 532/625 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1054 variables, 2/627 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 11:07:44] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 2 ms to minimize.
[2024-05-28 11:07:44] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 1 ms to minimize.
[2024-05-28 11:07:44] [INFO ] Deduced a trap composed of 44 places in 455 ms of which 1 ms to minimize.
[2024-05-28 11:07:44] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 2 ms to minimize.
[2024-05-28 11:07:44] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-28 11:07:45] [INFO ] Deduced a trap composed of 23 places in 280 ms of which 1 ms to minimize.
[2024-05-28 11:07:45] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 1 ms to minimize.
[2024-05-28 11:07:45] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1054 variables, 8/635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1054 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1054 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1054/1054 variables, and 635 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2295 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 532/532 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints]
After SMT, in 2732ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 498 ms.
Support contains 7 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 522/522 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 532 transition count 473
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 483 transition count 473
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 98 place count 483 transition count 422
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 200 place count 432 transition count 422
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 0 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 2 with 350 rules applied. Total rules applied 550 place count 257 transition count 247
Partial Free-agglomeration rule applied 65 times.
Drop transitions (Partial Free agglomeration) removed 65 transitions
Iterating global reduction 2 with 65 rules applied. Total rules applied 615 place count 257 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 616 place count 256 transition count 246
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 617 place count 255 transition count 246
Applied a total of 617 rules in 35 ms. Remains 255 /532 variables (removed 277) and now considering 246/522 (removed 276) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 255/532 places, 246/522 transitions.
RANDOM walk for 40000 steps (41 resets) in 679 ms. (58 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
// Phase 1: matrix 246 rows 255 cols
[2024-05-28 11:07:46] [INFO ] Computed 90 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/29 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/38 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/95 variables, 38/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 67/162 variables, 38/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 12/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/163 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/163 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 56/219 variables, 24/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/219 variables, 9/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/219 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 68/287 variables, 36/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/287 variables, 10/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/287 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/289 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/289 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/289 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 4/293 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/293 variables, 4/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/293 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 32/325 variables, 18/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/325 variables, 6/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/325 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1/326 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/326 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/326 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 27/353 variables, 14/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/353 variables, 4/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/353 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 1/354 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/354 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/354 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 2/356 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/356 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/356 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 21/377 variables, 10/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/377 variables, 4/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/377 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 25/402 variables, 12/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/402 variables, 3/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/402 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 1/403 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/403 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/403 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 2/405 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/405 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/405 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 21/426 variables, 10/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/426 variables, 4/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/426 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 25/451 variables, 12/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/451 variables, 3/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/451 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 1/452 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/452 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/452 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 2/454 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/454 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/454 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 21/475 variables, 10/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/475 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/475 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 18/493 variables, 9/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/493 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/493 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 2/495 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/495 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/495 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 1/496 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/496 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/496 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 5/501 variables, 4/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/501 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/501 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 0/501 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 345 constraints, problems are : Problem set: 0 solved, 1 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 255/255 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/29 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/38 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/95 variables, 38/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 67/162 variables, 38/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 12/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/163 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/163 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/163 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 56/219 variables, 24/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/219 variables, 9/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/219 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 68/287 variables, 36/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/287 variables, 10/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/287 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/289 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/289 variables, 2/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/289 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 4/293 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/293 variables, 4/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/293 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 32/325 variables, 18/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/325 variables, 6/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/325 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 1/326 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/326 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/326 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 27/353 variables, 14/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/353 variables, 4/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/353 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 1/354 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/354 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/354 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 2/356 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/356 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/356 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 21/377 variables, 10/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/377 variables, 4/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 11:07:47] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-28 11:07:47] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
At refinement iteration 44 (INCLUDED_ONLY) 0/377 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/377 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 25/402 variables, 12/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/402 variables, 3/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/402 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 1/403 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/403 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/403 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 2/405 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/405 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/405 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 21/426 variables, 10/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/426 variables, 4/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/426 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 25/451 variables, 12/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/451 variables, 3/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/451 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 1/452 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/452 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/452 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 2/454 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/454 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/454 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 21/475 variables, 10/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/475 variables, 4/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/475 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (OVERLAPS) 18/493 variables, 9/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/493 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/493 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 2/495 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/495 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/495 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 1/496 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/496 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/496 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 5/501 variables, 4/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/501 variables, 2/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/501 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 0/501 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 501/501 variables, and 348 constraints, problems are : Problem set: 0 solved, 1 unsolved in 552 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 872ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 7 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 246/246 transitions.
Applied a total of 0 rules in 4 ms. Remains 255 /255 variables (removed 0) and now considering 246/246 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 255/255 places, 246/246 transitions.
RANDOM walk for 14791 steps (14 resets) in 59 ms. (246 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p0 (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p0) (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F p2), (F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 20 factoid took 378 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Support contains 7 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 522/522 transitions.
Applied a total of 0 rules in 6 ms. Remains 532 /532 variables (removed 0) and now considering 522/522 (removed 0) transitions.
// Phase 1: matrix 522 rows 532 cols
[2024-05-28 11:07:48] [INFO ] Computed 91 invariants in 3 ms
[2024-05-28 11:07:48] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-28 11:07:48] [INFO ] Invariant cache hit.
[2024-05-28 11:07:48] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
Running 521 sub problems to find dead transitions.
[2024-05-28 11:07:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (OVERLAPS) 1/532 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:07:56] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-28 11:07:56] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-05-28 11:07:57] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2024-05-28 11:07:57] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 1 ms to minimize.
[2024-05-28 11:07:57] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 2 ms to minimize.
[2024-05-28 11:07:57] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 2 ms to minimize.
[2024-05-28 11:07:58] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 2 ms to minimize.
[2024-05-28 11:07:58] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 2 ms to minimize.
[2024-05-28 11:07:58] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 3 ms to minimize.
[2024-05-28 11:07:58] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 2 ms to minimize.
[2024-05-28 11:07:58] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 3 ms to minimize.
[2024-05-28 11:07:59] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-28 11:07:59] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 11:07:59] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-28 11:07:59] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-28 11:07:59] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 2 ms to minimize.
[2024-05-28 11:07:59] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 3 ms to minimize.
[2024-05-28 11:07:59] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-28 11:07:59] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-28 11:07:59] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:08:01] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-28 11:08:01] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-28 11:08:01] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-28 11:08:01] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-28 11:08:01] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:08:01] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:08:02] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-28 11:08:02] [INFO ] Deduced a trap composed of 25 places in 178 ms of which 3 ms to minimize.
[2024-05-28 11:08:02] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 3 ms to minimize.
[2024-05-28 11:08:02] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2024-05-28 11:08:02] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-28 11:08:02] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-28 11:08:02] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-28 11:08:02] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-28 11:08:02] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 11:08:03] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 11:08:03] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2024-05-28 11:08:03] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-28 11:08:03] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-28 11:08:03] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:08:08] [INFO ] Deduced a trap composed of 39 places in 146 ms of which 2 ms to minimize.
[2024-05-28 11:08:08] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 3 ms to minimize.
[2024-05-28 11:08:09] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 3 ms to minimize.
[2024-05-28 11:08:09] [INFO ] Deduced a trap composed of 20 places in 161 ms of which 3 ms to minimize.
[2024-05-28 11:08:09] [INFO ] Deduced a trap composed of 15 places in 188 ms of which 3 ms to minimize.
[2024-05-28 11:08:09] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-28 11:08:10] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-28 11:08:10] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 0 ms to minimize.
[2024-05-28 11:08:10] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-28 11:08:10] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2024-05-28 11:08:10] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:08:10] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-28 11:08:10] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2024-05-28 11:08:10] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-05-28 11:08:11] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-05-28 11:08:11] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
[2024-05-28 11:08:11] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-28 11:08:11] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-28 11:08:11] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-05-28 11:08:11] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:08:13] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 2 ms to minimize.
[2024-05-28 11:08:13] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-05-28 11:08:14] [INFO ] Deduced a trap composed of 27 places in 180 ms of which 2 ms to minimize.
[2024-05-28 11:08:14] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-28 11:08:14] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-28 11:08:14] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-05-28 11:08:14] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2024-05-28 11:08:14] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-05-28 11:08:14] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-05-28 11:08:15] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-28 11:08:15] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 2 ms to minimize.
[2024-05-28 11:08:15] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 2 ms to minimize.
[2024-05-28 11:08:15] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-05-28 11:08:15] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
[2024-05-28 11:08:15] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-28 11:08:15] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-28 11:08:16] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 1 ms to minimize.
[2024-05-28 11:08:16] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-05-28 11:08:16] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 3 ms to minimize.
[2024-05-28 11:08:16] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:08:18] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/1054 variables, and 172 constraints, problems are : Problem set: 0 solved, 521 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/532 constraints, PredecessorRefiner: 521/521 constraints, Known Traps: 81/81 constraints]
Escalating to Integer solving :Problem set: 0 solved, 521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (OVERLAPS) 1/532 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 81/172 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:08:24] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 2 ms to minimize.
[2024-05-28 11:08:24] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 2 ms to minimize.
[2024-05-28 11:08:24] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-28 11:08:24] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:08:25] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 3 ms to minimize.
[2024-05-28 11:08:25] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 2 ms to minimize.
[2024-05-28 11:08:25] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 0 ms to minimize.
[2024-05-28 11:08:25] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-28 11:08:25] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:08:25] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:08:25] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-28 11:08:26] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 2 ms to minimize.
[2024-05-28 11:08:26] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-28 11:08:26] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 0 ms to minimize.
[2024-05-28 11:08:26] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:08:26] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 3 ms to minimize.
[2024-05-28 11:08:26] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-28 11:08:27] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-28 11:08:27] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-28 11:08:27] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:08:28] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:08:29] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 1 ms to minimize.
[2024-05-28 11:08:29] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 2 ms to minimize.
[2024-05-28 11:08:29] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-05-28 11:08:30] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-05-28 11:08:30] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-28 11:08:30] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-28 11:08:30] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-05-28 11:08:30] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 1 ms to minimize.
[2024-05-28 11:08:30] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-28 11:08:30] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:08:30] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-28 11:08:30] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-28 11:08:31] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
[2024-05-28 11:08:31] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
[2024-05-28 11:08:31] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-05-28 11:08:31] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 1 ms to minimize.
[2024-05-28 11:08:31] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 2 ms to minimize.
[2024-05-28 11:08:31] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-05-28 11:08:31] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:08:34] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-28 11:08:34] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-28 11:08:34] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:08:34] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-28 11:08:35] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-28 11:08:35] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2024-05-28 11:08:35] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-28 11:08:35] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 2 ms to minimize.
[2024-05-28 11:08:35] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-28 11:08:35] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-05-28 11:08:35] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 1 ms to minimize.
[2024-05-28 11:08:35] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
[2024-05-28 11:08:35] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
[2024-05-28 11:08:36] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2024-05-28 11:08:36] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-05-28 11:08:36] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-28 11:08:36] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-28 11:08:36] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2024-05-28 11:08:36] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-28 11:08:36] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 20/232 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:08:39] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-28 11:08:39] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-28 11:08:39] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-28 11:08:39] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 2 ms to minimize.
[2024-05-28 11:08:40] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
[2024-05-28 11:08:40] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-05-28 11:08:40] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-05-28 11:08:40] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 2 ms to minimize.
[2024-05-28 11:08:40] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2024-05-28 11:08:40] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 1 ms to minimize.
[2024-05-28 11:08:40] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2024-05-28 11:08:40] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2024-05-28 11:08:41] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-05-28 11:08:41] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2024-05-28 11:08:41] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 2 ms to minimize.
[2024-05-28 11:08:41] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2024-05-28 11:08:41] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 2 ms to minimize.
[2024-05-28 11:08:41] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 1 ms to minimize.
[2024-05-28 11:08:41] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2024-05-28 11:08:41] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 20/252 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:08:45] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-28 11:08:45] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-28 11:08:45] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 2 ms to minimize.
[2024-05-28 11:08:45] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 1 ms to minimize.
[2024-05-28 11:08:45] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-05-28 11:08:45] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-28 11:08:46] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2024-05-28 11:08:46] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2024-05-28 11:08:46] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 1 ms to minimize.
[2024-05-28 11:08:46] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
[2024-05-28 11:08:46] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2024-05-28 11:08:46] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 1 ms to minimize.
[2024-05-28 11:08:46] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 2 ms to minimize.
[2024-05-28 11:08:46] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-05-28 11:08:47] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2024-05-28 11:08:47] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-05-28 11:08:47] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 3 ms to minimize.
[2024-05-28 11:08:47] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 1 ms to minimize.
[2024-05-28 11:08:47] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 2 ms to minimize.
[2024-05-28 11:08:47] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 20/272 constraints. Problems are: Problem set: 0 solved, 521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/1054 variables, and 272 constraints, problems are : Problem set: 0 solved, 521 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/532 constraints, PredecessorRefiner: 0/521 constraints, Known Traps: 181/181 constraints]
After SMT, in 60120ms problems are : Problem set: 0 solved, 521 unsolved
Search for dead transitions found 0 dead transitions in 60125ms
Finished structural reductions in LTL mode , in 1 iterations and 60643 ms. Remains : 532/532 places, 522/522 transitions.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p0))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 107 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
RANDOM walk for 40000 steps (29 resets) in 1603 ms. (24 steps per ms) remains 2/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
[2024-05-28 11:08:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/75 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 457/532 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 522/1054 variables, 532/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1054 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/1054 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1054/1054 variables, and 623 constraints, problems are : Problem set: 0 solved, 2 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 532/532 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/75 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 457/532 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 11:08:50] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-28 11:08:50] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 522/1054 variables, 532/625 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1054 variables, 2/627 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 11:08:50] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 1 ms to minimize.
[2024-05-28 11:08:50] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2024-05-28 11:08:50] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 1 ms to minimize.
[2024-05-28 11:08:50] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-05-28 11:08:50] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-28 11:08:51] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-28 11:08:51] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-28 11:08:51] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1054 variables, 8/635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1054 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1054 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1054/1054 variables, and 635 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1233 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 532/532 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints]
After SMT, in 1516ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 489 ms.
Support contains 7 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 522/522 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 532 transition count 473
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 483 transition count 473
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 98 place count 483 transition count 422
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 200 place count 432 transition count 422
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 1 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 2 with 350 rules applied. Total rules applied 550 place count 257 transition count 247
Partial Free-agglomeration rule applied 65 times.
Drop transitions (Partial Free agglomeration) removed 65 transitions
Iterating global reduction 2 with 65 rules applied. Total rules applied 615 place count 257 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 616 place count 256 transition count 246
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 617 place count 255 transition count 246
Applied a total of 617 rules in 29 ms. Remains 255 /532 variables (removed 277) and now considering 246/522 (removed 276) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 255/532 places, 246/522 transitions.
RANDOM walk for 22645 steps (23 resets) in 385 ms. (58 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p0))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p0 (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p0) (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F p2), (F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 20 factoid took 423 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Product exploration explored 100000 steps with 33650 reset in 146 ms.
Product exploration explored 100000 steps with 33312 reset in 142 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Support contains 7 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 522/522 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 532 transition count 522
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 23 Pre rules applied. Total rules applied 48 place count 532 transition count 524
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 71 place count 532 transition count 524
Performed 204 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 275 places in 0 ms
Iterating global reduction 1 with 204 rules applied. Total rules applied 275 place count 532 transition count 524
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 342 place count 465 transition count 457
Deduced a syphon composed of 208 places in 0 ms
Iterating global reduction 1 with 67 rules applied. Total rules applied 409 place count 465 transition count 457
Deduced a syphon composed of 208 places in 1 ms
Applied a total of 409 rules in 36 ms. Remains 465 /532 variables (removed 67) and now considering 457/522 (removed 65) transitions.
[2024-05-28 11:08:53] [INFO ] Redundant transitions in 24 ms returned [456]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 455 sub problems to find dead transitions.
// Phase 1: matrix 456 rows 465 cols
[2024-05-28 11:08:53] [INFO ] Computed 91 invariants in 3 ms
[2024-05-28 11:08:53] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/465 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-05-28 11:09:00] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-28 11:09:00] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-28 11:09:00] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-28 11:09:00] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-28 11:09:00] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-28 11:09:00] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-28 11:09:00] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-28 11:09:00] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-28 11:09:00] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-28 11:09:00] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-28 11:09:00] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-28 11:09:00] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-28 11:09:00] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 0 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-05-28 11:09:01] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-05-28 11:09:01] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-28 11:09:01] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-05-28 11:09:01] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-05-28 11:09:01] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-28 11:09:01] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-05-28 11:09:01] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD423 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 20/111 constraints. Problems are: Problem set: 81 solved, 374 unsolved
[2024-05-28 11:09:01] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-28 11:09:01] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-05-28 11:09:02] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 0 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-05-28 11:09:02] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-05-28 11:09:02] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-05-28 11:09:02] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-05-28 11:09:02] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
Problem TDEAD75 is UNSAT
[2024-05-28 11:09:02] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-05-28 11:09:02] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
Problem TDEAD81 is UNSAT
[2024-05-28 11:09:02] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-05-28 11:09:02] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD87 is UNSAT
[2024-05-28 11:09:02] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
[2024-05-28 11:09:02] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD91 is UNSAT
[2024-05-28 11:09:02] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD92 is UNSAT
[2024-05-28 11:09:02] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
Problem TDEAD93 is UNSAT
[2024-05-28 11:09:02] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD94 is UNSAT
[2024-05-28 11:09:02] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
[2024-05-28 11:09:02] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD98 is UNSAT
[2024-05-28 11:09:02] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD99 is UNSAT
[2024-05-28 11:09:02] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD87 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 TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD450 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/465 variables, 20/131 constraints. Problems are: Problem set: 138 solved, 317 unsolved
[2024-05-28 11:09:05] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
[2024-05-28 11:09:05] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
Problem TDEAD104 is UNSAT
[2024-05-28 11:09:05] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
Problem TDEAD105 is UNSAT
[2024-05-28 11:09:05] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
Problem TDEAD106 is UNSAT
[2024-05-28 11:09:05] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
[2024-05-28 11:09:05] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
Problem TDEAD110 is UNSAT
[2024-05-28 11:09:05] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
Problem TDEAD111 is UNSAT
[2024-05-28 11:09:05] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
Problem TDEAD112 is UNSAT
[2024-05-28 11:09:05] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
[2024-05-28 11:09:05] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
Problem TDEAD118 is UNSAT
[2024-05-28 11:09:06] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
Problem TDEAD119 is UNSAT
[2024-05-28 11:09:06] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
[2024-05-28 11:09:06] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 0 ms to minimize.
Problem TDEAD123 is UNSAT
[2024-05-28 11:09:06] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
Problem TDEAD124 is UNSAT
[2024-05-28 11:09:06] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
Problem TDEAD125 is UNSAT
[2024-05-28 11:09:06] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
[2024-05-28 11:09:06] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
Problem TDEAD129 is UNSAT
[2024-05-28 11:09:06] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 0 ms to minimize.
Problem TDEAD130 is UNSAT
[2024-05-28 11:09:06] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
Problem TDEAD131 is UNSAT
[2024-05-28 11:09:06] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 20/151 constraints. Problems are: Problem set: 177 solved, 278 unsolved
[2024-05-28 11:09:06] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-28 11:09:06] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-28 11:09:07] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
[2024-05-28 11:09:07] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 2 ms to minimize.
[2024-05-28 11:09:07] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
Problem TDEAD136 is UNSAT
[2024-05-28 11:09:07] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
[2024-05-28 11:09:07] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
Problem TDEAD142 is UNSAT
[2024-05-28 11:09:07] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
Problem TDEAD145 is UNSAT
[2024-05-28 11:09:07] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
Problem TDEAD146 is UNSAT
[2024-05-28 11:09:07] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD147 is UNSAT
[2024-05-28 11:09:07] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
[2024-05-28 11:09:07] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD151 is UNSAT
[2024-05-28 11:09:07] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD152 is UNSAT
[2024-05-28 11:09:07] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
Problem TDEAD155 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
[2024-05-28 11:09:08] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
[2024-05-28 11:09:08] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2024-05-28 11:09:08] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-05-28 11:09:08] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2024-05-28 11:09:08] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-28 11:09:08] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD452 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 20/171 constraints. Problems are: Problem set: 202 solved, 253 unsolved
[2024-05-28 11:09:09] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-28 11:09:09] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD244 is UNSAT
[2024-05-28 11:09:10] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD271 is UNSAT
[2024-05-28 11:09:10] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD298 is UNSAT
[2024-05-28 11:09:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD322 is UNSAT
[2024-05-28 11:09:10] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD349 is UNSAT
[2024-05-28 11:09:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD376 is UNSAT
[2024-05-28 11:09:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD403 is UNSAT
[2024-05-28 11:09:10] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
Problem TDEAD429 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 9/180 constraints. Problems are: Problem set: 210 solved, 245 unsolved
[2024-05-28 11:09:13] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2024-05-28 11:09:13] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-28 11:09:13] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-28 11:09:13] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/465 variables, 4/184 constraints. Problems are: Problem set: 210 solved, 245 unsolved
[2024-05-28 11:09:15] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/465 variables, 1/185 constraints. Problems are: Problem set: 210 solved, 245 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/465 variables, 0/185 constraints. Problems are: Problem set: 210 solved, 245 unsolved
At refinement iteration 10 (OVERLAPS) 456/921 variables, 465/650 constraints. Problems are: Problem set: 210 solved, 245 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/921 variables, 3/653 constraints. Problems are: Problem set: 210 solved, 245 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/921 variables, 0/653 constraints. Problems are: Problem set: 210 solved, 245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 921/921 variables, and 653 constraints, problems are : Problem set: 210 solved, 245 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 465/465 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 94/94 constraints]
Escalating to Integer solving :Problem set: 210 solved, 245 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 210 solved, 245 unsolved
At refinement iteration 1 (OVERLAPS) 209/465 variables, 91/91 constraints. Problems are: Problem set: 210 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 94/185 constraints. Problems are: Problem set: 210 solved, 245 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/465 variables, 0/185 constraints. Problems are: Problem set: 210 solved, 245 unsolved
At refinement iteration 4 (OVERLAPS) 456/921 variables, 465/650 constraints. Problems are: Problem set: 210 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/921 variables, 3/653 constraints. Problems are: Problem set: 210 solved, 245 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/921 variables, 245/898 constraints. Problems are: Problem set: 210 solved, 245 unsolved
[2024-05-28 11:09:31] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 0 ms to minimize.
[2024-05-28 11:09:31] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:09:32] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2024-05-28 11:09:32] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-28 11:09:32] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:09:32] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:09:32] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-28 11:09:32] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 11:09:33] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-28 11:09:35] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-28 11:09:35] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-28 11:09:35] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 12/910 constraints. Problems are: Problem set: 210 solved, 245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 921/921 variables, and 910 constraints, problems are : Problem set: 210 solved, 245 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 465/465 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 245/455 constraints, Known Traps: 106/106 constraints]
After SMT, in 60175ms problems are : Problem set: 210 solved, 245 unsolved
Search for dead transitions found 210 dead transitions in 60179ms
Found 210 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 210 transitions
Dead transitions reduction (with SMT) removed 210 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 465/532 places, 246/522 transitions.
Graph (complete) has 886 edges and 465 vertex of which 257 are kept as prefixes of interest. Removing 208 places using SCC suffix rule.0 ms
Discarding 208 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 257 /465 variables (removed 208) and now considering 246/246 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 257/532 places, 246/522 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60250 ms. Remains : 257/532 places, 246/522 transitions.
Built C files in :
/tmp/ltsmin16888883258302676414
[2024-05-28 11:09:54] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16888883258302676414
Running compilation step : cd /tmp/ltsmin16888883258302676414;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 894 ms.
Running link step : cd /tmp/ltsmin16888883258302676414;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16888883258302676414;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9402104560808664342.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 522/522 transitions.
Applied a total of 0 rules in 5 ms. Remains 532 /532 variables (removed 0) and now considering 522/522 (removed 0) transitions.
// Phase 1: matrix 522 rows 532 cols
[2024-05-28 11:10:09] [INFO ] Computed 91 invariants in 2 ms
[2024-05-28 11:10:09] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-28 11:10:09] [INFO ] Invariant cache hit.
[2024-05-28 11:10:09] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
Running 521 sub problems to find dead transitions.
[2024-05-28 11:10:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (OVERLAPS) 1/532 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:10:17] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-05-28 11:10:17] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2024-05-28 11:10:17] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2024-05-28 11:10:18] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 2 ms to minimize.
[2024-05-28 11:10:18] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 2 ms to minimize.
[2024-05-28 11:10:18] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 2 ms to minimize.
[2024-05-28 11:10:18] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 2 ms to minimize.
[2024-05-28 11:10:19] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 3 ms to minimize.
[2024-05-28 11:10:19] [INFO ] Deduced a trap composed of 48 places in 137 ms of which 2 ms to minimize.
[2024-05-28 11:10:19] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 2 ms to minimize.
[2024-05-28 11:10:19] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 2 ms to minimize.
[2024-05-28 11:10:19] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-28 11:10:19] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-28 11:10:19] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-28 11:10:19] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-28 11:10:20] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 3 ms to minimize.
[2024-05-28 11:10:20] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 3 ms to minimize.
[2024-05-28 11:10:20] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 0 ms to minimize.
[2024-05-28 11:10:20] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-28 11:10:20] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:10:21] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 0 ms to minimize.
[2024-05-28 11:10:22] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:10:22] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2024-05-28 11:10:22] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:10:22] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-28 11:10:22] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-28 11:10:22] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2024-05-28 11:10:22] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 3 ms to minimize.
[2024-05-28 11:10:23] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 3 ms to minimize.
[2024-05-28 11:10:23] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-05-28 11:10:23] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-28 11:10:23] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 0 ms to minimize.
[2024-05-28 11:10:23] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-05-28 11:10:23] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-05-28 11:10:23] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-28 11:10:23] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-05-28 11:10:23] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:10:23] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-28 11:10:24] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-28 11:10:24] [INFO ] Deduced a trap composed of 21 places in 154 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:10:29] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 2 ms to minimize.
[2024-05-28 11:10:29] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 2 ms to minimize.
[2024-05-28 11:10:29] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 3 ms to minimize.
[2024-05-28 11:10:30] [INFO ] Deduced a trap composed of 20 places in 188 ms of which 3 ms to minimize.
[2024-05-28 11:10:30] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 3 ms to minimize.
[2024-05-28 11:10:30] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-28 11:10:30] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-28 11:10:30] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:10:30] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-28 11:10:31] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-05-28 11:10:31] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-28 11:10:31] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-28 11:10:31] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 1 ms to minimize.
[2024-05-28 11:10:31] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-05-28 11:10:31] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
[2024-05-28 11:10:31] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-28 11:10:31] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2024-05-28 11:10:32] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2024-05-28 11:10:32] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-28 11:10:32] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:10:34] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 3 ms to minimize.
[2024-05-28 11:10:34] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-28 11:10:35] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 2 ms to minimize.
[2024-05-28 11:10:35] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-05-28 11:10:35] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-28 11:10:35] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-05-28 11:10:35] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-28 11:10:35] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-28 11:10:35] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-28 11:10:35] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-28 11:10:35] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 3 ms to minimize.
[2024-05-28 11:10:36] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 2 ms to minimize.
[2024-05-28 11:10:36] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-05-28 11:10:36] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
[2024-05-28 11:10:36] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-28 11:10:36] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-28 11:10:36] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 1 ms to minimize.
[2024-05-28 11:10:36] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2024-05-28 11:10:37] [INFO ] Deduced a trap composed of 33 places in 145 ms of which 2 ms to minimize.
[2024-05-28 11:10:37] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 11:10:39] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-05-28 11:10:39] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
SMT process timed out in 30087ms, After SMT, problems are : Problem set: 0 solved, 521 unsolved
Search for dead transitions found 0 dead transitions in 30091ms
Finished structural reductions in LTL mode , in 1 iterations and 30692 ms. Remains : 532/532 places, 522/522 transitions.
Built C files in :
/tmp/ltsmin15185426925482567665
[2024-05-28 11:10:39] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15185426925482567665
Running compilation step : cd /tmp/ltsmin15185426925482567665;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 913 ms.
Running link step : cd /tmp/ltsmin15185426925482567665;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15185426925482567665;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2415618801623507210.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 11:10:54] [INFO ] Flatten gal took : 15 ms
[2024-05-28 11:10:54] [INFO ] Flatten gal took : 13 ms
[2024-05-28 11:10:54] [INFO ] Time to serialize gal into /tmp/LTL8233480118551947258.gal : 18 ms
[2024-05-28 11:10:54] [INFO ] Time to serialize properties into /tmp/LTL17200284781923808699.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8233480118551947258.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14964814214813340004.hoa' '-atoms' '/tmp/LTL17200284781923808699.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17200284781923808699.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14964814214813340004.hoa
Detected timeout of ITS tools.
[2024-05-28 11:11:10] [INFO ] Flatten gal took : 13 ms
[2024-05-28 11:11:10] [INFO ] Flatten gal took : 14 ms
[2024-05-28 11:11:10] [INFO ] Time to serialize gal into /tmp/LTL7148122842474652341.gal : 3 ms
[2024-05-28 11:11:10] [INFO ] Time to serialize properties into /tmp/LTL8125022115002302187.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7148122842474652341.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8125022115002302187.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F((((X("((p265!=1)||(p294!=1))"))&&(F("((p39!=1)||(p90!=1))")))&&("(((p36==0)||(p55==0))||(p69==0))"))||((X(G("((p265!=1)||(p294!...206
Formula 0 simplified : FG((!"(((p36==0)||(p55==0))||(p69==0))" | X!"((p265!=1)||(p294!=1))" | G!"((p39!=1)||(p90!=1))") & (!"(((p36==0)||(p55==0))||(p69==0...190
Detected timeout of ITS tools.
[2024-05-28 11:11:25] [INFO ] Flatten gal took : 17 ms
[2024-05-28 11:11:25] [INFO ] Applying decomposition
[2024-05-28 11:11:25] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph166447217034785102.txt' '-o' '/tmp/graph166447217034785102.bin' '-w' '/tmp/graph166447217034785102.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph166447217034785102.bin' '-l' '-1' '-v' '-w' '/tmp/graph166447217034785102.weights' '-q' '0' '-e' '0.001'
[2024-05-28 11:11:25] [INFO ] Decomposing Gal with order
[2024-05-28 11:11:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 11:11:25] [INFO ] Removed a total of 230 redundant transitions.
[2024-05-28 11:11:25] [INFO ] Flatten gal took : 46 ms
[2024-05-28 11:11:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-28 11:11:25] [INFO ] Time to serialize gal into /tmp/LTL4154595022409385095.gal : 12 ms
[2024-05-28 11:11:25] [INFO ] Time to serialize properties into /tmp/LTL2610366058799031637.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4154595022409385095.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2610366058799031637.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F((((X("((i4.i2.u87.p265!=1)||(i4.i4.u97.p294!=1))"))&&(F("((i0.i2.u15.p39!=1)||(i1.i4.u32.p90!=1))")))&&("(((i0.i5.u13.p36==0)||...326
Formula 0 simplified : FG((!"(((i0.i5.u13.p36==0)||(i0.i5.u19.p55==0))||(i0.i6.u23.p69==0))" | X!"((i4.i2.u87.p265!=1)||(i4.i4.u97.p294!=1))" | G!"((i0.i2....310
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-010B-LTLFireability-11 finished in 298957 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1||F(p2))))))'
Support contains 3 out of 535 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 535/535 places, 525/525 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 534 transition count 473
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 483 transition count 473
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 102 place count 483 transition count 422
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 204 place count 432 transition count 422
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 205 place count 431 transition count 421
Iterating global reduction 2 with 1 rules applied. Total rules applied 206 place count 431 transition count 421
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 206 place count 431 transition count 420
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 208 place count 430 transition count 420
Performed 176 Post agglomeration using F-continuation condition.Transition count delta: 176
Deduced a syphon composed of 176 places in 0 ms
Reduce places removed 176 places and 0 transitions.
Iterating global reduction 2 with 352 rules applied. Total rules applied 560 place count 254 transition count 244
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 562 place count 252 transition count 242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 563 place count 251 transition count 242
Applied a total of 563 rules in 53 ms. Remains 251 /535 variables (removed 284) and now considering 242/525 (removed 283) transitions.
// Phase 1: matrix 242 rows 251 cols
[2024-05-28 11:11:40] [INFO ] Computed 90 invariants in 1 ms
[2024-05-28 11:11:40] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-05-28 11:11:40] [INFO ] Invariant cache hit.
[2024-05-28 11:11:41] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
[2024-05-28 11:11:41] [INFO ] Redundant transitions in 29 ms returned [241]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 240 sub problems to find dead transitions.
// Phase 1: matrix 241 rows 251 cols
[2024-05-28 11:11:41] [INFO ] Computed 90 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:11:42] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-28 11:11:42] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-28 11:11:42] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-28 11:11:42] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-28 11:11:42] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 0 ms to minimize.
[2024-05-28 11:11:42] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-28 11:11:42] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-28 11:11:42] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2024-05-28 11:11:42] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2024-05-28 11:11:42] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-28 11:11:42] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:11:42] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-28 11:11:42] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-28 11:11:43] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-28 11:11:43] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-28 11:11:43] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-28 11:11:43] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2024-05-28 11:11:43] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-28 11:11:43] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-05-28 11:11:43] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:11:43] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-28 11:11:44] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-28 11:11:44] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-05-28 11:11:44] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2024-05-28 11:11:44] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-05-28 11:11:44] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-05-28 11:11:44] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-28 11:11:44] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 1 ms to minimize.
[2024-05-28 11:11:44] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:11:44] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:11:44] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:11:45] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 11:11:45] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 11:11:45] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 11:11:45] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:11:45] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:11:45] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:11:45] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:11:45] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 11:11:45] [INFO ] Deduced a trap composed of 10 places in 15 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:11:45] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:11:45] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-28 11:11:46] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-05-28 11:11:46] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-28 11:11:46] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-05-28 11:11:46] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2024-05-28 11:11:46] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-05-28 11:11:46] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-05-28 11:11:46] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 9/139 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (OVERLAPS) 241/492 variables, 251/390 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:11:49] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-28 11:11:49] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2024-05-28 11:11:50] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:11:50] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:11:50] [INFO ] Deduced a trap composed of 7 places in 265 ms of which 7 ms to minimize.
[2024-05-28 11:11:51] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-28 11:11:51] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 7/397 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:11:54] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:11:54] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:11:55] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/492 variables, 3/400 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:11:56] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-28 11:11:56] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:11:56] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 3/403 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:11:59] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-28 11:11:59] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:11:59] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:11:59] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:11:59] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 5/408 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:12:00] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 11:12:01] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-28 11:12:01] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-28 11:12:01] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2024-05-28 11:12:01] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-28 11:12:01] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:12:01] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 7/415 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:12:03] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-05-28 11:12:03] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-05-28 11:12:03] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:12:06] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:12:07] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-28 11:12:07] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 11:12:07] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:12:08] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/492 variables, 4/423 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:12:09] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-28 11:12:10] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 492/492 variables, and 425 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 84/84 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 84/174 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 241/492 variables, 251/425 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/492 variables, 240/665 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/492 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (OVERLAPS) 0/492 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Int declared 492/492 variables, and 665 constraints, problems are : Problem set: 0 solved, 240 unsolved in 16331 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 84/84 constraints]
After SMT, in 46378ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 46380ms
Starting structural reductions in SI_LTL mode, iteration 1 : 251/535 places, 241/525 transitions.
Applied a total of 0 rules in 4 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 47024 ms. Remains : 251/535 places, 241/525 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-12
Product exploration explored 100000 steps with 187 reset in 319 ms.
Product exploration explored 100000 steps with 188 reset in 377 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND p1 p0 (NOT p2))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 p0 (NOT p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 140 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 10306 steps (16 resets) in 152 ms. (67 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND p1 p0 (NOT p2))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 p0 (NOT p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2 p1))), (F (NOT p0)), (F (NOT p1)), (F p2), (F (NOT (AND p0 (NOT p2) p1))), (F (NOT (AND (OR p0 p2) (OR p2 p1))))]
Knowledge based reduction with 13 factoid took 328 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 3 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 241/241 transitions.
Applied a total of 0 rules in 3 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2024-05-28 11:12:29] [INFO ] Invariant cache hit.
[2024-05-28 11:12:29] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-28 11:12:29] [INFO ] Invariant cache hit.
[2024-05-28 11:12:29] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2024-05-28 11:12:29] [INFO ] Redundant transitions in 27 ms returned []
Running 240 sub problems to find dead transitions.
[2024-05-28 11:12:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:12:30] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-28 11:12:30] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-28 11:12:30] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-28 11:12:30] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-28 11:12:30] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-28 11:12:30] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:12:31] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-28 11:12:31] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-28 11:12:31] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-28 11:12:31] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:12:31] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2024-05-28 11:12:31] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-28 11:12:31] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:12:31] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2024-05-28 11:12:31] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 0 ms to minimize.
[2024-05-28 11:12:31] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-28 11:12:31] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-28 11:12:31] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 0 ms to minimize.
[2024-05-28 11:12:31] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-28 11:12:32] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:12:32] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:12:32] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-05-28 11:12:32] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-28 11:12:32] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-28 11:12:32] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 2 ms to minimize.
[2024-05-28 11:12:33] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-28 11:12:33] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:12:33] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-28 11:12:33] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 11:12:33] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 11:12:33] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:12:33] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:12:33] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:12:33] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:12:33] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
[2024-05-28 11:12:33] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-28 11:12:33] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:12:33] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 18/128 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:12:34] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:12:34] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (OVERLAPS) 241/492 variables, 251/381 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:12:40] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:12:40] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:12:40] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-28 11:12:40] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/492 variables, 4/385 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:12:41] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:12:41] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:12:41] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-28 11:12:41] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:12:42] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:12:42] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-28 11:12:42] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2024-05-28 11:12:42] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-28 11:12:42] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 9/394 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:12:44] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:12:46] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:12:47] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-28 11:12:47] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:12:48] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-28 11:12:48] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 4/400 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:12:49] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:12:49] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 2/402 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:12:52] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:12:54] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:12:54] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/492 variables, 2/405 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:12:56] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:12:56] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/492 variables, 2/407 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:12:59] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2024-05-28 11:12:59] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 492/492 variables, and 409 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 68/68 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 68/158 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 241/492 variables, 251/409 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/492 variables, 240/649 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:13:03] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:13:03] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-28 11:13:03] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/492 variables, 3/652 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:13:24] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/492 variables, 1/653 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 653 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 72/72 constraints]
After SMT, in 60059ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 60061ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60476 ms. Remains : 251/251 places, 241/241 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (AND p0 (NOT p2) p1)), (X p0), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (AND p0 (NOT p2) p1))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 115 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 7373 steps (11 resets) in 126 ms. (58 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (AND p0 (NOT p2) p1)), (X p0), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (AND p0 (NOT p2) p1))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2 p1))), (F (NOT p0)), (F (NOT p1)), (F p2), (F (NOT (AND p0 (NOT p2) p1))), (F (NOT (AND (OR p0 p2) (OR p2 p1))))]
Knowledge based reduction with 13 factoid took 337 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 66 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 66 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 189 reset in 334 ms.
Product exploration explored 100000 steps with 187 reset in 372 ms.
Built C files in :
/tmp/ltsmin10161634458804050177
[2024-05-28 11:13:31] [INFO ] Computing symmetric may disable matrix : 241 transitions.
[2024-05-28 11:13:31] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 11:13:31] [INFO ] Computing symmetric may enable matrix : 241 transitions.
[2024-05-28 11:13:31] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 11:13:31] [INFO ] Computing Do-Not-Accords matrix : 241 transitions.
[2024-05-28 11:13:31] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 11:13:31] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10161634458804050177
Running compilation step : cd /tmp/ltsmin10161634458804050177;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 562 ms.
Running link step : cd /tmp/ltsmin10161634458804050177;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin10161634458804050177;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1233004502974006062.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 241/241 transitions.
Applied a total of 0 rules in 7 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2024-05-28 11:13:46] [INFO ] Invariant cache hit.
[2024-05-28 11:13:46] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-28 11:13:46] [INFO ] Invariant cache hit.
[2024-05-28 11:13:46] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2024-05-28 11:13:46] [INFO ] Redundant transitions in 42 ms returned []
Running 240 sub problems to find dead transitions.
[2024-05-28 11:13:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:13:47] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-28 11:13:47] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-28 11:13:47] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-28 11:13:47] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-28 11:13:48] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:13:48] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-28 11:13:48] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-28 11:13:48] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-28 11:13:48] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:13:48] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:13:48] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:13:48] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:13:48] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-28 11:13:48] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 4 ms to minimize.
[2024-05-28 11:13:48] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2024-05-28 11:13:48] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-28 11:13:48] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-28 11:13:48] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-28 11:13:49] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-28 11:13:49] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:13:49] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-28 11:13:49] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-28 11:13:49] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-05-28 11:13:49] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-28 11:13:49] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2024-05-28 11:13:50] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:13:50] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 15 ms to minimize.
[2024-05-28 11:13:50] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-05-28 11:13:50] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:13:50] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 11:13:50] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 11:13:50] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 11:13:50] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:13:50] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
[2024-05-28 11:13:50] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:13:50] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 11:13:50] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:13:50] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 18/128 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:13:51] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-28 11:13:51] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (OVERLAPS) 241/492 variables, 251/381 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:13:57] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 11:13:57] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-28 11:13:57] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-28 11:13:57] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/492 variables, 4/385 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:13:58] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:13:58] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:13:59] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:13:59] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:13:59] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-28 11:13:59] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:13:59] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:13:59] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-28 11:13:59] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 9/394 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:14:01] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:14:03] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:14:04] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:14:04] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-28 11:14:05] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2024-05-28 11:14:05] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 4/400 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:14:06] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:14:06] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 2/402 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:14:09] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:14:11] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:14:11] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/492 variables, 2/405 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:14:12] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:14:12] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/492 variables, 2/407 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 11:14:15] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:14:16] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:14:16] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
SMT process timed out in 30038ms, After SMT, problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 30040ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30453 ms. Remains : 251/251 places, 241/241 transitions.
Built C files in :
/tmp/ltsmin12718198217928682282
[2024-05-28 11:14:16] [INFO ] Computing symmetric may disable matrix : 241 transitions.
[2024-05-28 11:14:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 11:14:16] [INFO ] Computing symmetric may enable matrix : 241 transitions.
[2024-05-28 11:14:16] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 11:14:16] [INFO ] Computing Do-Not-Accords matrix : 241 transitions.
[2024-05-28 11:14:16] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 11:14:16] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12718198217928682282
Running compilation step : cd /tmp/ltsmin12718198217928682282;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 539 ms.
Running link step : cd /tmp/ltsmin12718198217928682282;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin12718198217928682282;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10412689301619029793.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 11:14:31] [INFO ] Flatten gal took : 8 ms
[2024-05-28 11:14:31] [INFO ] Flatten gal took : 8 ms
[2024-05-28 11:14:31] [INFO ] Time to serialize gal into /tmp/LTL13950905788841173422.gal : 2 ms
[2024-05-28 11:14:31] [INFO ] Time to serialize properties into /tmp/LTL14773703036078052983.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13950905788841173422.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15530447755369598796.hoa' '-atoms' '/tmp/LTL14773703036078052983.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL14773703036078052983.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15530447755369598796.hoa
Detected timeout of ITS tools.
[2024-05-28 11:14:46] [INFO ] Flatten gal took : 13 ms
[2024-05-28 11:14:46] [INFO ] Flatten gal took : 7 ms
[2024-05-28 11:14:46] [INFO ] Time to serialize gal into /tmp/LTL5894370982137677099.gal : 2 ms
[2024-05-28 11:14:46] [INFO ] Time to serialize properties into /tmp/LTL17451100320993815158.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5894370982137677099.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17451100320993815158.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("(p124==0)")&&(("(p158==0)")||(F("(p586==1)")))))))
Formula 0 simplified : GF(!"(p124==0)" | (!"(p158==0)" & G!"(p586==1)"))
Detected timeout of ITS tools.
[2024-05-28 11:15:02] [INFO ] Flatten gal took : 12 ms
[2024-05-28 11:15:02] [INFO ] Applying decomposition
[2024-05-28 11:15:02] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2726184788159877077.txt' '-o' '/tmp/graph2726184788159877077.bin' '-w' '/tmp/graph2726184788159877077.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2726184788159877077.bin' '-l' '-1' '-v' '-w' '/tmp/graph2726184788159877077.weights' '-q' '0' '-e' '0.001'
[2024-05-28 11:15:02] [INFO ] Decomposing Gal with order
[2024-05-28 11:15:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 11:15:02] [INFO ] Removed a total of 155 redundant transitions.
[2024-05-28 11:15:02] [INFO ] Flatten gal took : 30 ms
[2024-05-28 11:15:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 148 labels/synchronizations in 4 ms.
[2024-05-28 11:15:02] [INFO ] Time to serialize gal into /tmp/LTL7575405487714255683.gal : 17 ms
[2024-05-28 11:15:02] [INFO ] Time to serialize properties into /tmp/LTL16653871110065278847.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7575405487714255683.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16653871110065278847.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G(("(i1.i0.u18.p124==0)")&&(("(i2.i2.u24.p158==0)")||(F("(i9.i2.u88.p586==1)")))))))
Formula 0 simplified : GF(!"(i1.i0.u18.p124==0)" | (!"(i2.i2.u24.p158==0)" & G!"(i9.i2.u88.p586==1)"))
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-010B-LTLFireability-12 finished in 216757 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(p1)||p0))))'
Support contains 5 out of 535 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 535/535 places, 525/525 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 534 transition count 475
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 485 transition count 475
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 98 place count 485 transition count 423
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 202 place count 433 transition count 423
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 205 place count 430 transition count 420
Iterating global reduction 2 with 3 rules applied. Total rules applied 208 place count 430 transition count 420
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 208 place count 430 transition count 419
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 210 place count 429 transition count 419
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 0 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 2 with 350 rules applied. Total rules applied 560 place count 254 transition count 244
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 562 place count 252 transition count 242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 563 place count 251 transition count 242
Applied a total of 563 rules in 33 ms. Remains 251 /535 variables (removed 284) and now considering 242/525 (removed 283) transitions.
// Phase 1: matrix 242 rows 251 cols
[2024-05-28 11:15:17] [INFO ] Computed 90 invariants in 0 ms
[2024-05-28 11:15:17] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-28 11:15:17] [INFO ] Invariant cache hit.
[2024-05-28 11:15:17] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
[2024-05-28 11:15:17] [INFO ] Redundant transitions in 34 ms returned [241]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 238 sub problems to find dead transitions.
// Phase 1: matrix 241 rows 251 cols
[2024-05-28 11:15:17] [INFO ] Computed 90 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:15:18] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:15:18] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2024-05-28 11:15:19] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 0 ms to minimize.
[2024-05-28 11:15:19] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-28 11:15:19] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-28 11:15:19] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-28 11:15:19] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:15:19] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:15:19] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:15:19] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-28 11:15:19] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:15:19] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:15:19] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 0 ms to minimize.
[2024-05-28 11:15:19] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-28 11:15:19] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
[2024-05-28 11:15:19] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-28 11:15:19] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-05-28 11:15:20] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-28 11:15:20] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2024-05-28 11:15:20] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:15:20] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-28 11:15:20] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-28 11:15:21] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-05-28 11:15:21] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:15:21] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 11:15:21] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:15:21] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:15:21] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 11:15:21] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 11:15:21] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 11:15:21] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 11/117 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:15:22] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2024-05-28 11:15:22] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:15:22] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:15:22] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-28 11:15:22] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 5/122 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:15:24] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-28 11:15:24] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 2/251 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:15:27] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-28 11:15:27] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:15:27] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-28 11:15:27] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-28 11:15:27] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-28 11:15:28] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-05-28 11:15:28] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-05-28 11:15:28] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:15:29] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-28 11:15:29] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 10 (OVERLAPS) 241/492 variables, 251/389 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:15:32] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2024-05-28 11:15:32] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 11:15:32] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-28 11:15:32] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:15:32] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-28 11:15:33] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-28 11:15:33] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 7/396 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:15:34] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-28 11:15:34] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-28 11:15:34] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:15:34] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-28 11:15:34] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-28 11:15:35] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 6/402 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:15:37] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-28 11:15:37] [INFO ] Deduced a trap composed of 9 places in 15 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 2/404 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:15:38] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-05-28 11:15:38] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/492 variables, 2/406 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:15:40] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:15:41] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/492 variables, 2/408 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:15:43] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:15:43] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/492 variables, 2/410 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:15:44] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:15:45] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:15:45] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-05-28 11:15:45] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/492 variables, 4/414 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:15:46] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-28 11:15:46] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2024-05-28 11:15:46] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 11:15:46] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:15:46] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-28 11:15:47] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 492/492 variables, and 420 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 79/79 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 74/160 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 2/251 variables, 4/164 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 5/169 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 241/492 variables, 251/420 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 238/658 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:15:52] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:15:53] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:15:53] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 3/661 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:16:05] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 662 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 83/83 constraints]
After SMT, in 60062ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 60064ms
Starting structural reductions in SI_LTL mode, iteration 1 : 251/535 places, 241/525 transitions.
Applied a total of 0 rules in 3 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60686 ms. Remains : 251/535 places, 241/525 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-13
Product exploration explored 100000 steps with 203 reset in 321 ms.
Product exploration explored 100000 steps with 195 reset in 365 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 103 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 26782 steps (48 resets) in 160 ms. (166 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 201 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 241/241 transitions.
Applied a total of 0 rules in 3 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2024-05-28 11:16:19] [INFO ] Invariant cache hit.
[2024-05-28 11:16:19] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-28 11:16:19] [INFO ] Invariant cache hit.
[2024-05-28 11:16:19] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2024-05-28 11:16:19] [INFO ] Redundant transitions in 25 ms returned []
Running 238 sub problems to find dead transitions.
[2024-05-28 11:16:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:16:20] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-28 11:16:20] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-28 11:16:20] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-28 11:16:20] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2024-05-28 11:16:20] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-28 11:16:20] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-28 11:16:20] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 11:16:21] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 11:16:21] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 11:16:21] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:16:21] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-28 11:16:21] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2024-05-28 11:16:21] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-28 11:16:21] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-28 11:16:21] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-28 11:16:21] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-28 11:16:21] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-28 11:16:21] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-28 11:16:21] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-28 11:16:22] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:16:22] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-28 11:16:22] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 0 ms to minimize.
[2024-05-28 11:16:22] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-05-28 11:16:22] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-28 11:16:23] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 1 ms to minimize.
[2024-05-28 11:16:23] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 11:16:23] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:16:23] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:16:23] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:16:23] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-05-28 11:16:23] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 11/117 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:16:23] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:16:23] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-28 11:16:23] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 0 ms to minimize.
[2024-05-28 11:16:24] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-28 11:16:24] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 5/122 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (OVERLAPS) 2/251 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:16:27] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:16:27] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:16:27] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-28 11:16:27] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-28 11:16:28] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:16:28] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (OVERLAPS) 241/492 variables, 251/383 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:16:30] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-28 11:16:30] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 11:16:30] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-28 11:16:30] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-28 11:16:30] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-28 11:16:30] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2024-05-28 11:16:31] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-28 11:16:31] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:16:31] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:16:31] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-28 11:16:31] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-28 11:16:31] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 11:16:31] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-28 11:16:32] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 11:16:32] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 15/398 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:16:34] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:16:34] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:16:34] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-28 11:16:34] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:16:34] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:16:35] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 6/404 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:16:36] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-28 11:16:36] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:16:36] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 3/407 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:16:38] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2024-05-28 11:16:39] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 2/409 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:16:41] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:16:43] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-28 11:16:43] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-28 11:16:43] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/492 variables, 3/413 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:16:44] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:16:45] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/492 variables, 2/415 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:16:48] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 11:16:48] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2024-05-28 11:16:48] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/492 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 492/492 variables, and 418 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 77/77 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 70/156 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 2/251 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 7/167 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 241/492 variables, 251/418 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 238/656 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:16:53] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-28 11:16:53] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:16:53] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
[2024-05-28 11:16:54] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-28 11:16:54] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:16:55] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 6/662 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 662 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 83/83 constraints]
After SMT, in 60060ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60421 ms. Remains : 251/251 places, 241/241 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 80 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 13569 steps (24 resets) in 69 ms. (193 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 184 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 196 reset in 315 ms.
Product exploration explored 100000 steps with 200 reset in 357 ms.
Built C files in :
/tmp/ltsmin233876083193310384
[2024-05-28 11:17:20] [INFO ] Computing symmetric may disable matrix : 241 transitions.
[2024-05-28 11:17:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 11:17:20] [INFO ] Computing symmetric may enable matrix : 241 transitions.
[2024-05-28 11:17:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 11:17:20] [INFO ] Computing Do-Not-Accords matrix : 241 transitions.
[2024-05-28 11:17:20] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 11:17:20] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin233876083193310384
Running compilation step : cd /tmp/ltsmin233876083193310384;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 550 ms.
Running link step : cd /tmp/ltsmin233876083193310384;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin233876083193310384;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6378661497755114654.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 241/241 transitions.
Applied a total of 0 rules in 10 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2024-05-28 11:17:36] [INFO ] Invariant cache hit.
[2024-05-28 11:17:36] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-28 11:17:36] [INFO ] Invariant cache hit.
[2024-05-28 11:17:36] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2024-05-28 11:17:36] [INFO ] Redundant transitions in 31 ms returned []
Running 238 sub problems to find dead transitions.
[2024-05-28 11:17:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:17:37] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-28 11:17:37] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-28 11:17:37] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:17:37] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:17:37] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:17:37] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-28 11:17:37] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-28 11:17:37] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-05-28 11:17:37] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-28 11:17:37] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:17:37] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:17:38] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-28 11:17:38] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-28 11:17:38] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-28 11:17:38] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
[2024-05-28 11:17:38] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-28 11:17:38] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-28 11:17:38] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-28 11:17:38] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-28 11:17:38] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:17:39] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-05-28 11:17:39] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-28 11:17:39] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:17:39] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 11:17:39] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:17:39] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 11:17:39] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 11:17:40] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
[2024-05-28 11:17:40] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:17:40] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 11:17:40] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 11/117 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:17:40] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 11:17:40] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 11:17:40] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-28 11:17:40] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:17:40] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 5/122 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (OVERLAPS) 2/251 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:17:43] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:17:43] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-28 11:17:44] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-28 11:17:44] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-28 11:17:45] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:17:45] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (OVERLAPS) 241/492 variables, 251/383 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:17:47] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:17:47] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 11:17:47] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-28 11:17:47] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-28 11:17:47] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-28 11:17:47] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:17:47] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-28 11:17:47] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:17:47] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 11:17:48] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-28 11:17:48] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:17:48] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-28 11:17:48] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:17:48] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-28 11:17:49] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 15/398 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:17:51] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 11:17:51] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-28 11:17:51] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:17:51] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:17:51] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:17:52] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 6/404 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:17:53] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-28 11:17:53] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-28 11:17:53] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 3/407 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:17:55] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-28 11:17:55] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 2/409 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:17:58] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:17:59] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-28 11:17:59] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2024-05-28 11:17:59] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/492 variables, 3/413 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:18:01] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-28 11:18:01] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/492 variables, 2/415 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:18:04] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:18:04] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-28 11:18:04] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/492 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 492/492 variables, and 418 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 77/77 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 70/156 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 2/251 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 7/167 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 241/492 variables, 251/418 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 238/656 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 11:18:10] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-28 11:18:10] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-28 11:18:10] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 11:18:11] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:18:11] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-28 11:18:12] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 6/662 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 662 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 83/83 constraints]
After SMT, in 60078ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 60080ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60476 ms. Remains : 251/251 places, 241/241 transitions.
Built C files in :
/tmp/ltsmin16494804760906579572
[2024-05-28 11:18:36] [INFO ] Computing symmetric may disable matrix : 241 transitions.
[2024-05-28 11:18:36] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 11:18:36] [INFO ] Computing symmetric may enable matrix : 241 transitions.
[2024-05-28 11:18:36] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 11:18:36] [INFO ] Computing Do-Not-Accords matrix : 241 transitions.
[2024-05-28 11:18:36] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 11:18:36] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16494804760906579572
Running compilation step : cd /tmp/ltsmin16494804760906579572;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 545 ms.
Running link step : cd /tmp/ltsmin16494804760906579572;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin16494804760906579572;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14534662548849203390.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 11:18:51] [INFO ] Flatten gal took : 9 ms
[2024-05-28 11:18:51] [INFO ] Flatten gal took : 7 ms
[2024-05-28 11:18:51] [INFO ] Time to serialize gal into /tmp/LTL6141547258489651885.gal : 2 ms
[2024-05-28 11:18:51] [INFO ] Time to serialize properties into /tmp/LTL17625159279628254912.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6141547258489651885.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6735848019930238888.hoa' '-atoms' '/tmp/LTL17625159279628254912.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17625159279628254912.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6735848019930238888.hoa
Detected timeout of ITS tools.
[2024-05-28 11:19:06] [INFO ] Flatten gal took : 7 ms
[2024-05-28 11:19:06] [INFO ] Flatten gal took : 8 ms
[2024-05-28 11:19:06] [INFO ] Time to serialize gal into /tmp/LTL5452510601843665437.gal : 4 ms
[2024-05-28 11:19:06] [INFO ] Time to serialize properties into /tmp/LTL8507350895311965714.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5452510601843665437.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8507350895311965714.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G(("((p437!=1)||(p462!=1))")||(F("(((p505!=1)||(p516!=1))||(p540!=1))"))))))
Formula 0 simplified : G(F!"((p437!=1)||(p462!=1))" & FG!"(((p505!=1)||(p516!=1))||(p540!=1))")
Detected timeout of ITS tools.
[2024-05-28 11:19:21] [INFO ] Flatten gal took : 9 ms
[2024-05-28 11:19:21] [INFO ] Applying decomposition
[2024-05-28 11:19:21] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15368568848552922988.txt' '-o' '/tmp/graph15368568848552922988.bin' '-w' '/tmp/graph15368568848552922988.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15368568848552922988.bin' '-l' '-1' '-v' '-w' '/tmp/graph15368568848552922988.weights' '-q' '0' '-e' '0.001'
[2024-05-28 11:19:21] [INFO ] Decomposing Gal with order
[2024-05-28 11:19:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 11:19:21] [INFO ] Removed a total of 157 redundant transitions.
[2024-05-28 11:19:21] [INFO ] Flatten gal took : 39 ms
[2024-05-28 11:19:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 148 labels/synchronizations in 16 ms.
[2024-05-28 11:19:21] [INFO ] Time to serialize gal into /tmp/LTL9736517389371491045.gal : 2 ms
[2024-05-28 11:19:21] [INFO ] Time to serialize properties into /tmp/LTL12238036767489496127.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9736517389371491045.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12238036767489496127.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i7.i0.u65.p437!=1)||(i7.i0.u70.p462!=1))")||(F("(((i8.i2.u76.p505!=1)||(i8.i2.u79.p516!=1))||(i8.i1.u82.p540!=1))"))))))
Formula 0 simplified : G(F!"((i7.i0.u65.p437!=1)||(i7.i0.u70.p462!=1))" & FG!"(((i8.i2.u76.p505!=1)||(i8.i2.u79.p516!=1))||(i8.i1.u82.p540!=1))")
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-010B-LTLFireability-13 finished in 259707 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F((p1||(p2 U (p3||G(p2)))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0&&X(!p1)&&F(!p2))||(p0&&X(G(!p1)))))))'
Found a Shortening insensitive property : ShieldIIPs-PT-010B-LTLFireability-11
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Support contains 7 out of 535 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 535/535 places, 525/525 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 534 transition count 475
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 485 transition count 475
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 98 place count 485 transition count 424
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 200 place count 434 transition count 424
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 203 place count 431 transition count 421
Iterating global reduction 2 with 3 rules applied. Total rules applied 206 place count 431 transition count 421
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 206 place count 431 transition count 420
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 208 place count 430 transition count 420
Performed 172 Post agglomeration using F-continuation condition.Transition count delta: 172
Deduced a syphon composed of 172 places in 0 ms
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 2 with 344 rules applied. Total rules applied 552 place count 258 transition count 248
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 554 place count 256 transition count 246
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 555 place count 255 transition count 246
Applied a total of 555 rules in 31 ms. Remains 255 /535 variables (removed 280) and now considering 246/525 (removed 279) transitions.
// Phase 1: matrix 246 rows 255 cols
[2024-05-28 11:19:37] [INFO ] Computed 90 invariants in 1 ms
[2024-05-28 11:19:37] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-28 11:19:37] [INFO ] Invariant cache hit.
[2024-05-28 11:19:37] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-28 11:19:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:19:39] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-28 11:19:39] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-28 11:19:39] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 0 ms to minimize.
[2024-05-28 11:19:39] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:19:39] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:19:39] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2024-05-28 11:19:39] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 11:19:39] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:19:39] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 11:19:39] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2024-05-28 11:19:39] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-28 11:19:39] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:19:39] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-28 11:19:39] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 11:19:39] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2024-05-28 11:19:40] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2024-05-28 11:19:40] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-28 11:19:40] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
[2024-05-28 11:19:40] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:19:40] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:19:40] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:19:40] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:19:41] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:19:41] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:19:41] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:19:41] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-05-28 11:19:42] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 7/111 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:19:42] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:19:42] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:19:44] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 3/255 variables, 6/120 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:19:47] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-28 11:19:47] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:19:47] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:19:47] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-28 11:19:47] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-28 11:19:48] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-28 11:19:48] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:19:48] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 8/128 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:19:48] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 11:19:49] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-28 11:19:49] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (OVERLAPS) 246/501 variables, 255/386 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:19:52] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-28 11:19:52] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-28 11:19:52] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-28 11:19:52] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:19:53] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 11:19:53] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:19:53] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:19:53] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/501 variables, 8/394 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:19:54] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:19:54] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-28 11:19:54] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/501 variables, 3/397 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/501 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:19:58] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:19:58] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 11:19:58] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-28 11:19:58] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:19:58] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-28 11:19:59] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-28 11:19:59] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:19:59] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:20:00] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:20:00] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/501 variables, 10/407 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:20:00] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-28 11:20:00] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:20:00] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-28 11:20:00] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-28 11:20:00] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 11:20:01] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:20:01] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:20:01] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/501 variables, 8/415 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:20:04] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-28 11:20:04] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-28 11:20:04] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/501 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:20:05] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:20:06] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-28 11:20:06] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/501 variables, 3/421 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 501/501 variables, and 421 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 62/146 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 3/255 variables, 6/152 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 14/166 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:20:09] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 246/501 variables, 255/422 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 242/664 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:20:16] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 11 (OVERLAPS) 0/501 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 501/501 variables, and 665 constraints, problems are : Problem set: 0 solved, 242 unsolved in 24098 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 78/78 constraints]
After SMT, in 54158ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 54160ms
Starting structural reductions in LI_LTL mode, iteration 1 : 255/535 places, 246/525 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 54684 ms. Remains : 255/535 places, 246/525 transitions.
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-11
Product exploration explored 100000 steps with 33265 reset in 222 ms.
Product exploration explored 100000 steps with 33336 reset in 263 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 96 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
RANDOM walk for 22117 steps (38 resets) in 168 ms. (130 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p0 (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p0) (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F p2), (F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 20 factoid took 401 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Support contains 7 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 246/246 transitions.
Applied a total of 0 rules in 1 ms. Remains 255 /255 variables (removed 0) and now considering 246/246 (removed 0) transitions.
[2024-05-28 11:20:33] [INFO ] Invariant cache hit.
[2024-05-28 11:20:33] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-28 11:20:33] [INFO ] Invariant cache hit.
[2024-05-28 11:20:34] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-28 11:20:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:20:35] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-28 11:20:35] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-28 11:20:35] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-28 11:20:35] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-28 11:20:35] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:20:35] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-28 11:20:35] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 11:20:35] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:20:35] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:20:35] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-28 11:20:35] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-28 11:20:35] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:20:35] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:20:36] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 5 ms to minimize.
[2024-05-28 11:20:36] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2024-05-28 11:20:36] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-28 11:20:36] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-28 11:20:36] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
[2024-05-28 11:20:36] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 1 ms to minimize.
[2024-05-28 11:20:36] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:20:37] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:20:37] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-28 11:20:37] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-28 11:20:37] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-28 11:20:38] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 11:20:38] [INFO ] Deduced a trap composed of 10 places in 15 ms of which 1 ms to minimize.
[2024-05-28 11:20:38] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 7/111 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:20:38] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:20:38] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:20:40] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 3/255 variables, 6/120 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:20:43] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:20:43] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:20:43] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-28 11:20:43] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-28 11:20:43] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-05-28 11:20:44] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:20:44] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:20:44] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 8/128 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:20:45] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-28 11:20:45] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2024-05-28 11:20:45] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (OVERLAPS) 246/501 variables, 255/386 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:20:49] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-28 11:20:49] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:20:49] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:20:49] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-28 11:20:49] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 11:20:50] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
[2024-05-28 11:20:50] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 11:20:50] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/501 variables, 8/394 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:20:50] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-28 11:20:51] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 11:20:51] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/501 variables, 3/397 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/501 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:20:54] [INFO ] Deduced a trap composed of 10 places in 14 ms of which 0 ms to minimize.
[2024-05-28 11:20:54] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:20:55] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2024-05-28 11:20:55] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:20:55] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-05-28 11:20:55] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-05-28 11:20:55] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:20:55] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:20:56] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:20:56] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/501 variables, 10/407 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:20:56] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 1 ms to minimize.
[2024-05-28 11:20:57] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-28 11:20:57] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-28 11:20:57] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-28 11:20:57] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:20:57] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:20:57] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-28 11:20:57] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/501 variables, 8/415 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:21:00] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 3 ms to minimize.
[2024-05-28 11:21:00] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:21:00] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/501 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:21:02] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-28 11:21:02] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 11:21:03] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/501 variables, 3/421 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 501/501 variables, and 421 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 62/146 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 3/255 variables, 6/152 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 14/166 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:21:05] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 246/501 variables, 255/422 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 242/664 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:21:12] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 11 (OVERLAPS) 0/501 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 501/501 variables, and 665 constraints, problems are : Problem set: 0 solved, 242 unsolved in 23526 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 78/78 constraints]
After SMT, in 53565ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 53567ms
Finished structural reductions in LTL mode , in 1 iterations and 53887 ms. Remains : 255/255 places, 246/246 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p0))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 111 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
RANDOM walk for 17293 steps (29 resets) in 111 ms. (154 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p0))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p0 (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p0) (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F p2), (F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 20 factoid took 352 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Product exploration explored 100000 steps with 33306 reset in 232 ms.
Product exploration explored 100000 steps with 33319 reset in 256 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Support contains 7 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 246/246 transitions.
Applied a total of 0 rules in 4 ms. Remains 255 /255 variables (removed 0) and now considering 246/246 (removed 0) transitions.
[2024-05-28 11:21:29] [INFO ] Redundant transitions in 58 ms returned [245]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 241 sub problems to find dead transitions.
// Phase 1: matrix 245 rows 255 cols
[2024-05-28 11:21:29] [INFO ] Computed 90 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 11:21:30] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-28 11:21:31] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-28 11:21:31] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-28 11:21:31] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-28 11:21:31] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2024-05-28 11:21:31] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:21:31] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-28 11:21:31] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 11:21:31] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 11:21:31] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-28 11:21:31] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-28 11:21:31] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:21:31] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-28 11:21:31] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-28 11:21:32] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-28 11:21:32] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:21:32] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:21:32] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:21:32] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:21:32] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 11:21:32] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 11:21:33] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-28 11:21:33] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:21:33] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-28 11:21:34] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:21:34] [INFO ] Deduced a trap composed of 10 places in 15 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 6/110 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (OVERLAPS) 3/255 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 11:21:36] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:21:36] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 11:21:36] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2024-05-28 11:21:36] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-28 11:21:36] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 0 ms to minimize.
[2024-05-28 11:21:36] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-28 11:21:37] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:21:37] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-28 11:21:37] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 9/125 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 245/500 variables, 255/380 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 11:21:40] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-28 11:21:41] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 11:21:41] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:21:41] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:21:41] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 11:21:41] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-28 11:21:41] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-28 11:21:42] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 11:21:42] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:21:43] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-28 11:21:43] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 9/391 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 11:21:45] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:21:45] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:21:46] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/500 variables, 3/394 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 11:21:48] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/500 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 11:21:48] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:21:48] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-28 11:21:49] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-28 11:21:49] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-28 11:21:50] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/500 variables, 5/400 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 11:21:52] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/500 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 11:21:53] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:21:54] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/500 variables, 2/403 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 11:21:55] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-28 11:21:55] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 1 ms to minimize.
[2024-05-28 11:21:55] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-28 11:21:56] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-28 11:21:56] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-05-28 11:21:56] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/500 variables, 6/409 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 11:21:59] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:21:59] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 500/500 variables, and 411 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 55/139 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (OVERLAPS) 3/255 variables, 6/145 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 11/156 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 11:22:01] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 11:22:02] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 245/500 variables, 255/413 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 241/654 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 11:22:06] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/500 variables, 1/655 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 11:22:20] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:22:20] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:22:20] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 500/500 variables, and 658 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 72/72 constraints]
After SMT, in 60065ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Starting structural reductions in SI_LTL mode, iteration 1 : 255/255 places, 245/246 transitions.
Applied a total of 0 rules in 3 ms. Remains 255 /255 variables (removed 0) and now considering 245/245 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60139 ms. Remains : 255/255 places, 245/246 transitions.
Built C files in :
/tmp/ltsmin3560108069636549261
[2024-05-28 11:22:29] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3560108069636549261
Running compilation step : cd /tmp/ltsmin3560108069636549261;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 470 ms.
Running link step : cd /tmp/ltsmin3560108069636549261;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin3560108069636549261;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14687822662518338824.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 246/246 transitions.
Applied a total of 0 rules in 4 ms. Remains 255 /255 variables (removed 0) and now considering 246/246 (removed 0) transitions.
// Phase 1: matrix 246 rows 255 cols
[2024-05-28 11:22:45] [INFO ] Computed 90 invariants in 1 ms
[2024-05-28 11:22:45] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-28 11:22:45] [INFO ] Invariant cache hit.
[2024-05-28 11:22:45] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-28 11:22:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:22:46] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:22:46] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-28 11:22:46] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-28 11:22:46] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:22:46] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-28 11:22:46] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-05-28 11:22:46] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 11:22:46] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-28 11:22:46] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-28 11:22:47] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2024-05-28 11:22:47] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2024-05-28 11:22:47] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-28 11:22:47] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 11:22:47] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-28 11:22:47] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-28 11:22:47] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-28 11:22:47] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:22:47] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-05-28 11:22:48] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-28 11:22:48] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:22:48] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:22:48] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2024-05-28 11:22:48] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:22:48] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:22:49] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-05-28 11:22:49] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:22:49] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 7/111 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:22:49] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:22:49] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:22:51] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 3/255 variables, 6/120 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:22:54] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-28 11:22:54] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-28 11:22:54] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-28 11:22:55] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-28 11:22:55] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-28 11:22:55] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:22:55] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:22:55] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 8/128 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:22:56] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:22:56] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-28 11:22:56] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (OVERLAPS) 246/501 variables, 255/386 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:23:00] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:23:00] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-28 11:23:00] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 11:23:00] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:23:01] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-05-28 11:23:01] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-28 11:23:01] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:23:01] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/501 variables, 8/394 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:23:02] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-28 11:23:02] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:23:02] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/501 variables, 3/397 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/501 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:23:06] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 11:23:06] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:23:06] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-28 11:23:06] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-28 11:23:06] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:23:06] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-28 11:23:06] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 11:23:06] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-28 11:23:07] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-28 11:23:07] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/501 variables, 10/407 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:23:08] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:23:08] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:23:08] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:23:08] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-28 11:23:08] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-28 11:23:08] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-28 11:23:08] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:23:08] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/501 variables, 8/415 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:23:11] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:23:12] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 5 ms to minimize.
[2024-05-28 11:23:12] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/501 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:23:13] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:23:14] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:23:14] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/501 variables, 3/421 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 501/501 variables, and 421 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 62/146 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 3/255 variables, 6/152 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 14/166 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:23:16] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 246/501 variables, 255/422 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 242/664 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 11:23:23] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 11 (OVERLAPS) 0/501 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 501/501 variables, and 665 constraints, problems are : Problem set: 0 solved, 242 unsolved in 24345 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 78/78 constraints]
After SMT, in 54386ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 54388ms
Finished structural reductions in LTL mode , in 1 iterations and 54729 ms. Remains : 255/255 places, 246/246 transitions.
Built C files in :
/tmp/ltsmin1617120766103171938
[2024-05-28 11:23:39] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1617120766103171938
Running compilation step : cd /tmp/ltsmin1617120766103171938;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 459 ms.
Running link step : cd /tmp/ltsmin1617120766103171938;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin1617120766103171938;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8041479459037425321.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 11:23:54] [INFO ] Flatten gal took : 7 ms
[2024-05-28 11:23:54] [INFO ] Flatten gal took : 7 ms
[2024-05-28 11:23:54] [INFO ] Time to serialize gal into /tmp/LTL16102803435938344168.gal : 7 ms
[2024-05-28 11:23:54] [INFO ] Time to serialize properties into /tmp/LTL13403869142728215414.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16102803435938344168.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13852311999737880900.hoa' '-atoms' '/tmp/LTL13403869142728215414.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL13403869142728215414.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13852311999737880900.hoa
Detected timeout of ITS tools.
[2024-05-28 11:24:10] [INFO ] Flatten gal took : 6 ms
[2024-05-28 11:24:10] [INFO ] Flatten gal took : 6 ms
[2024-05-28 11:24:10] [INFO ] Time to serialize gal into /tmp/LTL7711065403568327398.gal : 1 ms
[2024-05-28 11:24:10] [INFO ] Time to serialize properties into /tmp/LTL14429360234904502709.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7711065403568327398.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14429360234904502709.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((((X("((p265!=1)||(p294!=1))"))&&(F("((p39!=1)||(p90!=1))")))&&("(((p36==0)||(p55==0))||(p69==0))"))||((X(G("((p265!=1)||(p294!...206
Formula 0 simplified : FG((!"(((p36==0)||(p55==0))||(p69==0))" | X!"((p265!=1)||(p294!=1))" | G!"((p39!=1)||(p90!=1))") & (!"(((p36==0)||(p55==0))||(p69==0...190
Detected timeout of ITS tools.
[2024-05-28 11:24:25] [INFO ] Flatten gal took : 8 ms
[2024-05-28 11:24:25] [INFO ] Applying decomposition
[2024-05-28 11:24:25] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4238725432218847153.txt' '-o' '/tmp/graph4238725432218847153.bin' '-w' '/tmp/graph4238725432218847153.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4238725432218847153.bin' '-l' '-1' '-v' '-w' '/tmp/graph4238725432218847153.weights' '-q' '0' '-e' '0.001'
[2024-05-28 11:24:25] [INFO ] Decomposing Gal with order
[2024-05-28 11:24:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 11:24:25] [INFO ] Removed a total of 163 redundant transitions.
[2024-05-28 11:24:25] [INFO ] Flatten gal took : 22 ms
[2024-05-28 11:24:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 150 labels/synchronizations in 3 ms.
[2024-05-28 11:24:25] [INFO ] Time to serialize gal into /tmp/LTL1488337627423165429.gal : 2 ms
[2024-05-28 11:24:25] [INFO ] Time to serialize properties into /tmp/LTL7782116970334971305.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1488337627423165429.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7782116970334971305.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F((((X("((i4.i1.u41.p265!=1)||(i4.i2.u46.p294!=1))"))&&(F("((i0.i1.u6.p39!=1)||(i1.i0.u14.p90!=1))")))&&("(((i0.i2.u5.p36==0)||(i...321
Formula 0 simplified : FG((!"(((i0.i2.u5.p36==0)||(i0.i2.u8.p55==0))||(i0.i2.u10.p69==0))" | X!"((i4.i1.u41.p265!=1)||(i4.i2.u46.p294!=1))" | G!"((i0.i1.u6...305
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-010B-LTLFireability-11 finished in 303103 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1||F(p2))))))'
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(p1)||p0))))'
[2024-05-28 11:24:40] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11501080877500685304
[2024-05-28 11:24:40] [INFO ] Computing symmetric may disable matrix : 525 transitions.
[2024-05-28 11:24:40] [INFO ] Applying decomposition
[2024-05-28 11:24:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 11:24:40] [INFO ] Computing symmetric may enable matrix : 525 transitions.
[2024-05-28 11:24:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 11:24:40] [INFO ] Flatten gal took : 11 ms
[2024-05-28 11:24:40] [INFO ] Computing Do-Not-Accords matrix : 525 transitions.
[2024-05-28 11:24:40] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 11:24:40] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11501080877500685304
Running compilation step : cd /tmp/ltsmin11501080877500685304;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2457056613881481553.txt' '-o' '/tmp/graph2457056613881481553.bin' '-w' '/tmp/graph2457056613881481553.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2457056613881481553.bin' '-l' '-1' '-v' '-w' '/tmp/graph2457056613881481553.weights' '-q' '0' '-e' '0.001'
[2024-05-28 11:24:40] [INFO ] Decomposing Gal with order
[2024-05-28 11:24:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 11:24:40] [INFO ] Removed a total of 230 redundant transitions.
[2024-05-28 11:24:40] [INFO ] Flatten gal took : 37 ms
[2024-05-28 11:24:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-28 11:24:40] [INFO ] Time to serialize gal into /tmp/LTLFireability2779944100505911677.gal : 18 ms
[2024-05-28 11:24:40] [INFO ] Time to serialize properties into /tmp/LTLFireability16335812553305687530.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2779944100505911677.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16335812553305687530.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 5 LTL properties
Checking formula 0 : !((F("(i6.i3.u132.p391==1)")))
Formula 0 simplified : G!"(i6.i3.u132.p391==1)"
Compilation finished in 1511 ms.
Running link step : cd /tmp/ltsmin11501080877500685304;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 83 ms.
Running LTSmin : cd /tmp/ltsmin11501080877500685304;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin11501080877500685304;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11501080877500685304;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp1==true)||[](<>(((LTLAPp2==true)||((LTLAPp3==true) U ((LTLAPp4==true)||[]((LTLAPp3==true)))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin11501080877500685304;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp1==true)||[](<>(((LTLAPp2==true)||((LTLAPp3==true) U ((LTLAPp4==true)||[]((LTLAPp3==true)))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11501080877500685304;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((((LTLAPp5==true)&&X(!(LTLAPp6==true))&&<>(!(LTLAPp7==true)))||((LTLAPp5==true)&&X([](!(LTLAPp6==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin11501080877500685304;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((((LTLAPp5==true)&&X(!(LTLAPp6==true))&&<>(!(LTLAPp7==true)))||((LTLAPp5==true)&&X([](!(LTLAPp6==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11501080877500685304;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](((LTLAPp8==true)&&((LTLAPp9==true)||<>((LTLAPp10==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin11501080877500685304;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](((LTLAPp8==true)&&((LTLAPp9==true)||<>((LTLAPp10==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11501080877500685304;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((<>((LTLAPp12==true))||(LTLAPp11==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin11501080877500685304;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((<>((LTLAPp12==true))||(LTLAPp11==true))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 5760 s
Running LTSmin : cd /tmp/ltsmin11501080877500685304;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
LTSmin run took 596269 ms.
FORMULA ShieldIIPs-PT-010B-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin11501080877500685304;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp1==true)||[](<>(((LTLAPp2==true)||((LTLAPp3==true) U ((LTLAPp4==true)||[]((LTLAPp3==true)))))))))' '--buchi-type=spotba'
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="ShieldIIPs-PT-010B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldIIPs-PT-010B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r356-tall-171683760300092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-010B.tgz
mv ShieldIIPs-PT-010B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;