About the Execution of GreatSPN+red for ShieldRVs-PT-050B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 11544.563 | 3600000.00 | 10064227.00 | 3988.30 | F??TFTF?FFF?FF?F | 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.r355-tall-171683759700860.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is ShieldRVs-PT-050B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683759700860
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K 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.5K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 12 17:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 17:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 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 625K 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 ShieldRVs-PT-050B-LTLFireability-00
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-01
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-02
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-03
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-04
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-05
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-06
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-07
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-08
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-09
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-10
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-11
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-12
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-13
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-14
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717066018088
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-050B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 10:46:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 10:46:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 10:46:59] [INFO ] Load time of PNML (sax parser for PT used): 249 ms
[2024-05-30 10:46:59] [INFO ] Transformed 2003 places.
[2024-05-30 10:46:59] [INFO ] Transformed 2253 transitions.
[2024-05-30 10:46:59] [INFO ] Found NUPN structural information;
[2024-05-30 10:46:59] [INFO ] Parsed PT model containing 2003 places and 2253 transitions and 7200 arcs in 433 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldRVs-PT-050B-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 2003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2003/2003 places, 2253/2253 transitions.
Discarding 346 places :
Symmetric choice reduction at 0 with 346 rule applications. Total rules 346 place count 1657 transition count 1907
Iterating global reduction 0 with 346 rules applied. Total rules applied 692 place count 1657 transition count 1907
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 693 place count 1656 transition count 1906
Iterating global reduction 0 with 1 rules applied. Total rules applied 694 place count 1656 transition count 1906
Applied a total of 694 rules in 402 ms. Remains 1656 /2003 variables (removed 347) and now considering 1906/2253 (removed 347) transitions.
// Phase 1: matrix 1906 rows 1656 cols
[2024-05-30 10:47:00] [INFO ] Computed 201 invariants in 38 ms
[2024-05-30 10:47:01] [INFO ] Implicit Places using invariants in 905 ms returned []
[2024-05-30 10:47:01] [INFO ] Invariant cache hit.
[2024-05-30 10:47:03] [INFO ] Implicit Places using invariants and state equation in 1795 ms returned []
Implicit Place search using SMT with State Equation took 2738 ms to find 0 implicit places.
Running 1905 sub problems to find dead transitions.
[2024-05-30 10:47:03] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1655/3562 variables, and 0 constraints, problems are : Problem set: 0 solved, 1905 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1656 constraints, PredecessorRefiner: 1905/1905 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1905 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1655/3562 variables, and 0 constraints, problems are : Problem set: 0 solved, 1905 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1656 constraints, PredecessorRefiner: 0/1905 constraints, Known Traps: 0/0 constraints]
After SMT, in 61275ms problems are : Problem set: 0 solved, 1905 unsolved
Search for dead transitions found 0 dead transitions in 61308ms
Starting structural reductions in LTL mode, iteration 1 : 1656/2003 places, 1906/2253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64486 ms. Remains : 1656/2003 places, 1906/2253 transitions.
Support contains 46 out of 1656 places after structural reductions.
[2024-05-30 10:48:05] [INFO ] Flatten gal took : 287 ms
[2024-05-30 10:48:05] [INFO ] Flatten gal took : 120 ms
[2024-05-30 10:48:05] [INFO ] Input system was already deterministic with 1906 transitions.
RANDOM walk for 40000 steps (16 resets) in 2594 ms. (15 steps per ms) remains 1/27 properties
BEST_FIRST walk for 40003 steps (8 resets) in 325 ms. (122 steps per ms) remains 1/1 properties
[2024-05-30 10:48:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/67 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1589/1656 variables, 198/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1656 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1906/3562 variables, 1656/1857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3562 variables, 0/1857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3562 variables, 0/1857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3562/3562 variables, and 1857 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1576 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 1656/1656 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/67 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1589/1656 variables, 198/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:48:09] [INFO ] Deduced a trap composed of 32 places in 1035 ms of which 88 ms to minimize.
[2024-05-30 10:48:11] [INFO ] Deduced a trap composed of 36 places in 1840 ms of which 19 ms to minimize.
[2024-05-30 10:48:12] [INFO ] Deduced a trap composed of 25 places in 445 ms of which 16 ms to minimize.
[2024-05-30 10:48:12] [INFO ] Deduced a trap composed of 27 places in 325 ms of which 5 ms to minimize.
[2024-05-30 10:48:12] [INFO ] Deduced a trap composed of 59 places in 417 ms of which 7 ms to minimize.
[2024-05-30 10:48:13] [INFO ] Deduced a trap composed of 20 places in 380 ms of which 6 ms to minimize.
[2024-05-30 10:48:13] [INFO ] Deduced a trap composed of 28 places in 376 ms of which 22 ms to minimize.
SMT process timed out in 6948ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1656 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1656/1656 places, 1906/1906 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 1656 transition count 1706
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1456 transition count 1706
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 400 place count 1456 transition count 1456
Deduced a syphon composed of 250 places in 3 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 900 place count 1206 transition count 1456
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 904 place count 1202 transition count 1452
Iterating global reduction 2 with 4 rules applied. Total rules applied 908 place count 1202 transition count 1452
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 908 place count 1202 transition count 1451
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 910 place count 1201 transition count 1451
Performed 498 Post agglomeration using F-continuation condition.Transition count delta: 498
Deduced a syphon composed of 498 places in 16 ms
Reduce places removed 498 places and 0 transitions.
Iterating global reduction 2 with 996 rules applied. Total rules applied 1906 place count 703 transition count 953
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 102 times.
Drop transitions (Partial Free agglomeration) removed 102 transitions
Iterating global reduction 2 with 102 rules applied. Total rules applied 2008 place count 703 transition count 953
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2009 place count 702 transition count 952
Applied a total of 2009 rules in 670 ms. Remains 702 /1656 variables (removed 954) and now considering 952/1906 (removed 954) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 672 ms. Remains : 702/1656 places, 952/1906 transitions.
RANDOM walk for 8661 steps (11 resets) in 72 ms. (118 steps per ms) remains 0/1 properties
Computed a total of 401 stabilizing places and 401 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||F(G(p1))) U p2)))'
Support contains 6 out of 1656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1656/1656 places, 1906/1906 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1652 transition count 1902
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1652 transition count 1902
Applied a total of 8 rules in 133 ms. Remains 1652 /1656 variables (removed 4) and now considering 1902/1906 (removed 4) transitions.
// Phase 1: matrix 1902 rows 1652 cols
[2024-05-30 10:48:15] [INFO ] Computed 201 invariants in 10 ms
[2024-05-30 10:48:15] [INFO ] Implicit Places using invariants in 694 ms returned []
[2024-05-30 10:48:15] [INFO ] Invariant cache hit.
[2024-05-30 10:48:17] [INFO ] Implicit Places using invariants and state equation in 1623 ms returned []
Implicit Place search using SMT with State Equation took 2332 ms to find 0 implicit places.
Running 1901 sub problems to find dead transitions.
[2024-05-30 10:48:17] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1651/3554 variables, and 0 constraints, problems are : Problem set: 0 solved, 1901 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1652 constraints, PredecessorRefiner: 1901/1901 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1901 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1651/3554 variables, and 0 constraints, problems are : Problem set: 0 solved, 1901 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1652 constraints, PredecessorRefiner: 0/1901 constraints, Known Traps: 0/0 constraints]
After SMT, in 60842ms problems are : Problem set: 0 solved, 1901 unsolved
Search for dead transitions found 0 dead transitions in 60872ms
Starting structural reductions in LTL mode, iteration 1 : 1652/1656 places, 1902/1906 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63342 ms. Remains : 1652/1656 places, 1902/1906 transitions.
Stuttering acceptance computed with spot in 295 ms :[(NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-00
Stuttering criterion allowed to conclude after 2084 steps with 0 reset in 24 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-00 finished in 63741 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)||G(p1))))'
Support contains 4 out of 1656 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1656/1656 places, 1906/1906 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1655 transition count 1704
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1454 transition count 1704
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 402 place count 1454 transition count 1454
Deduced a syphon composed of 250 places in 2 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 902 place count 1204 transition count 1454
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 906 place count 1200 transition count 1450
Iterating global reduction 2 with 4 rules applied. Total rules applied 910 place count 1200 transition count 1450
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 910 place count 1200 transition count 1449
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 912 place count 1199 transition count 1449
Performed 495 Post agglomeration using F-continuation condition.Transition count delta: 495
Deduced a syphon composed of 495 places in 1 ms
Reduce places removed 495 places and 0 transitions.
Iterating global reduction 2 with 990 rules applied. Total rules applied 1902 place count 704 transition count 954
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1904 place count 702 transition count 952
Applied a total of 1904 rules in 508 ms. Remains 702 /1656 variables (removed 954) and now considering 952/1906 (removed 954) transitions.
// Phase 1: matrix 952 rows 702 cols
[2024-05-30 10:49:19] [INFO ] Computed 201 invariants in 3 ms
[2024-05-30 10:49:19] [INFO ] Implicit Places using invariants in 483 ms returned []
[2024-05-30 10:49:19] [INFO ] Invariant cache hit.
[2024-05-30 10:49:20] [INFO ] Implicit Places using invariants and state equation in 755 ms returned []
Implicit Place search using SMT with State Equation took 1241 ms to find 0 implicit places.
[2024-05-30 10:49:20] [INFO ] Redundant transitions in 386 ms returned [951]
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 950 sub problems to find dead transitions.
// Phase 1: matrix 951 rows 702 cols
[2024-05-30 10:49:20] [INFO ] Computed 201 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 201/201 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:49:30] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 3 ms to minimize.
[2024-05-30 10:49:31] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 2 ms to minimize.
[2024-05-30 10:49:31] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 3 ms to minimize.
[2024-05-30 10:49:31] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2024-05-30 10:49:31] [INFO ] Deduced a trap composed of 13 places in 284 ms of which 6 ms to minimize.
[2024-05-30 10:49:32] [INFO ] Deduced a trap composed of 16 places in 307 ms of which 5 ms to minimize.
[2024-05-30 10:49:32] [INFO ] Deduced a trap composed of 13 places in 259 ms of which 2 ms to minimize.
[2024-05-30 10:49:32] [INFO ] Deduced a trap composed of 7 places in 262 ms of which 6 ms to minimize.
[2024-05-30 10:49:33] [INFO ] Deduced a trap composed of 10 places in 277 ms of which 6 ms to minimize.
[2024-05-30 10:49:33] [INFO ] Deduced a trap composed of 15 places in 232 ms of which 3 ms to minimize.
[2024-05-30 10:49:33] [INFO ] Deduced a trap composed of 13 places in 225 ms of which 3 ms to minimize.
[2024-05-30 10:49:33] [INFO ] Deduced a trap composed of 16 places in 182 ms of which 3 ms to minimize.
[2024-05-30 10:49:34] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 3 ms to minimize.
[2024-05-30 10:49:34] [INFO ] Deduced a trap composed of 17 places in 249 ms of which 2 ms to minimize.
[2024-05-30 10:49:34] [INFO ] Deduced a trap composed of 18 places in 245 ms of which 6 ms to minimize.
[2024-05-30 10:49:34] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-05-30 10:49:34] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-30 10:49:35] [INFO ] Deduced a trap composed of 13 places in 246 ms of which 1 ms to minimize.
[2024-05-30 10:49:35] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2024-05-30 10:49:35] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:49:35] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 2 ms to minimize.
[2024-05-30 10:49:36] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 3 ms to minimize.
[2024-05-30 10:49:36] [INFO ] Deduced a trap composed of 12 places in 188 ms of which 3 ms to minimize.
[2024-05-30 10:49:36] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 3 ms to minimize.
[2024-05-30 10:49:36] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 3 ms to minimize.
[2024-05-30 10:49:36] [INFO ] Deduced a trap composed of 12 places in 225 ms of which 2 ms to minimize.
[2024-05-30 10:49:36] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 6 ms to minimize.
[2024-05-30 10:49:37] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 3 ms to minimize.
[2024-05-30 10:49:37] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 2 ms to minimize.
[2024-05-30 10:49:37] [INFO ] Deduced a trap composed of 6 places in 203 ms of which 3 ms to minimize.
[2024-05-30 10:49:37] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 3 ms to minimize.
[2024-05-30 10:49:38] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 3 ms to minimize.
[2024-05-30 10:49:38] [INFO ] Deduced a trap composed of 6 places in 175 ms of which 4 ms to minimize.
[2024-05-30 10:49:38] [INFO ] Deduced a trap composed of 103 places in 183 ms of which 3 ms to minimize.
[2024-05-30 10:49:38] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 3 ms to minimize.
[2024-05-30 10:49:38] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 2 ms to minimize.
[2024-05-30 10:49:38] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 2 ms to minimize.
[2024-05-30 10:49:39] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 3 ms to minimize.
[2024-05-30 10:49:39] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 2 ms to minimize.
[2024-05-30 10:49:39] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/702 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:49:40] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 3 ms to minimize.
[2024-05-30 10:49:40] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 2 ms to minimize.
[2024-05-30 10:49:40] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 2 ms to minimize.
[2024-05-30 10:49:40] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 3 ms to minimize.
[2024-05-30 10:49:41] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 3 ms to minimize.
[2024-05-30 10:49:41] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 2 ms to minimize.
[2024-05-30 10:49:41] [INFO ] Deduced a trap composed of 20 places in 206 ms of which 3 ms to minimize.
[2024-05-30 10:49:41] [INFO ] Deduced a trap composed of 6 places in 180 ms of which 3 ms to minimize.
[2024-05-30 10:49:42] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 9 ms to minimize.
[2024-05-30 10:49:42] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 3 ms to minimize.
[2024-05-30 10:49:42] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 3 ms to minimize.
[2024-05-30 10:49:42] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 2 ms to minimize.
[2024-05-30 10:49:42] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 2 ms to minimize.
[2024-05-30 10:49:43] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 3 ms to minimize.
[2024-05-30 10:49:43] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 3 ms to minimize.
[2024-05-30 10:49:43] [INFO ] Deduced a trap composed of 16 places in 182 ms of which 3 ms to minimize.
[2024-05-30 10:49:43] [INFO ] Deduced a trap composed of 93 places in 89 ms of which 2 ms to minimize.
[2024-05-30 10:49:43] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2024-05-30 10:49:43] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-30 10:49:43] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 950 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 702/1653 variables, and 261 constraints, problems are : Problem set: 0 solved, 950 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 0/702 constraints, PredecessorRefiner: 950/950 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 950 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 201/201 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 60/261 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:49:52] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 3 ms to minimize.
[2024-05-30 10:49:52] [INFO ] Deduced a trap composed of 7 places in 197 ms of which 3 ms to minimize.
[2024-05-30 10:49:53] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 3 ms to minimize.
[2024-05-30 10:49:53] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 1 ms to minimize.
[2024-05-30 10:49:53] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-30 10:49:53] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 2 ms to minimize.
[2024-05-30 10:49:53] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 3 ms to minimize.
[2024-05-30 10:49:53] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 3 ms to minimize.
[2024-05-30 10:49:54] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 3 ms to minimize.
[2024-05-30 10:49:54] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 3 ms to minimize.
[2024-05-30 10:49:54] [INFO ] Deduced a trap composed of 15 places in 188 ms of which 3 ms to minimize.
[2024-05-30 10:49:54] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 1 ms to minimize.
[2024-05-30 10:49:54] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 1 ms to minimize.
[2024-05-30 10:49:55] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 3 ms to minimize.
[2024-05-30 10:49:55] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 2 ms to minimize.
[2024-05-30 10:49:55] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 3 ms to minimize.
[2024-05-30 10:49:55] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 2 ms to minimize.
[2024-05-30 10:49:55] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 3 ms to minimize.
[2024-05-30 10:49:56] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 2 ms to minimize.
[2024-05-30 10:49:56] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/702 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:49:57] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 2 ms to minimize.
[2024-05-30 10:49:57] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 2 ms to minimize.
[2024-05-30 10:49:57] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 2 ms to minimize.
[2024-05-30 10:49:58] [INFO ] Deduced a trap composed of 25 places in 183 ms of which 3 ms to minimize.
[2024-05-30 10:49:58] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 2 ms to minimize.
[2024-05-30 10:49:58] [INFO ] Deduced a trap composed of 90 places in 181 ms of which 3 ms to minimize.
[2024-05-30 10:49:58] [INFO ] Deduced a trap composed of 86 places in 182 ms of which 2 ms to minimize.
[2024-05-30 10:49:58] [INFO ] Deduced a trap composed of 93 places in 179 ms of which 2 ms to minimize.
[2024-05-30 10:49:59] [INFO ] Deduced a trap composed of 15 places in 213 ms of which 2 ms to minimize.
[2024-05-30 10:49:59] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 3 ms to minimize.
[2024-05-30 10:49:59] [INFO ] Deduced a trap composed of 93 places in 207 ms of which 3 ms to minimize.
[2024-05-30 10:49:59] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 3 ms to minimize.
[2024-05-30 10:49:59] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 2 ms to minimize.
[2024-05-30 10:50:00] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 2 ms to minimize.
[2024-05-30 10:50:00] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 2 ms to minimize.
[2024-05-30 10:50:00] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 2 ms to minimize.
[2024-05-30 10:50:00] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 3 ms to minimize.
[2024-05-30 10:50:00] [INFO ] Deduced a trap composed of 19 places in 185 ms of which 3 ms to minimize.
[2024-05-30 10:50:01] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 3 ms to minimize.
[2024-05-30 10:50:01] [INFO ] Deduced a trap composed of 16 places in 191 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 20/301 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:50:01] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 2 ms to minimize.
[2024-05-30 10:50:01] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 2 ms to minimize.
[2024-05-30 10:50:02] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 2 ms to minimize.
[2024-05-30 10:50:02] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 3 ms to minimize.
[2024-05-30 10:50:03] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 3 ms to minimize.
[2024-05-30 10:50:03] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 3 ms to minimize.
[2024-05-30 10:50:03] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 3 ms to minimize.
[2024-05-30 10:50:03] [INFO ] Deduced a trap composed of 94 places in 208 ms of which 2 ms to minimize.
[2024-05-30 10:50:04] [INFO ] Deduced a trap composed of 95 places in 170 ms of which 2 ms to minimize.
[2024-05-30 10:50:04] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 2 ms to minimize.
[2024-05-30 10:50:04] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 2 ms to minimize.
[2024-05-30 10:50:04] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 2 ms to minimize.
[2024-05-30 10:50:04] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 2 ms to minimize.
[2024-05-30 10:50:05] [INFO ] Deduced a trap composed of 93 places in 172 ms of which 2 ms to minimize.
[2024-05-30 10:50:05] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 3 ms to minimize.
[2024-05-30 10:50:05] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 3 ms to minimize.
[2024-05-30 10:50:05] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 3 ms to minimize.
[2024-05-30 10:50:05] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 2 ms to minimize.
[2024-05-30 10:50:06] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 2 ms to minimize.
[2024-05-30 10:50:06] [INFO ] Deduced a trap composed of 92 places in 187 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/702 variables, 20/321 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:50:07] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 3 ms to minimize.
[2024-05-30 10:50:08] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 3 ms to minimize.
[2024-05-30 10:50:08] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 3 ms to minimize.
[2024-05-30 10:50:08] [INFO ] Deduced a trap composed of 89 places in 178 ms of which 3 ms to minimize.
[2024-05-30 10:50:08] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 2 ms to minimize.
[2024-05-30 10:50:08] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 2 ms to minimize.
[2024-05-30 10:50:09] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 2 ms to minimize.
[2024-05-30 10:50:09] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 2 ms to minimize.
[2024-05-30 10:50:09] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 2 ms to minimize.
[2024-05-30 10:50:09] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 3 ms to minimize.
[2024-05-30 10:50:09] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 4 ms to minimize.
[2024-05-30 10:50:09] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2024-05-30 10:50:09] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 2 ms to minimize.
[2024-05-30 10:50:10] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 2 ms to minimize.
[2024-05-30 10:50:10] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 3 ms to minimize.
[2024-05-30 10:50:10] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 2 ms to minimize.
[2024-05-30 10:50:10] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2024-05-30 10:50:10] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-30 10:50:10] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 2 ms to minimize.
[2024-05-30 10:50:10] [INFO ] Deduced a trap composed of 79 places in 77 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/702 variables, 20/341 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:50:12] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 2 ms to minimize.
[2024-05-30 10:50:12] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 3 ms to minimize.
[2024-05-30 10:50:12] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 2 ms to minimize.
[2024-05-30 10:50:13] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 3 ms to minimize.
[2024-05-30 10:50:13] [INFO ] Deduced a trap composed of 15 places in 221 ms of which 3 ms to minimize.
[2024-05-30 10:50:13] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 2 ms to minimize.
[2024-05-30 10:50:13] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 2 ms to minimize.
[2024-05-30 10:50:13] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 2 ms to minimize.
[2024-05-30 10:50:13] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 1 ms to minimize.
[2024-05-30 10:50:14] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 3 ms to minimize.
[2024-05-30 10:50:14] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 3 ms to minimize.
[2024-05-30 10:50:14] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 2 ms to minimize.
[2024-05-30 10:50:14] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 3 ms to minimize.
[2024-05-30 10:50:14] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 2 ms to minimize.
[2024-05-30 10:50:15] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 2 ms to minimize.
[2024-05-30 10:50:15] [INFO ] Deduced a trap composed of 6 places in 195 ms of which 2 ms to minimize.
[2024-05-30 10:50:15] [INFO ] Deduced a trap composed of 16 places in 202 ms of which 3 ms to minimize.
[2024-05-30 10:50:15] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 3 ms to minimize.
[2024-05-30 10:50:16] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 3 ms to minimize.
[2024-05-30 10:50:16] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 20/361 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:50:17] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-05-30 10:50:17] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 3 ms to minimize.
[2024-05-30 10:50:18] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 3 ms to minimize.
[2024-05-30 10:50:18] [INFO ] Deduced a trap composed of 16 places in 187 ms of which 3 ms to minimize.
[2024-05-30 10:50:18] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 3 ms to minimize.
[2024-05-30 10:50:18] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 2 ms to minimize.
[2024-05-30 10:50:19] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 3 ms to minimize.
[2024-05-30 10:50:19] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 2 ms to minimize.
[2024-05-30 10:50:19] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 2 ms to minimize.
[2024-05-30 10:50:19] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2024-05-30 10:50:19] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 2 ms to minimize.
[2024-05-30 10:50:19] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 2 ms to minimize.
[2024-05-30 10:50:20] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 2 ms to minimize.
[2024-05-30 10:50:20] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 1 ms to minimize.
[2024-05-30 10:50:20] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2024-05-30 10:50:20] [INFO ] Deduced a trap composed of 12 places in 200 ms of which 3 ms to minimize.
[2024-05-30 10:50:20] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 2 ms to minimize.
[2024-05-30 10:50:20] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 2 ms to minimize.
[2024-05-30 10:50:21] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 2 ms to minimize.
SMT process timed out in 60334ms, After SMT, problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 60342ms
Starting structural reductions in SI_LTL mode, iteration 1 : 702/1656 places, 951/1906 transitions.
Applied a total of 0 rules in 42 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62557 ms. Remains : 702/1656 places, 951/1906 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-01
Product exploration explored 100000 steps with 150 reset in 768 ms.
Product exploration explored 100000 steps with 150 reset in 706 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 250 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (59 resets) in 699 ms. (57 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 359 ms. (111 steps per ms) remains 1/1 properties
[2024-05-30 10:50:23] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 46/63 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 112/175 variables, 46/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 12/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/179 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 70/249 variables, 30/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 8/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/253 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/253 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/253 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/315 variables, 24/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/315 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/315 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/319 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/319 variables, 4/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/319 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 62/381 variables, 24/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/381 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/381 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 4/385 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/385 variables, 4/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/385 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 62/447 variables, 24/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/447 variables, 6/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/447 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 4/451 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/451 variables, 4/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/451 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 62/513 variables, 24/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/513 variables, 6/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/513 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 4/517 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/517 variables, 4/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/517 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 62/579 variables, 24/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/579 variables, 6/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/579 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 4/583 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/583 variables, 4/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/583 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 62/645 variables, 24/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/645 variables, 6/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/645 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 4/649 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/649 variables, 4/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/649 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 62/711 variables, 24/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/711 variables, 6/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/711 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 4/715 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/715 variables, 4/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/715 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 62/777 variables, 24/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/777 variables, 6/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/777 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 4/781 variables, 2/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/781 variables, 4/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/781 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 62/843 variables, 24/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/843 variables, 6/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/843 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 4/847 variables, 2/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/847 variables, 4/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/847 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 62/909 variables, 24/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/909 variables, 6/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/909 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 4/913 variables, 2/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/913 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/913 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 62/975 variables, 24/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/975 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/975 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 4/979 variables, 2/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/979 variables, 4/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/979 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 62/1041 variables, 24/549 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1041 variables, 6/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1041 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 4/1045 variables, 2/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1045 variables, 4/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1045 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (OVERLAPS) 62/1107 variables, 24/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1107 variables, 6/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1107 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (OVERLAPS) 4/1111 variables, 2/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1111 variables, 4/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1111 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 62/1173 variables, 24/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1173 variables, 6/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1173 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (OVERLAPS) 4/1177 variables, 2/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1177 variables, 4/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1177 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (OVERLAPS) 62/1239 variables, 24/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1239 variables, 6/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1239 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (OVERLAPS) 4/1243 variables, 2/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1243 variables, 4/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1243 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (OVERLAPS) 62/1305 variables, 24/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1305 variables, 6/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1305 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (OVERLAPS) 4/1309 variables, 2/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1309 variables, 4/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1309 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (OVERLAPS) 62/1371 variables, 24/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1371 variables, 6/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1371 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (OVERLAPS) 4/1375 variables, 2/737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1375 variables, 4/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1375 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (OVERLAPS) 62/1437 variables, 24/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1437 variables, 6/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1437 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (OVERLAPS) 4/1441 variables, 2/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/1441 variables, 4/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1441 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (OVERLAPS) 62/1503 variables, 24/801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/1503 variables, 6/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/1503 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (OVERLAPS) 4/1507 variables, 2/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/1507 variables, 4/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/1507 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (OVERLAPS) 62/1569 variables, 24/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/1569 variables, 6/843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/1569 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (OVERLAPS) 4/1573 variables, 2/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/1573 variables, 4/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/1573 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (OVERLAPS) 56/1629 variables, 23/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/1629 variables, 6/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/1629 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (OVERLAPS) 4/1633 variables, 2/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/1633 variables, 4/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/1633 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (OVERLAPS) 20/1653 variables, 14/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/1653 variables, 5/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/1653 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (OVERLAPS) 0/1653 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1653/1653 variables, and 903 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1098 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 46/63 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 112/175 variables, 46/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 12/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/179 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 70/249 variables, 30/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 8/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:50:24] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/249 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/249 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/253 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/253 variables, 4/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/253 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/315 variables, 24/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/315 variables, 6/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/315 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/319 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/319 variables, 4/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/319 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 62/381 variables, 24/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/381 variables, 6/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/381 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 4/385 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/385 variables, 4/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/385 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 62/447 variables, 24/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/447 variables, 6/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/447 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 4/451 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/451 variables, 4/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/451 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 62/513 variables, 24/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/513 variables, 6/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/513 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 4/517 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/517 variables, 4/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/517 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 62/579 variables, 24/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/579 variables, 6/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/579 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 4/583 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/583 variables, 4/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/583 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 62/645 variables, 24/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/645 variables, 6/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:50:25] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 51 (INCLUDED_ONLY) 0/645 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/645 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 4/649 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/649 variables, 4/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/649 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 62/711 variables, 24/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/711 variables, 6/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/711 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 4/715 variables, 2/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/715 variables, 4/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/715 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 62/777 variables, 24/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/777 variables, 6/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:50:25] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
At refinement iteration 64 (INCLUDED_ONLY) 0/777 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/777 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 4/781 variables, 2/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/781 variables, 4/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/781 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 62/843 variables, 24/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/843 variables, 6/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/843 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 4/847 variables, 2/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/847 variables, 4/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/847 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 62/909 variables, 24/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/909 variables, 6/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/909 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (OVERLAPS) 4/913 variables, 2/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/913 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/913 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (OVERLAPS) 62/975 variables, 24/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/975 variables, 6/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/975 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (OVERLAPS) 4/979 variables, 2/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/979 variables, 4/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/979 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (OVERLAPS) 62/1041 variables, 24/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1041 variables, 6/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1041 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (OVERLAPS) 4/1045 variables, 2/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1045 variables, 4/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1045 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (OVERLAPS) 62/1107 variables, 24/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1107 variables, 6/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1107 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (OVERLAPS) 4/1111 variables, 2/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1111 variables, 4/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1111 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (OVERLAPS) 62/1173 variables, 24/625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1173 variables, 6/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1173 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (OVERLAPS) 4/1177 variables, 2/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1177 variables, 4/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1177 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (OVERLAPS) 62/1239 variables, 24/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1239 variables, 6/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1239 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (OVERLAPS) 4/1243 variables, 2/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1243 variables, 4/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1243 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (OVERLAPS) 62/1305 variables, 24/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1305 variables, 6/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:50:25] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-30 10:50:25] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
At refinement iteration 113 (INCLUDED_ONLY) 0/1305 variables, 2/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1305 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (OVERLAPS) 4/1309 variables, 2/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1309 variables, 4/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1309 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (OVERLAPS) 62/1371 variables, 24/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1371 variables, 6/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1371 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (OVERLAPS) 4/1375 variables, 2/743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1375 variables, 4/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/1375 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (OVERLAPS) 62/1437 variables, 24/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1437 variables, 6/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/1437 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (OVERLAPS) 4/1441 variables, 2/779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1441 variables, 4/783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/1441 variables, 0/783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (OVERLAPS) 62/1503 variables, 24/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/1503 variables, 6/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/1503 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (OVERLAPS) 4/1507 variables, 2/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/1507 variables, 4/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/1507 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (OVERLAPS) 62/1569 variables, 24/843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/1569 variables, 6/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/1569 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (OVERLAPS) 4/1573 variables, 2/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/1573 variables, 4/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/1573 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (OVERLAPS) 56/1629 variables, 23/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/1629 variables, 6/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/1629 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 145 (OVERLAPS) 4/1633 variables, 2/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/1633 variables, 4/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 147 (INCLUDED_ONLY) 0/1633 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 148 (OVERLAPS) 20/1653 variables, 14/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/1653 variables, 5/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:50:26] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
At refinement iteration 150 (INCLUDED_ONLY) 0/1653 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/1653 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 152 (OVERLAPS) 0/1653 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1653/1653 variables, and 910 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1975 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 3121ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 951/951 transitions.
Partial Free-agglomeration rule applied 101 times.
Drop transitions (Partial Free agglomeration) removed 101 transitions
Iterating global reduction 0 with 101 rules applied. Total rules applied 101 place count 702 transition count 951
Applied a total of 101 rules in 57 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 702/702 places, 951/951 transitions.
RANDOM walk for 40000 steps (68 resets) in 654 ms. (61 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 356 ms. (112 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 204883 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 1
Probabilistic random walk after 204883 steps, saw 92641 distinct states, run finished after 3004 ms. (steps per millisecond=68 ) properties seen :0
// Phase 1: matrix 951 rows 702 cols
[2024-05-30 10:50:29] [INFO ] Computed 201 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 46/63 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 112/175 variables, 46/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 12/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/179 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 70/249 variables, 30/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 8/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/253 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/253 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/253 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/315 variables, 24/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/315 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/315 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/319 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/319 variables, 4/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/319 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 62/381 variables, 24/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/381 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/381 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 4/385 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/385 variables, 4/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/385 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 62/447 variables, 24/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/447 variables, 6/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/447 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 4/451 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/451 variables, 4/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/451 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 62/513 variables, 24/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/513 variables, 6/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/513 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 4/517 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/517 variables, 4/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/517 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 62/579 variables, 24/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/579 variables, 6/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/579 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 4/583 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/583 variables, 4/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/583 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 62/645 variables, 24/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/645 variables, 6/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/645 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 4/649 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/649 variables, 4/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/649 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 62/711 variables, 24/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/711 variables, 6/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/711 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 4/715 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/715 variables, 4/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/715 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 62/777 variables, 24/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/777 variables, 6/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/777 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 4/781 variables, 2/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/781 variables, 4/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/781 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 62/843 variables, 24/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/843 variables, 6/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/843 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 4/847 variables, 2/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/847 variables, 4/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/847 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 62/909 variables, 24/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/909 variables, 6/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/909 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 4/913 variables, 2/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/913 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/913 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 62/975 variables, 24/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/975 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/975 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 4/979 variables, 2/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/979 variables, 4/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/979 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 62/1041 variables, 24/549 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1041 variables, 6/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1041 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 4/1045 variables, 2/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1045 variables, 4/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1045 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (OVERLAPS) 62/1107 variables, 24/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1107 variables, 6/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1107 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (OVERLAPS) 4/1111 variables, 2/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1111 variables, 4/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1111 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 62/1173 variables, 24/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1173 variables, 6/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1173 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (OVERLAPS) 4/1177 variables, 2/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1177 variables, 4/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1177 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (OVERLAPS) 62/1239 variables, 24/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1239 variables, 6/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1239 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (OVERLAPS) 4/1243 variables, 2/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1243 variables, 4/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1243 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (OVERLAPS) 62/1305 variables, 24/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1305 variables, 6/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1305 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (OVERLAPS) 4/1309 variables, 2/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1309 variables, 4/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1309 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (OVERLAPS) 62/1371 variables, 24/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1371 variables, 6/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1371 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (OVERLAPS) 4/1375 variables, 2/737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1375 variables, 4/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1375 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (OVERLAPS) 62/1437 variables, 24/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1437 variables, 6/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1437 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (OVERLAPS) 4/1441 variables, 2/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/1441 variables, 4/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1441 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (OVERLAPS) 62/1503 variables, 24/801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/1503 variables, 6/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/1503 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (OVERLAPS) 4/1507 variables, 2/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/1507 variables, 4/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/1507 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (OVERLAPS) 62/1569 variables, 24/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/1569 variables, 6/843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/1569 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (OVERLAPS) 4/1573 variables, 2/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/1573 variables, 4/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/1573 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (OVERLAPS) 56/1629 variables, 23/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/1629 variables, 6/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/1629 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (OVERLAPS) 4/1633 variables, 2/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/1633 variables, 4/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/1633 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (OVERLAPS) 20/1653 variables, 14/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/1653 variables, 5/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/1653 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (OVERLAPS) 0/1653 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1653/1653 variables, and 903 constraints, problems are : Problem set: 0 solved, 1 unsolved in 995 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 46/63 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 112/175 variables, 46/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 12/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/179 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 70/249 variables, 30/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 8/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:50:31] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/249 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/249 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/253 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/253 variables, 4/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/253 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/315 variables, 24/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/315 variables, 6/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/315 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/319 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/319 variables, 4/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/319 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 62/381 variables, 24/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/381 variables, 6/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/381 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 4/385 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/385 variables, 4/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/385 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 62/447 variables, 24/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/447 variables, 6/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/447 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 4/451 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/451 variables, 4/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/451 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 62/513 variables, 24/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/513 variables, 6/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/513 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 4/517 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/517 variables, 4/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/517 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 62/579 variables, 24/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/579 variables, 6/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/579 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 4/583 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/583 variables, 4/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/583 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 62/645 variables, 24/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/645 variables, 6/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:50:31] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-30 10:50:31] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-30 10:50:31] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
At refinement iteration 51 (INCLUDED_ONLY) 0/645 variables, 3/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:50:31] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 0 ms to minimize.
[2024-05-30 10:50:31] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
[2024-05-30 10:50:31] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
At refinement iteration 52 (INCLUDED_ONLY) 0/645 variables, 3/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/645 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 4/649 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/649 variables, 4/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/649 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 62/711 variables, 24/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/711 variables, 6/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/711 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 4/715 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/715 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/715 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 62/777 variables, 24/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/777 variables, 6/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:50:31] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
At refinement iteration 65 (INCLUDED_ONLY) 0/777 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/777 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 4/781 variables, 2/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/781 variables, 4/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/781 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (OVERLAPS) 62/843 variables, 24/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/843 variables, 6/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/843 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 4/847 variables, 2/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/847 variables, 4/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/847 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 62/909 variables, 24/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/909 variables, 6/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:50:32] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
At refinement iteration 78 (INCLUDED_ONLY) 0/909 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/909 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 4/913 variables, 2/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/913 variables, 4/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/913 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 62/975 variables, 24/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/975 variables, 6/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/975 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 4/979 variables, 2/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/979 variables, 4/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/979 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (OVERLAPS) 62/1041 variables, 24/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1041 variables, 6/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1041 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (OVERLAPS) 4/1045 variables, 2/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1045 variables, 4/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1045 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 62/1107 variables, 24/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1107 variables, 6/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1107 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (OVERLAPS) 4/1111 variables, 2/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1111 variables, 4/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1111 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (OVERLAPS) 62/1173 variables, 24/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1173 variables, 6/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1173 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (OVERLAPS) 4/1177 variables, 2/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1177 variables, 4/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1177 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (OVERLAPS) 62/1239 variables, 24/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1239 variables, 6/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:50:32] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2024-05-30 10:50:32] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 2 ms to minimize.
At refinement iteration 109 (INCLUDED_ONLY) 0/1239 variables, 2/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1239 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (OVERLAPS) 4/1243 variables, 2/677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1243 variables, 4/681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1243 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (OVERLAPS) 62/1305 variables, 24/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1305 variables, 6/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1305 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (OVERLAPS) 4/1309 variables, 2/713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1309 variables, 4/717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1309 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (OVERLAPS) 62/1371 variables, 24/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1371 variables, 6/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1371 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (OVERLAPS) 4/1375 variables, 2/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1375 variables, 4/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1375 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (OVERLAPS) 62/1437 variables, 24/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/1437 variables, 6/783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1437 variables, 0/783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (OVERLAPS) 4/1441 variables, 2/785 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/1441 variables, 4/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/1441 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (OVERLAPS) 62/1503 variables, 24/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/1503 variables, 6/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/1503 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (OVERLAPS) 4/1507 variables, 2/821 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/1507 variables, 4/825 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/1507 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (OVERLAPS) 62/1569 variables, 24/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/1569 variables, 6/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/1569 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 141 (OVERLAPS) 4/1573 variables, 2/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/1573 variables, 4/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/1573 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (OVERLAPS) 56/1629 variables, 23/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/1629 variables, 6/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/1629 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 147 (OVERLAPS) 4/1633 variables, 2/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/1633 variables, 4/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/1633 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 150 (OVERLAPS) 20/1653 variables, 14/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/1653 variables, 5/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:50:33] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 1 ms to minimize.
At refinement iteration 152 (INCLUDED_ONLY) 0/1653 variables, 1/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/1653 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 154 (OVERLAPS) 0/1653 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1653/1653 variables, and 916 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2231 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
After SMT, in 3256ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 23 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 702/702 places, 951/951 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 20 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2024-05-30 10:50:33] [INFO ] Invariant cache hit.
[2024-05-30 10:50:33] [INFO ] Implicit Places using invariants in 410 ms returned []
[2024-05-30 10:50:33] [INFO ] Invariant cache hit.
[2024-05-30 10:50:34] [INFO ] Implicit Places using invariants and state equation in 719 ms returned []
Implicit Place search using SMT with State Equation took 1149 ms to find 0 implicit places.
[2024-05-30 10:50:34] [INFO ] Redundant transitions in 120 ms returned []
Running 950 sub problems to find dead transitions.
[2024-05-30 10:50:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 201/201 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:50:44] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-30 10:50:44] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-30 10:50:44] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 2 ms to minimize.
[2024-05-30 10:50:45] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 2 ms to minimize.
[2024-05-30 10:50:45] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 2 ms to minimize.
[2024-05-30 10:50:45] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-30 10:50:45] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 2 ms to minimize.
[2024-05-30 10:50:45] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 2 ms to minimize.
[2024-05-30 10:50:45] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 2 ms to minimize.
[2024-05-30 10:50:45] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 2 ms to minimize.
[2024-05-30 10:50:45] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 2 ms to minimize.
[2024-05-30 10:50:46] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 2 ms to minimize.
[2024-05-30 10:50:46] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 2 ms to minimize.
[2024-05-30 10:50:46] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2024-05-30 10:50:46] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2024-05-30 10:50:46] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-30 10:50:46] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-30 10:50:46] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-30 10:50:46] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 2 ms to minimize.
[2024-05-30 10:50:46] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:50:47] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-30 10:50:47] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-30 10:50:47] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 2 ms to minimize.
[2024-05-30 10:50:47] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 2 ms to minimize.
[2024-05-30 10:50:47] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 2 ms to minimize.
[2024-05-30 10:50:47] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-30 10:50:48] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 2 ms to minimize.
[2024-05-30 10:50:48] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-30 10:50:48] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
[2024-05-30 10:50:48] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-30 10:50:48] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-30 10:50:48] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-30 10:50:48] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-30 10:50:48] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-30 10:50:48] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-30 10:50:48] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-30 10:50:48] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-30 10:50:48] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-30 10:50:48] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-30 10:50:48] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/702 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:50:49] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 2 ms to minimize.
[2024-05-30 10:50:49] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 3 ms to minimize.
[2024-05-30 10:50:49] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 2 ms to minimize.
[2024-05-30 10:50:50] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-05-30 10:50:50] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 3 ms to minimize.
[2024-05-30 10:50:50] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 3 ms to minimize.
[2024-05-30 10:50:50] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 2 ms to minimize.
[2024-05-30 10:50:50] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 2 ms to minimize.
[2024-05-30 10:50:50] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 2 ms to minimize.
[2024-05-30 10:50:50] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 2 ms to minimize.
[2024-05-30 10:50:51] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 2 ms to minimize.
[2024-05-30 10:50:51] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 2 ms to minimize.
[2024-05-30 10:50:51] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 3 ms to minimize.
[2024-05-30 10:50:51] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 3 ms to minimize.
[2024-05-30 10:50:51] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 2 ms to minimize.
[2024-05-30 10:50:51] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 3 ms to minimize.
[2024-05-30 10:50:52] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 2 ms to minimize.
[2024-05-30 10:50:52] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-30 10:50:52] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 2 ms to minimize.
[2024-05-30 10:50:52] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:51:02] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-30 10:51:02] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 2 ms to minimize.
[2024-05-30 10:51:02] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-30 10:51:02] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 0 ms to minimize.
[2024-05-30 10:51:03] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 2 ms to minimize.
[2024-05-30 10:51:03] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-30 10:51:03] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 2 ms to minimize.
[2024-05-30 10:51:03] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 2 ms to minimize.
[2024-05-30 10:51:03] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-30 10:51:03] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 3 ms to minimize.
[2024-05-30 10:51:03] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 2 ms to minimize.
[2024-05-30 10:51:04] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 3 ms to minimize.
[2024-05-30 10:51:04] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-30 10:51:04] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 4 ms to minimize.
[2024-05-30 10:51:04] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 2 ms to minimize.
[2024-05-30 10:51:04] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 2 ms to minimize.
[2024-05-30 10:51:04] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-30 10:51:04] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-05-30 10:51:04] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 3 ms to minimize.
SMT process timed out in 30367ms, After SMT, problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 30381ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31724 ms. Remains : 702/702 places, 951/951 transitions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 13 factoid took 317 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p1))]
Support contains 4 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 25 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
// Phase 1: matrix 951 rows 702 cols
[2024-05-30 10:51:05] [INFO ] Computed 201 invariants in 11 ms
[2024-05-30 10:51:05] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-05-30 10:51:05] [INFO ] Invariant cache hit.
[2024-05-30 10:51:06] [INFO ] Implicit Places using invariants and state equation in 692 ms returned []
Implicit Place search using SMT with State Equation took 956 ms to find 0 implicit places.
[2024-05-30 10:51:06] [INFO ] Redundant transitions in 174 ms returned []
Running 950 sub problems to find dead transitions.
[2024-05-30 10:51:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 201/201 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:51:16] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 3 ms to minimize.
[2024-05-30 10:51:16] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 3 ms to minimize.
[2024-05-30 10:51:17] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 3 ms to minimize.
[2024-05-30 10:51:17] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-05-30 10:51:17] [INFO ] Deduced a trap composed of 13 places in 180 ms of which 3 ms to minimize.
[2024-05-30 10:51:17] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 3 ms to minimize.
[2024-05-30 10:51:17] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 2 ms to minimize.
[2024-05-30 10:51:18] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 2 ms to minimize.
[2024-05-30 10:51:18] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 3 ms to minimize.
[2024-05-30 10:51:18] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 3 ms to minimize.
[2024-05-30 10:51:18] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 3 ms to minimize.
[2024-05-30 10:51:19] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 3 ms to minimize.
[2024-05-30 10:51:19] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 3 ms to minimize.
[2024-05-30 10:51:19] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 3 ms to minimize.
[2024-05-30 10:51:19] [INFO ] Deduced a trap composed of 18 places in 174 ms of which 3 ms to minimize.
[2024-05-30 10:51:19] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-30 10:51:19] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-30 10:51:19] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-30 10:51:20] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-30 10:51:20] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:51:20] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 2 ms to minimize.
[2024-05-30 10:51:20] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 3 ms to minimize.
[2024-05-30 10:51:21] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 3 ms to minimize.
[2024-05-30 10:51:21] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 3 ms to minimize.
[2024-05-30 10:51:21] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 3 ms to minimize.
[2024-05-30 10:51:21] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 3 ms to minimize.
[2024-05-30 10:51:21] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-30 10:51:21] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 3 ms to minimize.
[2024-05-30 10:51:22] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 4 ms to minimize.
[2024-05-30 10:51:22] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 2 ms to minimize.
[2024-05-30 10:51:22] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 3 ms to minimize.
[2024-05-30 10:51:22] [INFO ] Deduced a trap composed of 13 places in 187 ms of which 3 ms to minimize.
[2024-05-30 10:51:23] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 2 ms to minimize.
[2024-05-30 10:51:23] [INFO ] Deduced a trap composed of 103 places in 175 ms of which 2 ms to minimize.
[2024-05-30 10:51:23] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 3 ms to minimize.
[2024-05-30 10:51:23] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 2 ms to minimize.
[2024-05-30 10:51:23] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 3 ms to minimize.
[2024-05-30 10:51:24] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 2 ms to minimize.
[2024-05-30 10:51:24] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 3 ms to minimize.
[2024-05-30 10:51:24] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/702 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:51:24] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 3 ms to minimize.
[2024-05-30 10:51:25] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 2 ms to minimize.
[2024-05-30 10:51:25] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 3 ms to minimize.
[2024-05-30 10:51:25] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 3 ms to minimize.
[2024-05-30 10:51:25] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 2 ms to minimize.
[2024-05-30 10:51:26] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 2 ms to minimize.
[2024-05-30 10:51:26] [INFO ] Deduced a trap composed of 20 places in 179 ms of which 2 ms to minimize.
[2024-05-30 10:51:26] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 3 ms to minimize.
[2024-05-30 10:51:26] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 3 ms to minimize.
[2024-05-30 10:51:27] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 2 ms to minimize.
[2024-05-30 10:51:27] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 2 ms to minimize.
[2024-05-30 10:51:27] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 3 ms to minimize.
[2024-05-30 10:51:27] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 3 ms to minimize.
[2024-05-30 10:51:27] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 3 ms to minimize.
[2024-05-30 10:51:28] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 3 ms to minimize.
[2024-05-30 10:51:28] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 2 ms to minimize.
[2024-05-30 10:51:28] [INFO ] Deduced a trap composed of 93 places in 82 ms of which 1 ms to minimize.
[2024-05-30 10:51:28] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-05-30 10:51:28] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-30 10:51:28] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 950 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 702/1653 variables, and 261 constraints, problems are : Problem set: 0 solved, 950 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 0/702 constraints, PredecessorRefiner: 950/950 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 950 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 201/201 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 60/261 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:51:38] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 3 ms to minimize.
[2024-05-30 10:51:38] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 3 ms to minimize.
[2024-05-30 10:51:38] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 2 ms to minimize.
[2024-05-30 10:51:38] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2024-05-30 10:51:38] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-30 10:51:39] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 3 ms to minimize.
[2024-05-30 10:51:39] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 3 ms to minimize.
[2024-05-30 10:51:39] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 3 ms to minimize.
[2024-05-30 10:51:39] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 3 ms to minimize.
[2024-05-30 10:51:39] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 3 ms to minimize.
[2024-05-30 10:51:40] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 2 ms to minimize.
[2024-05-30 10:51:40] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 1 ms to minimize.
[2024-05-30 10:51:40] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 1 ms to minimize.
[2024-05-30 10:51:40] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 2 ms to minimize.
[2024-05-30 10:51:40] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 3 ms to minimize.
[2024-05-30 10:51:40] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 3 ms to minimize.
[2024-05-30 10:51:41] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 3 ms to minimize.
[2024-05-30 10:51:41] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 3 ms to minimize.
[2024-05-30 10:51:41] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 2 ms to minimize.
[2024-05-30 10:51:41] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/702 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:51:42] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 2 ms to minimize.
[2024-05-30 10:51:43] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 2 ms to minimize.
[2024-05-30 10:51:43] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 2 ms to minimize.
[2024-05-30 10:51:43] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 3 ms to minimize.
[2024-05-30 10:51:43] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 3 ms to minimize.
[2024-05-30 10:51:43] [INFO ] Deduced a trap composed of 90 places in 181 ms of which 3 ms to minimize.
[2024-05-30 10:51:44] [INFO ] Deduced a trap composed of 86 places in 179 ms of which 3 ms to minimize.
[2024-05-30 10:51:44] [INFO ] Deduced a trap composed of 93 places in 191 ms of which 3 ms to minimize.
[2024-05-30 10:51:44] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 3 ms to minimize.
[2024-05-30 10:51:44] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 3 ms to minimize.
[2024-05-30 10:51:45] [INFO ] Deduced a trap composed of 93 places in 187 ms of which 2 ms to minimize.
[2024-05-30 10:51:45] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 3 ms to minimize.
[2024-05-30 10:51:45] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 2 ms to minimize.
[2024-05-30 10:51:45] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 2 ms to minimize.
[2024-05-30 10:51:45] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 2 ms to minimize.
[2024-05-30 10:51:45] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 2 ms to minimize.
[2024-05-30 10:51:46] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 3 ms to minimize.
[2024-05-30 10:51:46] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 3 ms to minimize.
[2024-05-30 10:51:46] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 2 ms to minimize.
[2024-05-30 10:51:46] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 20/301 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:51:47] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 3 ms to minimize.
[2024-05-30 10:51:47] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 3 ms to minimize.
[2024-05-30 10:51:47] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 3 ms to minimize.
[2024-05-30 10:51:48] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 3 ms to minimize.
[2024-05-30 10:51:48] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 3 ms to minimize.
[2024-05-30 10:51:48] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 2 ms to minimize.
[2024-05-30 10:51:49] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 2 ms to minimize.
[2024-05-30 10:51:49] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 3 ms to minimize.
[2024-05-30 10:51:49] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 2 ms to minimize.
[2024-05-30 10:51:49] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 3 ms to minimize.
[2024-05-30 10:51:49] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 2 ms to minimize.
[2024-05-30 10:51:50] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 2 ms to minimize.
[2024-05-30 10:51:50] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 2 ms to minimize.
[2024-05-30 10:51:50] [INFO ] Deduced a trap composed of 93 places in 147 ms of which 3 ms to minimize.
[2024-05-30 10:51:50] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 2 ms to minimize.
[2024-05-30 10:51:50] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 2 ms to minimize.
[2024-05-30 10:51:50] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 2 ms to minimize.
[2024-05-30 10:51:51] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 2 ms to minimize.
[2024-05-30 10:51:51] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 2 ms to minimize.
[2024-05-30 10:51:51] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/702 variables, 20/321 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:51:51] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 3 ms to minimize.
[2024-05-30 10:51:52] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 3 ms to minimize.
[2024-05-30 10:51:52] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 2 ms to minimize.
[2024-05-30 10:51:52] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 3 ms to minimize.
[2024-05-30 10:51:52] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 3 ms to minimize.
[2024-05-30 10:51:52] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 2 ms to minimize.
[2024-05-30 10:51:53] [INFO ] Deduced a trap composed of 110 places in 174 ms of which 2 ms to minimize.
[2024-05-30 10:51:53] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 2 ms to minimize.
[2024-05-30 10:51:53] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 3 ms to minimize.
[2024-05-30 10:51:54] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 3 ms to minimize.
[2024-05-30 10:51:54] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 3 ms to minimize.
[2024-05-30 10:51:54] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 2 ms to minimize.
[2024-05-30 10:51:55] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 3 ms to minimize.
[2024-05-30 10:51:55] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-05-30 10:51:55] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 3 ms to minimize.
[2024-05-30 10:51:55] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 2 ms to minimize.
[2024-05-30 10:51:55] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 2 ms to minimize.
[2024-05-30 10:51:55] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 3 ms to minimize.
[2024-05-30 10:51:56] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 2 ms to minimize.
[2024-05-30 10:51:56] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/702 variables, 20/341 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:51:57] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 2 ms to minimize.
[2024-05-30 10:51:57] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 3 ms to minimize.
[2024-05-30 10:51:58] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 3 ms to minimize.
[2024-05-30 10:51:58] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 2 ms to minimize.
[2024-05-30 10:51:58] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 2 ms to minimize.
[2024-05-30 10:51:58] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 2 ms to minimize.
[2024-05-30 10:51:58] [INFO ] Deduced a trap composed of 12 places in 193 ms of which 3 ms to minimize.
[2024-05-30 10:51:58] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 3 ms to minimize.
[2024-05-30 10:51:59] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 3 ms to minimize.
[2024-05-30 10:51:59] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 2 ms to minimize.
[2024-05-30 10:51:59] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-30 10:51:59] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 2 ms to minimize.
[2024-05-30 10:51:59] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 2 ms to minimize.
[2024-05-30 10:51:59] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-05-30 10:52:00] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 2 ms to minimize.
[2024-05-30 10:52:00] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 2 ms to minimize.
[2024-05-30 10:52:00] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 2 ms to minimize.
[2024-05-30 10:52:00] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 3 ms to minimize.
[2024-05-30 10:52:00] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 2 ms to minimize.
[2024-05-30 10:52:00] [INFO ] Deduced a trap composed of 78 places in 139 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 20/361 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:52:01] [INFO ] Deduced a trap composed of 104 places in 72 ms of which 1 ms to minimize.
[2024-05-30 10:52:01] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2024-05-30 10:52:01] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 2 ms to minimize.
[2024-05-30 10:52:02] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 3 ms to minimize.
[2024-05-30 10:52:03] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 3 ms to minimize.
[2024-05-30 10:52:03] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 3 ms to minimize.
[2024-05-30 10:52:03] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 3 ms to minimize.
[2024-05-30 10:52:03] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 3 ms to minimize.
[2024-05-30 10:52:04] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 3 ms to minimize.
[2024-05-30 10:52:04] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 2 ms to minimize.
[2024-05-30 10:52:04] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 2 ms to minimize.
[2024-05-30 10:52:04] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 2 ms to minimize.
[2024-05-30 10:52:04] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 2 ms to minimize.
[2024-05-30 10:52:04] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 1 ms to minimize.
[2024-05-30 10:52:04] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-30 10:52:04] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2024-05-30 10:52:05] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 2 ms to minimize.
[2024-05-30 10:52:05] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 2 ms to minimize.
[2024-05-30 10:52:05] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 2 ms to minimize.
[2024-05-30 10:52:05] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 20/381 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:52:06] [INFO ] Deduced a trap composed of 18 places in 182 ms of which 3 ms to minimize.
[2024-05-30 10:52:06] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 2 ms to minimize.
[2024-05-30 10:52:06] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 702/1653 variables, and 384 constraints, problems are : Problem set: 0 solved, 950 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 0/702 constraints, PredecessorRefiner: 0/950 constraints, Known Traps: 183/183 constraints]
After SMT, in 60349ms problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 60359ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61529 ms. Remains : 702/702 places, 951/951 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 149 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (58 resets) in 267 ms. (149 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 13 factoid took 346 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 150 reset in 535 ms.
Product exploration explored 100000 steps with 149 reset in 640 ms.
Support contains 4 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 20 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2024-05-30 10:52:08] [INFO ] Invariant cache hit.
[2024-05-30 10:52:09] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-05-30 10:52:09] [INFO ] Invariant cache hit.
[2024-05-30 10:52:09] [INFO ] Implicit Places using invariants and state equation in 650 ms returned []
Implicit Place search using SMT with State Equation took 917 ms to find 0 implicit places.
[2024-05-30 10:52:10] [INFO ] Redundant transitions in 165 ms returned []
Running 950 sub problems to find dead transitions.
[2024-05-30 10:52:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 201/201 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:52:20] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 2 ms to minimize.
[2024-05-30 10:52:20] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 3 ms to minimize.
[2024-05-30 10:52:20] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 3 ms to minimize.
[2024-05-30 10:52:20] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-05-30 10:52:20] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 3 ms to minimize.
[2024-05-30 10:52:21] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 2 ms to minimize.
[2024-05-30 10:52:21] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 3 ms to minimize.
[2024-05-30 10:52:21] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 2 ms to minimize.
[2024-05-30 10:52:21] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 2 ms to minimize.
[2024-05-30 10:52:21] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 3 ms to minimize.
[2024-05-30 10:52:22] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 3 ms to minimize.
[2024-05-30 10:52:22] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 3 ms to minimize.
[2024-05-30 10:52:22] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 3 ms to minimize.
[2024-05-30 10:52:22] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 3 ms to minimize.
[2024-05-30 10:52:22] [INFO ] Deduced a trap composed of 18 places in 172 ms of which 3 ms to minimize.
[2024-05-30 10:52:22] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-30 10:52:23] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-30 10:52:23] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-30 10:52:23] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-30 10:52:23] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:52:23] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 3 ms to minimize.
[2024-05-30 10:52:24] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 3 ms to minimize.
[2024-05-30 10:52:24] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 3 ms to minimize.
[2024-05-30 10:52:24] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 3 ms to minimize.
[2024-05-30 10:52:24] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 3 ms to minimize.
[2024-05-30 10:52:24] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 3 ms to minimize.
[2024-05-30 10:52:24] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-30 10:52:25] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 2 ms to minimize.
[2024-05-30 10:52:25] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 3 ms to minimize.
[2024-05-30 10:52:25] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 2 ms to minimize.
[2024-05-30 10:52:25] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 2 ms to minimize.
[2024-05-30 10:52:26] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 2 ms to minimize.
[2024-05-30 10:52:26] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 2 ms to minimize.
[2024-05-30 10:52:26] [INFO ] Deduced a trap composed of 103 places in 172 ms of which 3 ms to minimize.
[2024-05-30 10:52:26] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 2 ms to minimize.
[2024-05-30 10:52:26] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 3 ms to minimize.
[2024-05-30 10:52:27] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 2 ms to minimize.
[2024-05-30 10:52:27] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 3 ms to minimize.
[2024-05-30 10:52:27] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 3 ms to minimize.
[2024-05-30 10:52:27] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/702 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:52:28] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 3 ms to minimize.
[2024-05-30 10:52:28] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 3 ms to minimize.
[2024-05-30 10:52:28] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 3 ms to minimize.
[2024-05-30 10:52:28] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 2 ms to minimize.
[2024-05-30 10:52:29] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 2 ms to minimize.
[2024-05-30 10:52:29] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 3 ms to minimize.
[2024-05-30 10:52:29] [INFO ] Deduced a trap composed of 20 places in 180 ms of which 3 ms to minimize.
[2024-05-30 10:52:29] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 3 ms to minimize.
[2024-05-30 10:52:29] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 3 ms to minimize.
[2024-05-30 10:52:30] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 3 ms to minimize.
[2024-05-30 10:52:30] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 3 ms to minimize.
[2024-05-30 10:52:30] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 3 ms to minimize.
[2024-05-30 10:52:30] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 3 ms to minimize.
[2024-05-30 10:52:31] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 3 ms to minimize.
[2024-05-30 10:52:31] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 3 ms to minimize.
[2024-05-30 10:52:31] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 3 ms to minimize.
[2024-05-30 10:52:31] [INFO ] Deduced a trap composed of 93 places in 79 ms of which 1 ms to minimize.
[2024-05-30 10:52:31] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:52:31] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-30 10:52:31] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 950 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 702/1653 variables, and 261 constraints, problems are : Problem set: 0 solved, 950 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 0/702 constraints, PredecessorRefiner: 950/950 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 950 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 201/201 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 60/261 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:52:41] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 3 ms to minimize.
[2024-05-30 10:52:41] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 3 ms to minimize.
[2024-05-30 10:52:42] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 3 ms to minimize.
[2024-05-30 10:52:42] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
[2024-05-30 10:52:42] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2024-05-30 10:52:42] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 3 ms to minimize.
[2024-05-30 10:52:42] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 3 ms to minimize.
[2024-05-30 10:52:42] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 3 ms to minimize.
[2024-05-30 10:52:43] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 3 ms to minimize.
[2024-05-30 10:52:43] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 3 ms to minimize.
[2024-05-30 10:52:43] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 3 ms to minimize.
[2024-05-30 10:52:43] [INFO ] Deduced a trap composed of 92 places in 82 ms of which 1 ms to minimize.
[2024-05-30 10:52:43] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 1 ms to minimize.
[2024-05-30 10:52:43] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 2 ms to minimize.
[2024-05-30 10:52:44] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 3 ms to minimize.
[2024-05-30 10:52:44] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 3 ms to minimize.
[2024-05-30 10:52:44] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 2 ms to minimize.
[2024-05-30 10:52:44] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 3 ms to minimize.
[2024-05-30 10:52:44] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 2 ms to minimize.
[2024-05-30 10:52:45] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/702 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:52:46] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 3 ms to minimize.
[2024-05-30 10:52:46] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 2 ms to minimize.
[2024-05-30 10:52:46] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 2 ms to minimize.
[2024-05-30 10:52:47] [INFO ] Deduced a trap composed of 25 places in 171 ms of which 2 ms to minimize.
[2024-05-30 10:52:47] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 2 ms to minimize.
[2024-05-30 10:52:47] [INFO ] Deduced a trap composed of 90 places in 169 ms of which 2 ms to minimize.
[2024-05-30 10:52:47] [INFO ] Deduced a trap composed of 86 places in 173 ms of which 2 ms to minimize.
[2024-05-30 10:52:47] [INFO ] Deduced a trap composed of 93 places in 180 ms of which 3 ms to minimize.
[2024-05-30 10:52:48] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 3 ms to minimize.
[2024-05-30 10:52:48] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 3 ms to minimize.
[2024-05-30 10:52:48] [INFO ] Deduced a trap composed of 93 places in 176 ms of which 3 ms to minimize.
[2024-05-30 10:52:48] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 3 ms to minimize.
[2024-05-30 10:52:48] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2024-05-30 10:52:48] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 2 ms to minimize.
[2024-05-30 10:52:49] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 2 ms to minimize.
[2024-05-30 10:52:49] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 2 ms to minimize.
[2024-05-30 10:52:49] [INFO ] Deduced a trap composed of 16 places in 188 ms of which 2 ms to minimize.
[2024-05-30 10:52:49] [INFO ] Deduced a trap composed of 19 places in 174 ms of which 3 ms to minimize.
[2024-05-30 10:52:49] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 3 ms to minimize.
[2024-05-30 10:52:50] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 20/301 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:52:50] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 3 ms to minimize.
[2024-05-30 10:52:50] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 3 ms to minimize.
[2024-05-30 10:52:50] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 3 ms to minimize.
[2024-05-30 10:52:51] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 3 ms to minimize.
[2024-05-30 10:52:51] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 3 ms to minimize.
[2024-05-30 10:52:52] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 3 ms to minimize.
[2024-05-30 10:52:52] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 3 ms to minimize.
[2024-05-30 10:52:52] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 2 ms to minimize.
[2024-05-30 10:52:52] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 2 ms to minimize.
[2024-05-30 10:52:53] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 6 ms to minimize.
[2024-05-30 10:52:53] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 2 ms to minimize.
[2024-05-30 10:52:53] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 2 ms to minimize.
[2024-05-30 10:52:53] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 2 ms to minimize.
[2024-05-30 10:52:53] [INFO ] Deduced a trap composed of 93 places in 154 ms of which 3 ms to minimize.
[2024-05-30 10:52:54] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 2 ms to minimize.
[2024-05-30 10:52:54] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 2 ms to minimize.
[2024-05-30 10:52:54] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 3 ms to minimize.
[2024-05-30 10:52:54] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 2 ms to minimize.
[2024-05-30 10:52:54] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 2 ms to minimize.
[2024-05-30 10:52:54] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/702 variables, 20/321 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:52:55] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 2 ms to minimize.
[2024-05-30 10:52:55] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 2 ms to minimize.
[2024-05-30 10:52:55] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 3 ms to minimize.
[2024-05-30 10:52:56] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 2 ms to minimize.
[2024-05-30 10:52:56] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 3 ms to minimize.
[2024-05-30 10:52:56] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 2 ms to minimize.
[2024-05-30 10:52:56] [INFO ] Deduced a trap composed of 110 places in 181 ms of which 2 ms to minimize.
[2024-05-30 10:52:57] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 3 ms to minimize.
[2024-05-30 10:52:57] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 3 ms to minimize.
[2024-05-30 10:52:57] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 3 ms to minimize.
[2024-05-30 10:52:57] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 3 ms to minimize.
[2024-05-30 10:52:58] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 2 ms to minimize.
[2024-05-30 10:52:58] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 3 ms to minimize.
[2024-05-30 10:52:58] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 1 ms to minimize.
[2024-05-30 10:52:59] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 3 ms to minimize.
[2024-05-30 10:52:59] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-05-30 10:52:59] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 3 ms to minimize.
[2024-05-30 10:52:59] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 2 ms to minimize.
[2024-05-30 10:52:59] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 2 ms to minimize.
[2024-05-30 10:52:59] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/702 variables, 20/341 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:53:00] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 3 ms to minimize.
[2024-05-30 10:53:01] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 2 ms to minimize.
[2024-05-30 10:53:01] [INFO ] Deduced a trap composed of 12 places in 207 ms of which 2 ms to minimize.
[2024-05-30 10:53:01] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 2 ms to minimize.
[2024-05-30 10:53:02] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 1 ms to minimize.
[2024-05-30 10:53:02] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 2 ms to minimize.
[2024-05-30 10:53:02] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 3 ms to minimize.
[2024-05-30 10:53:02] [INFO ] Deduced a trap composed of 6 places in 190 ms of which 3 ms to minimize.
[2024-05-30 10:53:02] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 2 ms to minimize.
[2024-05-30 10:53:03] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 2 ms to minimize.
[2024-05-30 10:53:03] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-30 10:53:03] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 2 ms to minimize.
[2024-05-30 10:53:03] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 2 ms to minimize.
[2024-05-30 10:53:03] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-05-30 10:53:03] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 2 ms to minimize.
[2024-05-30 10:53:04] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 2 ms to minimize.
[2024-05-30 10:53:04] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 2 ms to minimize.
[2024-05-30 10:53:04] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 2 ms to minimize.
[2024-05-30 10:53:04] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 2 ms to minimize.
[2024-05-30 10:53:04] [INFO ] Deduced a trap composed of 78 places in 147 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 20/361 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:53:05] [INFO ] Deduced a trap composed of 104 places in 96 ms of which 1 ms to minimize.
[2024-05-30 10:53:05] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 0 ms to minimize.
[2024-05-30 10:53:05] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 3 ms to minimize.
[2024-05-30 10:53:06] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 3 ms to minimize.
[2024-05-30 10:53:07] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 3 ms to minimize.
[2024-05-30 10:53:07] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 3 ms to minimize.
[2024-05-30 10:53:07] [INFO ] Deduced a trap composed of 10 places in 205 ms of which 3 ms to minimize.
[2024-05-30 10:53:07] [INFO ] Deduced a trap composed of 10 places in 211 ms of which 3 ms to minimize.
[2024-05-30 10:53:08] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 4 ms to minimize.
[2024-05-30 10:53:08] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 2 ms to minimize.
[2024-05-30 10:53:08] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 2 ms to minimize.
[2024-05-30 10:53:08] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 2 ms to minimize.
[2024-05-30 10:53:08] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 2 ms to minimize.
[2024-05-30 10:53:08] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 1 ms to minimize.
[2024-05-30 10:53:08] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-30 10:53:09] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 1 ms to minimize.
[2024-05-30 10:53:09] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 2 ms to minimize.
[2024-05-30 10:53:09] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 2 ms to minimize.
[2024-05-30 10:53:09] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 2 ms to minimize.
[2024-05-30 10:53:09] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 20/381 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:53:10] [INFO ] Deduced a trap composed of 18 places in 210 ms of which 2 ms to minimize.
SMT process timed out in 60484ms, After SMT, problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 60493ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61608 ms. Remains : 702/702 places, 951/951 transitions.
Treatment of property ShieldRVs-PT-050B-LTLFireability-01 finished in 232216 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((G(p0)||X((p1||X(p2))))))'
Support contains 5 out of 1656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1656/1656 places, 1906/1906 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1653 transition count 1903
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1653 transition count 1903
Applied a total of 6 rules in 130 ms. Remains 1653 /1656 variables (removed 3) and now considering 1903/1906 (removed 3) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2024-05-30 10:53:11] [INFO ] Computed 201 invariants in 8 ms
[2024-05-30 10:53:11] [INFO ] Implicit Places using invariants in 723 ms returned []
[2024-05-30 10:53:11] [INFO ] Invariant cache hit.
[2024-05-30 10:53:13] [INFO ] Implicit Places using invariants and state equation in 1532 ms returned []
Implicit Place search using SMT with State Equation took 2265 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2024-05-30 10:53:13] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1652/3556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1653 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1652/3556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1653 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints]
After SMT, in 60571ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 60588ms
Starting structural reductions in LTL mode, iteration 1 : 1653/1656 places, 1903/1906 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62999 ms. Remains : 1653/1656 places, 1903/1906 transitions.
Stuttering acceptance computed with spot in 305 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-02
Product exploration explored 100000 steps with 33319 reset in 359 ms.
Product exploration explored 100000 steps with 33281 reset in 340 ms.
Computed a total of 399 stabilizing places and 399 stable transitions
Computed a total of 399 stabilizing places and 399 stable transitions
Detected a total of 399/1653 stabilizing places and 399/1903 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 162 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
RANDOM walk for 40000 steps (16 resets) in 269 ms. (148 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
[2024-05-30 10:54:15] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 87/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1561/1653 variables, 196/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1653 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1903/3556 variables, 1653/1854 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3556 variables, 0/1854 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/3556 variables, 0/1854 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3556/3556 variables, and 1854 constraints, problems are : Problem set: 0 solved, 2 unsolved in 792 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 1653/1653 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 87/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1561/1653 variables, 196/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 10:54:17] [INFO ] Deduced a trap composed of 15 places in 310 ms of which 5 ms to minimize.
[2024-05-30 10:54:17] [INFO ] Deduced a trap composed of 35 places in 316 ms of which 5 ms to minimize.
[2024-05-30 10:54:17] [INFO ] Deduced a trap composed of 18 places in 308 ms of which 6 ms to minimize.
[2024-05-30 10:54:18] [INFO ] Deduced a trap composed of 37 places in 307 ms of which 5 ms to minimize.
[2024-05-30 10:54:18] [INFO ] Deduced a trap composed of 19 places in 303 ms of which 5 ms to minimize.
[2024-05-30 10:54:18] [INFO ] Deduced a trap composed of 19 places in 299 ms of which 5 ms to minimize.
[2024-05-30 10:54:19] [INFO ] Deduced a trap composed of 20 places in 280 ms of which 4 ms to minimize.
[2024-05-30 10:54:19] [INFO ] Deduced a trap composed of 27 places in 276 ms of which 4 ms to minimize.
[2024-05-30 10:54:19] [INFO ] Deduced a trap composed of 38 places in 259 ms of which 5 ms to minimize.
[2024-05-30 10:54:19] [INFO ] Deduced a trap composed of 55 places in 259 ms of which 5 ms to minimize.
[2024-05-30 10:54:20] [INFO ] Deduced a trap composed of 35 places in 235 ms of which 4 ms to minimize.
[2024-05-30 10:54:20] [INFO ] Deduced a trap composed of 54 places in 244 ms of which 4 ms to minimize.
[2024-05-30 10:54:20] [INFO ] Deduced a trap composed of 48 places in 221 ms of which 4 ms to minimize.
[2024-05-30 10:54:20] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 4 ms to minimize.
[2024-05-30 10:54:21] [INFO ] Deduced a trap composed of 47 places in 212 ms of which 4 ms to minimize.
[2024-05-30 10:54:21] [INFO ] Deduced a trap composed of 45 places in 224 ms of which 4 ms to minimize.
[2024-05-30 10:54:21] [INFO ] Deduced a trap composed of 63 places in 212 ms of which 3 ms to minimize.
SMT process timed out in 5960ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 1653 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1653/1653 places, 1903/1903 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 1653 transition count 1705
Reduce places removed 198 places and 0 transitions.
Iterating post reduction 1 with 198 rules applied. Total rules applied 396 place count 1455 transition count 1705
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 396 place count 1455 transition count 1454
Deduced a syphon composed of 251 places in 2 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 898 place count 1204 transition count 1454
Performed 497 Post agglomeration using F-continuation condition.Transition count delta: 497
Deduced a syphon composed of 497 places in 1 ms
Reduce places removed 497 places and 0 transitions.
Iterating global reduction 2 with 994 rules applied. Total rules applied 1892 place count 707 transition count 957
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 102 times.
Drop transitions (Partial Free agglomeration) removed 102 transitions
Iterating global reduction 2 with 102 rules applied. Total rules applied 1994 place count 707 transition count 957
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1995 place count 706 transition count 956
Applied a total of 1995 rules in 198 ms. Remains 706 /1653 variables (removed 947) and now considering 956/1903 (removed 947) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 706/1653 places, 956/1903 transitions.
RANDOM walk for 40000 steps (67 resets) in 556 ms. (71 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 1/1 properties
// Phase 1: matrix 956 rows 706 cols
[2024-05-30 10:54:22] [INFO ] Computed 201 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/21 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 44/65 variables, 21/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 118/183 variables, 40/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 9/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/189 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 6/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 130/319 variables, 52/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/319 variables, 13/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/319 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/327 variables, 4/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/327 variables, 8/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/327 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 124/451 variables, 48/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/451 variables, 12/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/451 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 8/459 variables, 4/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/459 variables, 8/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/459 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 121/580 variables, 48/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/580 variables, 12/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/580 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 8/588 variables, 4/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/588 variables, 8/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/588 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 99/687 variables, 40/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/687 variables, 10/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/687 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 8/695 variables, 4/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/695 variables, 8/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/695 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 93/788 variables, 36/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/788 variables, 9/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/788 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 6/794 variables, 3/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/794 variables, 6/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/794 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 93/887 variables, 36/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/887 variables, 9/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/887 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 6/893 variables, 3/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/893 variables, 6/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/893 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 93/986 variables, 36/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/986 variables, 9/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/986 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 6/992 variables, 3/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/992 variables, 6/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/992 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 93/1085 variables, 36/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1085 variables, 9/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1085 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 6/1091 variables, 3/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1091 variables, 6/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1091 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 93/1184 variables, 36/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1184 variables, 9/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1184 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 6/1190 variables, 3/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1190 variables, 6/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1190 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 93/1283 variables, 36/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1283 variables, 9/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1283 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (OVERLAPS) 6/1289 variables, 3/685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1289 variables, 6/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1289 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 89/1378 variables, 36/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1378 variables, 9/736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1378 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 6/1384 variables, 3/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1384 variables, 6/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1384 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 48/1432 variables, 24/769 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1432 variables, 7/776 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1432 variables, 0/776 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 2/1434 variables, 1/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1434 variables, 2/779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1434 variables, 0/779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (OVERLAPS) 31/1465 variables, 12/791 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1465 variables, 3/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1465 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (OVERLAPS) 2/1467 variables, 1/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1467 variables, 2/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1467 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (OVERLAPS) 31/1498 variables, 12/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1498 variables, 3/812 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1498 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (OVERLAPS) 2/1500 variables, 1/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1500 variables, 2/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1500 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (OVERLAPS) 31/1531 variables, 12/827 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1531 variables, 3/830 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1531 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (OVERLAPS) 2/1533 variables, 1/831 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1533 variables, 2/833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1533 variables, 0/833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (OVERLAPS) 31/1564 variables, 12/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1564 variables, 3/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1564 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (OVERLAPS) 2/1566 variables, 1/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1566 variables, 2/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1566 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (OVERLAPS) 31/1597 variables, 12/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1597 variables, 3/866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1597 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (OVERLAPS) 2/1599 variables, 1/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1599 variables, 2/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1599 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (OVERLAPS) 31/1630 variables, 12/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1630 variables, 3/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1630 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (OVERLAPS) 2/1632 variables, 1/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1632 variables, 2/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1632 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (OVERLAPS) 26/1658 variables, 11/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1658 variables, 3/901 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/1658 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (OVERLAPS) 2/1660 variables, 1/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1660 variables, 2/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/1660 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (OVERLAPS) 2/1662 variables, 2/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1662 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/1662 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (OVERLAPS) 0/1662 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1662/1662 variables, and 907 constraints, problems are : Problem set: 0 solved, 1 unsolved in 953 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 706/706 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/21 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:54:23] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-30 10:54:23] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-30 10:54:23] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 44/65 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 118/183 variables, 40/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 9/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/189 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 6/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 130/319 variables, 52/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/319 variables, 13/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:54:23] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/319 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/319 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/327 variables, 4/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/327 variables, 8/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/327 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 124/451 variables, 48/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/451 variables, 12/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/451 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 8/459 variables, 4/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/459 variables, 8/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/459 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 121/580 variables, 48/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/580 variables, 12/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/580 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 8/588 variables, 4/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/588 variables, 8/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/588 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 99/687 variables, 40/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/687 variables, 10/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/687 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 8/695 variables, 4/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/695 variables, 8/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/695 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 93/788 variables, 36/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/788 variables, 9/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/788 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 6/794 variables, 3/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/794 variables, 6/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/794 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 93/887 variables, 36/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/887 variables, 9/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/887 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 6/893 variables, 3/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/893 variables, 6/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/893 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 93/986 variables, 36/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/986 variables, 9/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/986 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 6/992 variables, 3/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/992 variables, 6/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/992 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 93/1085 variables, 36/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1085 variables, 9/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:54:23] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 1 ms to minimize.
[2024-05-30 10:54:23] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2024-05-30 10:54:24] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
At refinement iteration 60 (INCLUDED_ONLY) 0/1085 variables, 3/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1085 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 6/1091 variables, 3/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1091 variables, 6/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1091 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 93/1184 variables, 36/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1184 variables, 9/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:54:24] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 2 ms to minimize.
At refinement iteration 67 (INCLUDED_ONLY) 0/1184 variables, 1/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1184 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 6/1190 variables, 3/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1190 variables, 6/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1190 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 93/1283 variables, 36/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1283 variables, 9/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:54:24] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
At refinement iteration 74 (INCLUDED_ONLY) 0/1283 variables, 1/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1283 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 6/1289 variables, 3/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1289 variables, 6/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1289 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 89/1378 variables, 36/737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1378 variables, 9/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1378 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 6/1384 variables, 3/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1384 variables, 6/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1384 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (OVERLAPS) 48/1432 variables, 24/779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1432 variables, 7/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1432 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (OVERLAPS) 2/1434 variables, 1/787 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1434 variables, 2/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1434 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (OVERLAPS) 31/1465 variables, 12/801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1465 variables, 3/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1465 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (OVERLAPS) 2/1467 variables, 1/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1467 variables, 2/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1467 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (OVERLAPS) 31/1498 variables, 12/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1498 variables, 3/822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1498 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (OVERLAPS) 2/1500 variables, 1/823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1500 variables, 2/825 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1500 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (OVERLAPS) 31/1531 variables, 12/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1531 variables, 3/840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1531 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (OVERLAPS) 2/1533 variables, 1/841 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1533 variables, 2/843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1533 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (OVERLAPS) 31/1564 variables, 12/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1564 variables, 3/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1564 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (OVERLAPS) 2/1566 variables, 1/859 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1566 variables, 2/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1566 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (OVERLAPS) 31/1597 variables, 12/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1597 variables, 3/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1597 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (OVERLAPS) 2/1599 variables, 1/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1599 variables, 2/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1599 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (OVERLAPS) 31/1630 variables, 12/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1630 variables, 3/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/1630 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (OVERLAPS) 2/1632 variables, 1/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1632 variables, 2/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/1632 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (OVERLAPS) 26/1658 variables, 11/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1658 variables, 3/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/1658 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (OVERLAPS) 2/1660 variables, 1/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/1660 variables, 2/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/1660 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (OVERLAPS) 2/1662 variables, 2/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/1662 variables, 1/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/1662 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (OVERLAPS) 0/1662 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 917 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1834 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 706/706 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 2804ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 87 ms.
Support contains 2 out of 706 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 706/706 places, 956/956 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 706 transition count 954
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 704 transition count 954
Applied a total of 4 rules in 24 ms. Remains 704 /706 variables (removed 2) and now considering 954/956 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 704/706 places, 954/956 transitions.
RANDOM walk for 40000 steps (68 resets) in 292 ms. (136 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 170 ms. (233 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 437778 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :0 out of 1
Probabilistic random walk after 437778 steps, saw 429752 distinct states, run finished after 3004 ms. (steps per millisecond=145 ) properties seen :0
// Phase 1: matrix 954 rows 704 cols
[2024-05-30 10:54:28] [INFO ] Computed 201 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/21 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 44/65 variables, 21/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 118/183 variables, 40/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 9/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/189 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 6/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 130/319 variables, 52/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/319 variables, 13/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/319 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/327 variables, 4/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/327 variables, 8/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/327 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 124/451 variables, 48/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/451 variables, 12/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/451 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 8/459 variables, 4/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/459 variables, 8/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/459 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 121/580 variables, 48/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/580 variables, 12/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/580 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 8/588 variables, 4/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/588 variables, 8/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/588 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 97/685 variables, 40/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/685 variables, 11/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/685 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 6/691 variables, 3/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/691 variables, 6/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/691 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 93/784 variables, 36/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/784 variables, 9/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/784 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 6/790 variables, 3/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/790 variables, 6/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/790 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 93/883 variables, 36/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/883 variables, 9/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/883 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 6/889 variables, 3/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/889 variables, 6/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/889 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 93/982 variables, 36/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/982 variables, 9/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/982 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 6/988 variables, 3/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/988 variables, 6/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/988 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 93/1081 variables, 36/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1081 variables, 9/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1081 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 6/1087 variables, 3/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1087 variables, 6/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1087 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 93/1180 variables, 36/617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1180 variables, 9/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1180 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 6/1186 variables, 3/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1186 variables, 6/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1186 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 93/1279 variables, 36/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1279 variables, 9/680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1279 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (OVERLAPS) 6/1285 variables, 3/683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1285 variables, 6/689 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1285 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 89/1374 variables, 36/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1374 variables, 9/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1374 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 6/1380 variables, 3/737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1380 variables, 6/743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1380 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 48/1428 variables, 24/767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1428 variables, 7/774 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1428 variables, 0/774 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 2/1430 variables, 1/775 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1430 variables, 2/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1430 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (OVERLAPS) 31/1461 variables, 12/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1461 variables, 3/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1461 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (OVERLAPS) 2/1463 variables, 1/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1463 variables, 2/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1463 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (OVERLAPS) 31/1494 variables, 12/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1494 variables, 3/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1494 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (OVERLAPS) 2/1496 variables, 1/811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1496 variables, 2/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1496 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (OVERLAPS) 31/1527 variables, 12/825 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1527 variables, 3/828 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1527 variables, 0/828 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (OVERLAPS) 2/1529 variables, 1/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1529 variables, 2/831 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1529 variables, 0/831 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (OVERLAPS) 31/1560 variables, 12/843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1560 variables, 3/846 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1560 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (OVERLAPS) 2/1562 variables, 1/847 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1562 variables, 2/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1562 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (OVERLAPS) 31/1593 variables, 12/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1593 variables, 3/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1593 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (OVERLAPS) 2/1595 variables, 1/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1595 variables, 2/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1595 variables, 0/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (OVERLAPS) 31/1626 variables, 12/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1626 variables, 3/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1626 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (OVERLAPS) 2/1628 variables, 1/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1628 variables, 2/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1628 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (OVERLAPS) 26/1654 variables, 11/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1654 variables, 3/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/1654 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (OVERLAPS) 2/1656 variables, 1/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1656 variables, 2/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/1656 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (OVERLAPS) 2/1658 variables, 2/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1658 variables, 1/905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/1658 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (OVERLAPS) 0/1658 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1658/1658 variables, and 905 constraints, problems are : Problem set: 0 solved, 1 unsolved in 980 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 704/704 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/21 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:54:29] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-30 10:54:29] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-05-30 10:54:29] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 44/65 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 118/183 variables, 40/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 9/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/189 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 6/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 130/319 variables, 52/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/319 variables, 13/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:54:29] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/319 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/319 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/327 variables, 4/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/327 variables, 8/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/327 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 124/451 variables, 48/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/451 variables, 12/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/451 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 8/459 variables, 4/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/459 variables, 8/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/459 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 121/580 variables, 48/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/580 variables, 12/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/580 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 8/588 variables, 4/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/588 variables, 8/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/588 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 97/685 variables, 40/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/685 variables, 11/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/685 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 6/691 variables, 3/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/691 variables, 6/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/691 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 93/784 variables, 36/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/784 variables, 9/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:54:29] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/784 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/784 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 6/790 variables, 3/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/790 variables, 6/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:54:29] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 2 ms to minimize.
At refinement iteration 46 (INCLUDED_ONLY) 0/790 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/790 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 93/883 variables, 36/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/883 variables, 9/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/883 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 6/889 variables, 3/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/889 variables, 6/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/889 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 93/982 variables, 36/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/982 variables, 9/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/982 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 6/988 variables, 3/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/988 variables, 6/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/988 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 93/1081 variables, 36/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1081 variables, 9/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1081 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 6/1087 variables, 3/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1087 variables, 6/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1087 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 93/1180 variables, 36/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1180 variables, 9/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1180 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 6/1186 variables, 3/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1186 variables, 6/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1186 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 93/1279 variables, 36/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1279 variables, 9/687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1279 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 6/1285 variables, 3/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1285 variables, 6/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1285 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (OVERLAPS) 89/1374 variables, 36/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1374 variables, 9/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1374 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (OVERLAPS) 6/1380 variables, 3/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1380 variables, 6/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1380 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (OVERLAPS) 48/1428 variables, 24/774 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1428 variables, 7/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1428 variables, 0/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (OVERLAPS) 2/1430 variables, 1/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1430 variables, 2/784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1430 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (OVERLAPS) 31/1461 variables, 12/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1461 variables, 3/799 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1461 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (OVERLAPS) 2/1463 variables, 1/800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1463 variables, 2/802 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1463 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (OVERLAPS) 31/1494 variables, 12/814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1494 variables, 3/817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1494 variables, 0/817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (OVERLAPS) 2/1496 variables, 1/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1496 variables, 2/820 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1496 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (OVERLAPS) 31/1527 variables, 12/832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1527 variables, 3/835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1527 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (OVERLAPS) 2/1529 variables, 1/836 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1529 variables, 2/838 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1529 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (OVERLAPS) 31/1560 variables, 12/850 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1560 variables, 3/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1560 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (OVERLAPS) 2/1562 variables, 1/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1562 variables, 2/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1562 variables, 0/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (OVERLAPS) 31/1593 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1593 variables, 3/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1593 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (OVERLAPS) 2/1595 variables, 1/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1595 variables, 2/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1595 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (OVERLAPS) 31/1626 variables, 12/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1626 variables, 3/889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1626 variables, 0/889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (OVERLAPS) 2/1628 variables, 1/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1628 variables, 2/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1628 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (OVERLAPS) 26/1654 variables, 11/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/1654 variables, 3/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1654 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (OVERLAPS) 2/1656 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/1656 variables, 2/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/1656 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (OVERLAPS) 2/1658 variables, 2/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/1658 variables, 1/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/1658 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (OVERLAPS) 0/1658 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1658/1658 variables, and 912 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1454 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 704/704 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 2452ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 57 ms.
Support contains 2 out of 704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 954/954 transitions.
Applied a total of 0 rules in 27 ms. Remains 704 /704 variables (removed 0) and now considering 954/954 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 704/704 places, 954/954 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 954/954 transitions.
Applied a total of 0 rules in 19 ms. Remains 704 /704 variables (removed 0) and now considering 954/954 (removed 0) transitions.
[2024-05-30 10:54:30] [INFO ] Invariant cache hit.
[2024-05-30 10:54:31] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-30 10:54:31] [INFO ] Invariant cache hit.
[2024-05-30 10:54:31] [INFO ] Implicit Places using invariants and state equation in 736 ms returned []
Implicit Place search using SMT with State Equation took 1063 ms to find 0 implicit places.
[2024-05-30 10:54:31] [INFO ] Redundant transitions in 70 ms returned []
Running 952 sub problems to find dead transitions.
[2024-05-30 10:54:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/703 variables, 197/197 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 10:54:42] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-30 10:54:42] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-30 10:54:42] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 2 ms to minimize.
[2024-05-30 10:54:42] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-30 10:54:42] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-30 10:54:42] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-30 10:54:42] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-30 10:54:42] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-30 10:54:42] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-30 10:54:42] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-30 10:54:42] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-30 10:54:42] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-30 10:54:42] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-30 10:54:42] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-30 10:54:43] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2024-05-30 10:54:43] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 2 ms to minimize.
[2024-05-30 10:54:43] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 1 ms to minimize.
[2024-05-30 10:54:43] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 1 ms to minimize.
[2024-05-30 10:54:43] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-30 10:54:43] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/703 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 10:54:43] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-30 10:54:43] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-30 10:54:43] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-30 10:54:43] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-30 10:54:44] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2024-05-30 10:54:44] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-05-30 10:54:44] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
[2024-05-30 10:54:44] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2024-05-30 10:54:44] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-30 10:54:44] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 1 ms to minimize.
[2024-05-30 10:54:44] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
[2024-05-30 10:54:44] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 2 ms to minimize.
[2024-05-30 10:54:44] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2024-05-30 10:54:45] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
[2024-05-30 10:54:45] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-30 10:54:45] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-05-30 10:54:45] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-30 10:54:45] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 1 ms to minimize.
[2024-05-30 10:54:45] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 1 ms to minimize.
[2024-05-30 10:54:45] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/703 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 10:54:45] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-30 10:54:46] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-05-30 10:54:46] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-05-30 10:54:46] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 1 ms to minimize.
[2024-05-30 10:54:46] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 2 ms to minimize.
[2024-05-30 10:54:46] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-05-30 10:54:46] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-30 10:54:46] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-05-30 10:54:47] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 2 ms to minimize.
[2024-05-30 10:54:47] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 2 ms to minimize.
[2024-05-30 10:54:47] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 2 ms to minimize.
[2024-05-30 10:54:47] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2024-05-30 10:54:47] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-30 10:54:47] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-30 10:54:47] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2024-05-30 10:54:47] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-30 10:54:47] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-30 10:54:47] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-30 10:54:48] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-30 10:54:48] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 20/257 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 10:54:58] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 1 ms to minimize.
[2024-05-30 10:54:58] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-30 10:54:58] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 2 ms to minimize.
[2024-05-30 10:54:58] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-30 10:54:58] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-05-30 10:54:58] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 1 ms to minimize.
[2024-05-30 10:54:58] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 2 ms to minimize.
[2024-05-30 10:54:58] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2024-05-30 10:54:59] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-30 10:54:59] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 2 ms to minimize.
[2024-05-30 10:54:59] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 2 ms to minimize.
[2024-05-30 10:54:59] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-30 10:54:59] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 2 ms to minimize.
[2024-05-30 10:54:59] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 2 ms to minimize.
[2024-05-30 10:54:59] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-30 10:54:59] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 2 ms to minimize.
[2024-05-30 10:54:59] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-30 10:55:00] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 2 ms to minimize.
[2024-05-30 10:55:00] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-30 10:55:00] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/703 variables, 20/277 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 10:55:01] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 2 ms to minimize.
[2024-05-30 10:55:01] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2024-05-30 10:55:01] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-30 10:55:01] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
[2024-05-30 10:55:01] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 2 ms to minimize.
[2024-05-30 10:55:01] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2024-05-30 10:55:02] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 1 ms to minimize.
[2024-05-30 10:55:02] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 1 ms to minimize.
[2024-05-30 10:55:02] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 1 ms to minimize.
[2024-05-30 10:55:02] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 1 ms to minimize.
SMT process timed out in 30368ms, After SMT, problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 30379ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31544 ms. Remains : 704/704 places, 954/954 transitions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (NOT p0)), (F (NOT p2)), (F (NOT p1)), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 10 factoid took 406 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 280 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Support contains 5 out of 1653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1653/1653 places, 1903/1903 transitions.
Applied a total of 0 rules in 48 ms. Remains 1653 /1653 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2024-05-30 10:55:03] [INFO ] Computed 201 invariants in 13 ms
[2024-05-30 10:55:03] [INFO ] Implicit Places using invariants in 450 ms returned []
[2024-05-30 10:55:03] [INFO ] Invariant cache hit.
[2024-05-30 10:55:05] [INFO ] Implicit Places using invariants and state equation in 1499 ms returned []
Implicit Place search using SMT with State Equation took 1950 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2024-05-30 10:55:05] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1652/3556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1653 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)
(s1223 1)
(s1224 1)
(s1225 1)
(s1226 1)
(s1227 1)
(s1228 1)
(s1229 1)
(s1230 1)
(s1231 1)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 1)
(s1238 1)
(s1239 1)
(s1240 1)
(s1241 1)
(s1242 1)
(s1243 1)
(s1244 1)
(s1245 1)
(s1246 1)
(s1247 1)
(s1248 1)
(s1249 1)
(s1250 1)
(s1251 1)
(s1252 1)
(s1253 1)
(s1254 1)
(s1255 1)
(s1256 1)
(s1257 1)
(s1258 1)
(s1259 1)
(s1260 1)
(s1261 1)
(s1262 1)
(s1263 1)
(s1264 1)
(s1265 1)
(s1266 1)
(s1267 1)
(s1268 1)
(s1269 1)
(s1270 1)
(s1271 1)
(s1272 1)
(s1273 1)
(s1274 1)
(s1275 1)
(s1276 1)
(s1277 1)
(s1278 1)
(s1279 1)
(s1280 1)
(s1281 1)
(s1282 1)
(s1283 1)
(s1284 1)
(s1285 1)
(s1286 1)
(s1287 1)
(s1288 1)
(s1289 1)
(s1290 1)
(s1291 1)
(s1292 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1652/3556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1653 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints]
After SMT, in 60587ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 60605ms
Finished structural reductions in LTL mode , in 1 iterations and 62610 ms. Remains : 1653/1653 places, 1903/1903 transitions.
Computed a total of 399 stabilizing places and 399 stable transitions
Computed a total of 399 stabilizing places and 399 stable transitions
Detected a total of 399/1653 stabilizing places and 399/1903 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 149 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
RANDOM walk for 40000 steps (16 resets) in 927 ms. (43 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
[2024-05-30 10:56:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 87/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1561/1653 variables, 196/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1653 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1903/3556 variables, 1653/1854 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3556 variables, 0/1854 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/3556 variables, 0/1854 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3556/3556 variables, and 1854 constraints, problems are : Problem set: 0 solved, 2 unsolved in 879 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 1653/1653 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 87/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1561/1653 variables, 196/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 10:56:08] [INFO ] Deduced a trap composed of 15 places in 315 ms of which 6 ms to minimize.
[2024-05-30 10:56:08] [INFO ] Deduced a trap composed of 35 places in 304 ms of which 5 ms to minimize.
[2024-05-30 10:56:08] [INFO ] Deduced a trap composed of 18 places in 324 ms of which 5 ms to minimize.
[2024-05-30 10:56:09] [INFO ] Deduced a trap composed of 37 places in 300 ms of which 5 ms to minimize.
[2024-05-30 10:56:09] [INFO ] Deduced a trap composed of 19 places in 292 ms of which 5 ms to minimize.
[2024-05-30 10:56:09] [INFO ] Deduced a trap composed of 19 places in 286 ms of which 5 ms to minimize.
[2024-05-30 10:56:10] [INFO ] Deduced a trap composed of 20 places in 292 ms of which 4 ms to minimize.
[2024-05-30 10:56:10] [INFO ] Deduced a trap composed of 27 places in 281 ms of which 4 ms to minimize.
[2024-05-30 10:56:10] [INFO ] Deduced a trap composed of 38 places in 274 ms of which 5 ms to minimize.
[2024-05-30 10:56:11] [INFO ] Deduced a trap composed of 55 places in 269 ms of which 5 ms to minimize.
[2024-05-30 10:56:11] [INFO ] Deduced a trap composed of 35 places in 242 ms of which 5 ms to minimize.
[2024-05-30 10:56:11] [INFO ] Deduced a trap composed of 54 places in 234 ms of which 4 ms to minimize.
[2024-05-30 10:56:11] [INFO ] Deduced a trap composed of 48 places in 227 ms of which 4 ms to minimize.
[2024-05-30 10:56:12] [INFO ] Deduced a trap composed of 41 places in 227 ms of which 4 ms to minimize.
[2024-05-30 10:56:12] [INFO ] Deduced a trap composed of 47 places in 231 ms of which 5 ms to minimize.
[2024-05-30 10:56:12] [INFO ] Deduced a trap composed of 45 places in 233 ms of which 4 ms to minimize.
[2024-05-30 10:56:12] [INFO ] Deduced a trap composed of 63 places in 235 ms of which 4 ms to minimize.
SMT process timed out in 6112ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 1653 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1653/1653 places, 1903/1903 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 1653 transition count 1705
Reduce places removed 198 places and 0 transitions.
Iterating post reduction 1 with 198 rules applied. Total rules applied 396 place count 1455 transition count 1705
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 396 place count 1455 transition count 1454
Deduced a syphon composed of 251 places in 2 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 898 place count 1204 transition count 1454
Performed 497 Post agglomeration using F-continuation condition.Transition count delta: 497
Deduced a syphon composed of 497 places in 1 ms
Reduce places removed 497 places and 0 transitions.
Iterating global reduction 2 with 994 rules applied. Total rules applied 1892 place count 707 transition count 957
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 102 times.
Drop transitions (Partial Free agglomeration) removed 102 transitions
Iterating global reduction 2 with 102 rules applied. Total rules applied 1994 place count 707 transition count 957
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1995 place count 706 transition count 956
Applied a total of 1995 rules in 287 ms. Remains 706 /1653 variables (removed 947) and now considering 956/1903 (removed 947) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 287 ms. Remains : 706/1653 places, 956/1903 transitions.
RANDOM walk for 40000 steps (67 resets) in 960 ms. (41 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 215 ms. (185 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 202 ms. (197 steps per ms) remains 1/1 properties
// Phase 1: matrix 956 rows 706 cols
[2024-05-30 10:56:13] [INFO ] Computed 201 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/21 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 44/65 variables, 21/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 118/183 variables, 40/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 9/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/189 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 6/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 130/319 variables, 52/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/319 variables, 13/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/319 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/327 variables, 4/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/327 variables, 8/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/327 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 124/451 variables, 48/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/451 variables, 12/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/451 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 8/459 variables, 4/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/459 variables, 8/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/459 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 121/580 variables, 48/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/580 variables, 12/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/580 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 8/588 variables, 4/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/588 variables, 8/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/588 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 99/687 variables, 40/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/687 variables, 10/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/687 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 8/695 variables, 4/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/695 variables, 8/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/695 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 93/788 variables, 36/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/788 variables, 9/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/788 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 6/794 variables, 3/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/794 variables, 6/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/794 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 93/887 variables, 36/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/887 variables, 9/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/887 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 6/893 variables, 3/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/893 variables, 6/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/893 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 93/986 variables, 36/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/986 variables, 9/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/986 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 6/992 variables, 3/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/992 variables, 6/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/992 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 93/1085 variables, 36/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1085 variables, 9/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1085 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 6/1091 variables, 3/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1091 variables, 6/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1091 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 93/1184 variables, 36/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1184 variables, 9/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1184 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 6/1190 variables, 3/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1190 variables, 6/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1190 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 93/1283 variables, 36/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1283 variables, 9/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1283 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (OVERLAPS) 6/1289 variables, 3/685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1289 variables, 6/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1289 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 89/1378 variables, 36/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1378 variables, 9/736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1378 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 6/1384 variables, 3/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1384 variables, 6/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1384 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 48/1432 variables, 24/769 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1432 variables, 7/776 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1432 variables, 0/776 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 2/1434 variables, 1/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1434 variables, 2/779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1434 variables, 0/779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (OVERLAPS) 31/1465 variables, 12/791 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1465 variables, 3/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1465 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (OVERLAPS) 2/1467 variables, 1/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1467 variables, 2/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1467 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (OVERLAPS) 31/1498 variables, 12/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1498 variables, 3/812 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1498 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (OVERLAPS) 2/1500 variables, 1/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1500 variables, 2/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1500 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (OVERLAPS) 31/1531 variables, 12/827 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1531 variables, 3/830 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1531 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (OVERLAPS) 2/1533 variables, 1/831 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1533 variables, 2/833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1533 variables, 0/833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (OVERLAPS) 31/1564 variables, 12/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1564 variables, 3/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1564 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (OVERLAPS) 2/1566 variables, 1/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1566 variables, 2/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1566 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (OVERLAPS) 31/1597 variables, 12/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1597 variables, 3/866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1597 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (OVERLAPS) 2/1599 variables, 1/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1599 variables, 2/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1599 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (OVERLAPS) 31/1630 variables, 12/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1630 variables, 3/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1630 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (OVERLAPS) 2/1632 variables, 1/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1632 variables, 2/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1632 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (OVERLAPS) 26/1658 variables, 11/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1658 variables, 3/901 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/1658 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (OVERLAPS) 2/1660 variables, 1/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1660 variables, 2/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/1660 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (OVERLAPS) 2/1662 variables, 2/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1662 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/1662 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (OVERLAPS) 0/1662 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1662/1662 variables, and 907 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1003 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 706/706 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/21 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:56:14] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-30 10:56:14] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-30 10:56:14] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 44/65 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 118/183 variables, 40/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 9/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/189 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 6/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 130/319 variables, 52/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/319 variables, 13/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:56:14] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/319 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/319 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/327 variables, 4/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/327 variables, 8/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/327 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 124/451 variables, 48/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/451 variables, 12/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/451 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 8/459 variables, 4/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/459 variables, 8/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/459 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 121/580 variables, 48/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/580 variables, 12/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/580 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 8/588 variables, 4/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/588 variables, 8/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/588 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 99/687 variables, 40/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/687 variables, 10/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/687 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 8/695 variables, 4/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/695 variables, 8/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/695 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 93/788 variables, 36/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/788 variables, 9/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/788 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 6/794 variables, 3/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/794 variables, 6/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/794 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 93/887 variables, 36/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/887 variables, 9/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/887 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 6/893 variables, 3/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/893 variables, 6/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/893 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 93/986 variables, 36/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/986 variables, 9/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/986 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 6/992 variables, 3/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/992 variables, 6/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/992 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 93/1085 variables, 36/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1085 variables, 9/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:56:15] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 2 ms to minimize.
[2024-05-30 10:56:15] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2024-05-30 10:56:15] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
At refinement iteration 60 (INCLUDED_ONLY) 0/1085 variables, 3/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1085 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 6/1091 variables, 3/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1091 variables, 6/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1091 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 93/1184 variables, 36/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1184 variables, 9/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:56:15] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 1 ms to minimize.
At refinement iteration 67 (INCLUDED_ONLY) 0/1184 variables, 1/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1184 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 6/1190 variables, 3/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1190 variables, 6/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1190 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 93/1283 variables, 36/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1283 variables, 9/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:56:15] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 2 ms to minimize.
At refinement iteration 74 (INCLUDED_ONLY) 0/1283 variables, 1/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1283 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 6/1289 variables, 3/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1289 variables, 6/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1289 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 89/1378 variables, 36/737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1378 variables, 9/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1378 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 6/1384 variables, 3/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1384 variables, 6/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1384 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (OVERLAPS) 48/1432 variables, 24/779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1432 variables, 7/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1432 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (OVERLAPS) 2/1434 variables, 1/787 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1434 variables, 2/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1434 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (OVERLAPS) 31/1465 variables, 12/801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1465 variables, 3/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1465 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (OVERLAPS) 2/1467 variables, 1/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1467 variables, 2/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1467 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (OVERLAPS) 31/1498 variables, 12/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1498 variables, 3/822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1498 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (OVERLAPS) 2/1500 variables, 1/823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1500 variables, 2/825 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1500 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (OVERLAPS) 31/1531 variables, 12/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1531 variables, 3/840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1531 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (OVERLAPS) 2/1533 variables, 1/841 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1533 variables, 2/843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1533 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (OVERLAPS) 31/1564 variables, 12/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1564 variables, 3/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1564 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (OVERLAPS) 2/1566 variables, 1/859 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1566 variables, 2/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1566 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (OVERLAPS) 31/1597 variables, 12/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1597 variables, 3/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1597 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (OVERLAPS) 2/1599 variables, 1/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1599 variables, 2/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1599 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (OVERLAPS) 31/1630 variables, 12/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1630 variables, 3/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/1630 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (OVERLAPS) 2/1632 variables, 1/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1632 variables, 2/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/1632 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (OVERLAPS) 26/1658 variables, 11/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1658 variables, 3/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/1658 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (OVERLAPS) 2/1660 variables, 1/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/1660 variables, 2/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/1660 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (OVERLAPS) 2/1662 variables, 2/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/1662 variables, 1/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/1662 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (OVERLAPS) 0/1662 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 917 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1865 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 706/706 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 2879ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 98 ms.
Support contains 2 out of 706 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 706/706 places, 956/956 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 706 transition count 954
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 704 transition count 954
Applied a total of 4 rules in 36 ms. Remains 704 /706 variables (removed 2) and now considering 954/956 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 704/706 places, 954/956 transitions.
RANDOM walk for 40000 steps (67 resets) in 231 ms. (172 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 427615 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :0 out of 1
Probabilistic random walk after 427615 steps, saw 419783 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
// Phase 1: matrix 954 rows 704 cols
[2024-05-30 10:56:19] [INFO ] Computed 201 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/21 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 44/65 variables, 21/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 118/183 variables, 40/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 9/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/189 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 6/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 130/319 variables, 52/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/319 variables, 13/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/319 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/327 variables, 4/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/327 variables, 8/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/327 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 124/451 variables, 48/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/451 variables, 12/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/451 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 8/459 variables, 4/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/459 variables, 8/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/459 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 121/580 variables, 48/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/580 variables, 12/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/580 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 8/588 variables, 4/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/588 variables, 8/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/588 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 97/685 variables, 40/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/685 variables, 11/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/685 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 6/691 variables, 3/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/691 variables, 6/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/691 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 93/784 variables, 36/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/784 variables, 9/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/784 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 6/790 variables, 3/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/790 variables, 6/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/790 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 93/883 variables, 36/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/883 variables, 9/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/883 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 6/889 variables, 3/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/889 variables, 6/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/889 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 93/982 variables, 36/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/982 variables, 9/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/982 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 6/988 variables, 3/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/988 variables, 6/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/988 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 93/1081 variables, 36/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1081 variables, 9/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1081 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 6/1087 variables, 3/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1087 variables, 6/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1087 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 93/1180 variables, 36/617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1180 variables, 9/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1180 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 6/1186 variables, 3/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1186 variables, 6/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1186 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 93/1279 variables, 36/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1279 variables, 9/680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1279 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (OVERLAPS) 6/1285 variables, 3/683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1285 variables, 6/689 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1285 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 89/1374 variables, 36/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1374 variables, 9/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1374 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 6/1380 variables, 3/737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1380 variables, 6/743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1380 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 48/1428 variables, 24/767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1428 variables, 7/774 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1428 variables, 0/774 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 2/1430 variables, 1/775 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1430 variables, 2/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1430 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (OVERLAPS) 31/1461 variables, 12/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1461 variables, 3/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1461 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (OVERLAPS) 2/1463 variables, 1/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1463 variables, 2/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1463 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (OVERLAPS) 31/1494 variables, 12/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1494 variables, 3/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1494 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (OVERLAPS) 2/1496 variables, 1/811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1496 variables, 2/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1496 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (OVERLAPS) 31/1527 variables, 12/825 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1527 variables, 3/828 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1527 variables, 0/828 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (OVERLAPS) 2/1529 variables, 1/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1529 variables, 2/831 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1529 variables, 0/831 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (OVERLAPS) 31/1560 variables, 12/843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1560 variables, 3/846 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1560 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (OVERLAPS) 2/1562 variables, 1/847 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1562 variables, 2/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1562 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (OVERLAPS) 31/1593 variables, 12/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1593 variables, 3/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1593 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (OVERLAPS) 2/1595 variables, 1/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1595 variables, 2/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1595 variables, 0/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (OVERLAPS) 31/1626 variables, 12/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1626 variables, 3/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1626 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (OVERLAPS) 2/1628 variables, 1/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1628 variables, 2/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1628 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (OVERLAPS) 26/1654 variables, 11/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1654 variables, 3/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/1654 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (OVERLAPS) 2/1656 variables, 1/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1656 variables, 2/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/1656 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (OVERLAPS) 2/1658 variables, 2/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1658 variables, 1/905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/1658 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (OVERLAPS) 0/1658 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1658/1658 variables, and 905 constraints, problems are : Problem set: 0 solved, 1 unsolved in 918 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 704/704 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/21 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:56:20] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-30 10:56:20] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
[2024-05-30 10:56:20] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 44/65 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 118/183 variables, 40/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 9/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/189 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 6/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 130/319 variables, 52/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/319 variables, 13/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:56:20] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/319 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/319 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/327 variables, 4/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/327 variables, 8/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/327 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 124/451 variables, 48/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/451 variables, 12/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/451 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 8/459 variables, 4/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/459 variables, 8/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/459 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 121/580 variables, 48/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/580 variables, 12/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/580 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 8/588 variables, 4/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/588 variables, 8/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/588 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 97/685 variables, 40/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/685 variables, 11/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/685 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 6/691 variables, 3/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/691 variables, 6/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/691 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 93/784 variables, 36/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/784 variables, 9/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:56:21] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/784 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/784 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 6/790 variables, 3/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/790 variables, 6/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:56:21] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
At refinement iteration 46 (INCLUDED_ONLY) 0/790 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/790 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 93/883 variables, 36/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/883 variables, 9/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/883 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 6/889 variables, 3/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/889 variables, 6/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/889 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 93/982 variables, 36/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/982 variables, 9/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/982 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 6/988 variables, 3/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/988 variables, 6/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/988 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 93/1081 variables, 36/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1081 variables, 9/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1081 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 6/1087 variables, 3/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1087 variables, 6/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1087 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 93/1180 variables, 36/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1180 variables, 9/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1180 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 6/1186 variables, 3/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1186 variables, 6/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1186 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 93/1279 variables, 36/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1279 variables, 9/687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1279 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 6/1285 variables, 3/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1285 variables, 6/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1285 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (OVERLAPS) 89/1374 variables, 36/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1374 variables, 9/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1374 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (OVERLAPS) 6/1380 variables, 3/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1380 variables, 6/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1380 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (OVERLAPS) 48/1428 variables, 24/774 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1428 variables, 7/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1428 variables, 0/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (OVERLAPS) 2/1430 variables, 1/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1430 variables, 2/784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1430 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (OVERLAPS) 31/1461 variables, 12/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1461 variables, 3/799 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1461 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (OVERLAPS) 2/1463 variables, 1/800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1463 variables, 2/802 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1463 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (OVERLAPS) 31/1494 variables, 12/814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1494 variables, 3/817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1494 variables, 0/817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (OVERLAPS) 2/1496 variables, 1/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1496 variables, 2/820 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1496 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (OVERLAPS) 31/1527 variables, 12/832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1527 variables, 3/835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1527 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (OVERLAPS) 2/1529 variables, 1/836 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1529 variables, 2/838 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1529 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (OVERLAPS) 31/1560 variables, 12/850 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1560 variables, 3/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1560 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (OVERLAPS) 2/1562 variables, 1/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1562 variables, 2/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1562 variables, 0/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (OVERLAPS) 31/1593 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1593 variables, 3/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1593 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (OVERLAPS) 2/1595 variables, 1/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1595 variables, 2/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1595 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (OVERLAPS) 31/1626 variables, 12/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1626 variables, 3/889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1626 variables, 0/889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (OVERLAPS) 2/1628 variables, 1/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1628 variables, 2/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1628 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (OVERLAPS) 26/1654 variables, 11/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/1654 variables, 3/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1654 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (OVERLAPS) 2/1656 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/1656 variables, 2/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/1656 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (OVERLAPS) 2/1658 variables, 2/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/1658 variables, 1/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/1658 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (OVERLAPS) 0/1658 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1658/1658 variables, and 912 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1496 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 704/704 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 2424ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 2 out of 704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 954/954 transitions.
Applied a total of 0 rules in 17 ms. Remains 704 /704 variables (removed 0) and now considering 954/954 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 704/704 places, 954/954 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 954/954 transitions.
Applied a total of 0 rules in 18 ms. Remains 704 /704 variables (removed 0) and now considering 954/954 (removed 0) transitions.
[2024-05-30 10:56:22] [INFO ] Invariant cache hit.
[2024-05-30 10:56:22] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-30 10:56:22] [INFO ] Invariant cache hit.
[2024-05-30 10:56:23] [INFO ] Implicit Places using invariants and state equation in 721 ms returned []
Implicit Place search using SMT with State Equation took 1022 ms to find 0 implicit places.
[2024-05-30 10:56:23] [INFO ] Redundant transitions in 72 ms returned []
Running 952 sub problems to find dead transitions.
[2024-05-30 10:56:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/703 variables, 197/197 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 10:56:33] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-05-30 10:56:33] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-30 10:56:33] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-30 10:56:33] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-30 10:56:33] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-30 10:56:33] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-30 10:56:34] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-30 10:56:34] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 2 ms to minimize.
[2024-05-30 10:56:34] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-30 10:56:34] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-30 10:56:34] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-30 10:56:34] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-30 10:56:34] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-30 10:56:34] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-30 10:56:34] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:56:34] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-30 10:56:34] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
[2024-05-30 10:56:34] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 1 ms to minimize.
[2024-05-30 10:56:35] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-30 10:56:35] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/703 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 10:56:35] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-30 10:56:35] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-30 10:56:35] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-30 10:56:35] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-30 10:56:35] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2024-05-30 10:56:35] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-05-30 10:56:35] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2024-05-30 10:56:36] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2024-05-30 10:56:36] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-05-30 10:56:36] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 2 ms to minimize.
[2024-05-30 10:56:36] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 2 ms to minimize.
[2024-05-30 10:56:36] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 1 ms to minimize.
[2024-05-30 10:56:36] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2024-05-30 10:56:36] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 1 ms to minimize.
[2024-05-30 10:56:36] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-05-30 10:56:36] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
[2024-05-30 10:56:36] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-30 10:56:37] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 1 ms to minimize.
[2024-05-30 10:56:37] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 1 ms to minimize.
[2024-05-30 10:56:37] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/703 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 10:56:37] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-30 10:56:37] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-05-30 10:56:38] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2024-05-30 10:56:38] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 1 ms to minimize.
[2024-05-30 10:56:38] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 2 ms to minimize.
[2024-05-30 10:56:38] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 1 ms to minimize.
[2024-05-30 10:56:38] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-30 10:56:38] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2024-05-30 10:56:38] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 1 ms to minimize.
[2024-05-30 10:56:38] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 2 ms to minimize.
[2024-05-30 10:56:38] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 2 ms to minimize.
[2024-05-30 10:56:39] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 1 ms to minimize.
[2024-05-30 10:56:39] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 0 ms to minimize.
[2024-05-30 10:56:39] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-05-30 10:56:39] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-30 10:56:39] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-05-30 10:56:39] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-05-30 10:56:39] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 2 ms to minimize.
[2024-05-30 10:56:39] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-30 10:56:39] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 20/257 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 10:56:49] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 1 ms to minimize.
[2024-05-30 10:56:49] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-30 10:56:50] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 2 ms to minimize.
[2024-05-30 10:56:50] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-30 10:56:50] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2024-05-30 10:56:50] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 1 ms to minimize.
[2024-05-30 10:56:50] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-05-30 10:56:50] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 1 ms to minimize.
[2024-05-30 10:56:50] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-30 10:56:50] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 2 ms to minimize.
[2024-05-30 10:56:51] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 2 ms to minimize.
[2024-05-30 10:56:51] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-30 10:56:51] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 1 ms to minimize.
[2024-05-30 10:56:51] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 2 ms to minimize.
[2024-05-30 10:56:51] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-30 10:56:51] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 2 ms to minimize.
[2024-05-30 10:56:51] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-30 10:56:51] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 2 ms to minimize.
[2024-05-30 10:56:51] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-30 10:56:51] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/703 variables, 20/277 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 10:56:52] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2024-05-30 10:56:53] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-05-30 10:56:53] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-30 10:56:53] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-05-30 10:56:53] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 2 ms to minimize.
[2024-05-30 10:56:53] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 2 ms to minimize.
SMT process timed out in 30356ms, After SMT, problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 30364ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31483 ms. Remains : 704/704 places, 954/954 transitions.
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (NOT p0)), (F (NOT p2)), (F (NOT p1)), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 10 factoid took 354 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 276 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 269 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Product exploration explored 100000 steps with 33295 reset in 365 ms.
Product exploration explored 100000 steps with 33427 reset in 379 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Support contains 5 out of 1653 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1653/1653 places, 1903/1903 transitions.
Performed 197 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 1653 transition count 1903
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 104 Pre rules applied. Total rules applied 197 place count 1653 transition count 1953
Deduced a syphon composed of 301 places in 3 ms
Iterating global reduction 1 with 104 rules applied. Total rules applied 301 place count 1653 transition count 1953
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 302 place count 1652 transition count 1952
Deduced a syphon composed of 300 places in 2 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 303 place count 1652 transition count 1952
Performed 645 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 945 places in 3 ms
Iterating global reduction 1 with 645 rules applied. Total rules applied 948 place count 1652 transition count 1952
Renaming transitions due to excessive name length > 1024 char.
Discarding 344 places :
Symmetric choice reduction at 1 with 344 rule applications. Total rules 1292 place count 1308 transition count 1608
Deduced a syphon composed of 601 places in 2 ms
Iterating global reduction 1 with 344 rules applied. Total rules applied 1636 place count 1308 transition count 1608
Deduced a syphon composed of 601 places in 1 ms
Applied a total of 1636 rules in 726 ms. Remains 1308 /1653 variables (removed 345) and now considering 1608/1903 (removed 295) transitions.
[2024-05-30 10:56:57] [INFO ] Redundant transitions in 191 ms returned [1607]
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 1606 sub problems to find dead transitions.
// Phase 1: matrix 1607 rows 1308 cols
[2024-05-30 10:56:57] [INFO ] Computed 201 invariants in 17 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1307 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
SMT process timed out in 31805ms, After SMT, problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 31819ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1308/1653 places, 1607/1903 transitions.
Deduced a syphon composed of 601 places in 2 ms
Applied a total of 0 rules in 54 ms. Remains 1308 /1308 variables (removed 0) and now considering 1607/1607 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 32801 ms. Remains : 1308/1653 places, 1607/1903 transitions.
Support contains 5 out of 1653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1653/1653 places, 1903/1903 transitions.
Applied a total of 0 rules in 35 ms. Remains 1653 /1653 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2024-05-30 10:57:28] [INFO ] Computed 201 invariants in 12 ms
[2024-05-30 10:57:29] [INFO ] Implicit Places using invariants in 500 ms returned []
[2024-05-30 10:57:29] [INFO ] Invariant cache hit.
[2024-05-30 10:57:31] [INFO ] Implicit Places using invariants and state equation in 1569 ms returned []
Implicit Place search using SMT with State Equation took 2073 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2024-05-30 10:57:31] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 timeout
1.0)
(s764 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1652/3556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1653 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1652/3556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1653 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints]
After SMT, in 60611ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 60630ms
Finished structural reductions in LTL mode , in 1 iterations and 62744 ms. Remains : 1653/1653 places, 1903/1903 transitions.
Treatment of property ShieldRVs-PT-050B-LTLFireability-02 finished in 320873 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 1656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1656/1656 places, 1906/1906 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1652 transition count 1902
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1652 transition count 1902
Applied a total of 8 rules in 80 ms. Remains 1652 /1656 variables (removed 4) and now considering 1902/1906 (removed 4) transitions.
// Phase 1: matrix 1902 rows 1652 cols
[2024-05-30 10:58:31] [INFO ] Computed 201 invariants in 23 ms
[2024-05-30 10:58:32] [INFO ] Implicit Places using invariants in 499 ms returned []
[2024-05-30 10:58:32] [INFO ] Invariant cache hit.
[2024-05-30 10:58:33] [INFO ] Implicit Places using invariants and state equation in 1617 ms returned []
Implicit Place search using SMT with State Equation took 2118 ms to find 0 implicit places.
Running 1901 sub problems to find dead transitions.
[2024-05-30 10:58:33] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1651/3554 variables, and 0 constraints, problems are : Problem set: 0 solved, 1901 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1652 constraints, PredecessorRefiner: 1901/1901 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1901 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1651/3554 variables, and 0 constraints, problems are : Problem set: 0 solved, 1901 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1652 constraints, PredecessorRefiner: 0/1901 constraints, Known Traps: 0/0 constraints]
After SMT, in 60640ms problems are : Problem set: 0 solved, 1901 unsolved
Search for dead transitions found 0 dead transitions in 60660ms
Starting structural reductions in LTL mode, iteration 1 : 1652/1656 places, 1902/1906 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62866 ms. Remains : 1652/1656 places, 1902/1906 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-03
Product exploration explored 100000 steps with 33333 reset in 371 ms.
Product exploration explored 100000 steps with 33333 reset in 376 ms.
Computed a total of 399 stabilizing places and 399 stable transitions
Computed a total of 399 stabilizing places and 399 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 18 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-050B-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-050B-LTLFireability-03 finished in 63830 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((X(p1)||p0)))'
Support contains 4 out of 1656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1656/1656 places, 1906/1906 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1653 transition count 1903
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1653 transition count 1903
Applied a total of 6 rules in 76 ms. Remains 1653 /1656 variables (removed 3) and now considering 1903/1906 (removed 3) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2024-05-30 10:59:35] [INFO ] Computed 201 invariants in 14 ms
[2024-05-30 10:59:36] [INFO ] Implicit Places using invariants in 450 ms returned []
[2024-05-30 10:59:36] [INFO ] Invariant cache hit.
[2024-05-30 10:59:37] [INFO ] Implicit Places using invariants and state equation in 1498 ms returned []
Implicit Place search using SMT with State Equation took 1950 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2024-05-30 10:59:37] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1652/3556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1653 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1652/3556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1653 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints]
After SMT, in 60583ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 60603ms
Starting structural reductions in LTL mode, iteration 1 : 1653/1656 places, 1903/1906 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62638 ms. Remains : 1653/1656 places, 1903/1906 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-04
Entered a terminal (fully accepting) state of product in 3863 steps with 1 reset in 20 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-04 finished in 62808 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 2 out of 1656 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1656/1656 places, 1906/1906 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1655 transition count 1704
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1454 transition count 1704
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 248 Pre rules applied. Total rules applied 402 place count 1454 transition count 1456
Deduced a syphon composed of 248 places in 2 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 2 with 496 rules applied. Total rules applied 898 place count 1206 transition count 1456
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 902 place count 1202 transition count 1452
Iterating global reduction 2 with 4 rules applied. Total rules applied 906 place count 1202 transition count 1452
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 906 place count 1202 transition count 1451
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 908 place count 1201 transition count 1451
Performed 496 Post agglomeration using F-continuation condition.Transition count delta: 496
Deduced a syphon composed of 496 places in 2 ms
Reduce places removed 496 places and 0 transitions.
Iterating global reduction 2 with 992 rules applied. Total rules applied 1900 place count 705 transition count 955
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1902 place count 703 transition count 953
Applied a total of 1902 rules in 221 ms. Remains 703 /1656 variables (removed 953) and now considering 953/1906 (removed 953) transitions.
// Phase 1: matrix 953 rows 703 cols
[2024-05-30 11:00:38] [INFO ] Computed 201 invariants in 6 ms
[2024-05-30 11:00:38] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-30 11:00:38] [INFO ] Invariant cache hit.
[2024-05-30 11:00:39] [INFO ] Implicit Places using invariants and state equation in 681 ms returned []
Implicit Place search using SMT with State Equation took 963 ms to find 0 implicit places.
[2024-05-30 11:00:39] [INFO ] Redundant transitions in 166 ms returned [952]
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 950 sub problems to find dead transitions.
// Phase 1: matrix 952 rows 703 cols
[2024-05-30 11:00:39] [INFO ] Computed 201 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:00:49] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 2 ms to minimize.
[2024-05-30 11:00:49] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:00:50] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 1 ms to minimize.
[2024-05-30 11:00:50] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:00:50] [INFO ] Deduced a trap composed of 106 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:00:50] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 0 ms to minimize.
[2024-05-30 11:00:50] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 2 ms to minimize.
[2024-05-30 11:00:50] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 3 ms to minimize.
[2024-05-30 11:00:50] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 3 ms to minimize.
[2024-05-30 11:00:51] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 2 ms to minimize.
[2024-05-30 11:00:51] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 2 ms to minimize.
[2024-05-30 11:00:51] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 3 ms to minimize.
[2024-05-30 11:00:51] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 3 ms to minimize.
[2024-05-30 11:00:51] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 3 ms to minimize.
[2024-05-30 11:00:52] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 3 ms to minimize.
[2024-05-30 11:00:52] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 2 ms to minimize.
[2024-05-30 11:00:52] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:00:52] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-30 11:00:52] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 3 ms to minimize.
[2024-05-30 11:00:52] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:00:53] [INFO ] Deduced a trap composed of 111 places in 75 ms of which 1 ms to minimize.
[2024-05-30 11:00:53] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:00:53] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-05-30 11:00:53] [INFO ] Deduced a trap composed of 111 places in 71 ms of which 1 ms to minimize.
[2024-05-30 11:00:53] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:00:53] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-30 11:00:54] [INFO ] Deduced a trap composed of 109 places in 177 ms of which 3 ms to minimize.
[2024-05-30 11:00:54] [INFO ] Deduced a trap composed of 106 places in 174 ms of which 3 ms to minimize.
[2024-05-30 11:00:54] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 3 ms to minimize.
[2024-05-30 11:00:54] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-30 11:00:54] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 2 ms to minimize.
[2024-05-30 11:00:55] [INFO ] Deduced a trap composed of 110 places in 174 ms of which 2 ms to minimize.
[2024-05-30 11:00:55] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 3 ms to minimize.
[2024-05-30 11:00:55] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 3 ms to minimize.
[2024-05-30 11:00:55] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 3 ms to minimize.
[2024-05-30 11:00:55] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-30 11:00:56] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-05-30 11:00:56] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 3 ms to minimize.
[2024-05-30 11:00:56] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 3 ms to minimize.
[2024-05-30 11:00:56] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/702 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:00:57] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-30 11:00:57] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-30 11:00:57] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 1 ms to minimize.
[2024-05-30 11:00:57] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 3 ms to minimize.
[2024-05-30 11:00:57] [INFO ] Deduced a trap composed of 106 places in 83 ms of which 1 ms to minimize.
[2024-05-30 11:00:58] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-05-30 11:00:58] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-30 11:00:58] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 3 ms to minimize.
[2024-05-30 11:00:58] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 2 ms to minimize.
[2024-05-30 11:00:58] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 3 ms to minimize.
[2024-05-30 11:00:58] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 2 ms to minimize.
[2024-05-30 11:00:59] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 2 ms to minimize.
[2024-05-30 11:00:59] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 3 ms to minimize.
[2024-05-30 11:00:59] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 2 ms to minimize.
[2024-05-30 11:00:59] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 2 ms to minimize.
[2024-05-30 11:00:59] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 2 ms to minimize.
[2024-05-30 11:00:59] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 2 ms to minimize.
[2024-05-30 11:00:59] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:01:00] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 2 ms to minimize.
[2024-05-30 11:01:00] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 950 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 702/1655 variables, and 260 constraints, problems are : Problem set: 0 solved, 950 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 200/201 constraints, State Equation: 0/703 constraints, PredecessorRefiner: 950/950 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 950 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 60/260 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:01:11] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 3 ms to minimize.
[2024-05-30 11:01:11] [INFO ] Deduced a trap composed of 18 places in 178 ms of which 3 ms to minimize.
[2024-05-30 11:01:11] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2024-05-30 11:01:12] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 3 ms to minimize.
[2024-05-30 11:01:12] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 3 ms to minimize.
[2024-05-30 11:01:12] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 3 ms to minimize.
[2024-05-30 11:01:12] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 2 ms to minimize.
[2024-05-30 11:01:12] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 2 ms to minimize.
[2024-05-30 11:01:13] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 3 ms to minimize.
[2024-05-30 11:01:13] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 3 ms to minimize.
[2024-05-30 11:01:13] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 2 ms to minimize.
[2024-05-30 11:01:13] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 3 ms to minimize.
[2024-05-30 11:01:13] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 2 ms to minimize.
[2024-05-30 11:01:14] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 3 ms to minimize.
[2024-05-30 11:01:14] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 3 ms to minimize.
[2024-05-30 11:01:14] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 3 ms to minimize.
[2024-05-30 11:01:14] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 3 ms to minimize.
[2024-05-30 11:01:14] [INFO ] Deduced a trap composed of 96 places in 170 ms of which 3 ms to minimize.
[2024-05-30 11:01:15] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 3 ms to minimize.
[2024-05-30 11:01:15] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/702 variables, 20/280 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:01:16] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 2 ms to minimize.
[2024-05-30 11:01:16] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-30 11:01:16] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 3 ms to minimize.
[2024-05-30 11:01:16] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 3 ms to minimize.
[2024-05-30 11:01:16] [INFO ] Deduced a trap composed of 100 places in 177 ms of which 2 ms to minimize.
[2024-05-30 11:01:17] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 3 ms to minimize.
[2024-05-30 11:01:17] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 3 ms to minimize.
[2024-05-30 11:01:17] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 3 ms to minimize.
[2024-05-30 11:01:17] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 2 ms to minimize.
[2024-05-30 11:01:17] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 3 ms to minimize.
[2024-05-30 11:01:18] [INFO ] Deduced a trap composed of 16 places in 182 ms of which 3 ms to minimize.
[2024-05-30 11:01:18] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 2 ms to minimize.
[2024-05-30 11:01:18] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 3 ms to minimize.
[2024-05-30 11:01:18] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 3 ms to minimize.
[2024-05-30 11:01:18] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 2 ms to minimize.
[2024-05-30 11:01:19] [INFO ] Deduced a trap composed of 10 places in 199 ms of which 3 ms to minimize.
[2024-05-30 11:01:19] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 3 ms to minimize.
[2024-05-30 11:01:19] [INFO ] Deduced a trap composed of 91 places in 181 ms of which 3 ms to minimize.
[2024-05-30 11:01:19] [INFO ] Deduced a trap composed of 92 places in 177 ms of which 3 ms to minimize.
[2024-05-30 11:01:20] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 20/300 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:01:20] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 3 ms to minimize.
[2024-05-30 11:01:20] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 2 ms to minimize.
[2024-05-30 11:01:21] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 3 ms to minimize.
[2024-05-30 11:01:21] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 2 ms to minimize.
[2024-05-30 11:01:21] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
[2024-05-30 11:01:21] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2024-05-30 11:01:21] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 2 ms to minimize.
[2024-05-30 11:01:22] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 2 ms to minimize.
[2024-05-30 11:01:22] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 3 ms to minimize.
[2024-05-30 11:01:22] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 1 ms to minimize.
[2024-05-30 11:01:22] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
[2024-05-30 11:01:22] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 3 ms to minimize.
[2024-05-30 11:01:23] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 3 ms to minimize.
[2024-05-30 11:01:23] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 3 ms to minimize.
[2024-05-30 11:01:23] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 3 ms to minimize.
[2024-05-30 11:01:23] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 3 ms to minimize.
[2024-05-30 11:01:23] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 1 ms to minimize.
[2024-05-30 11:01:23] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-30 11:01:24] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 3 ms to minimize.
[2024-05-30 11:01:24] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/702 variables, 20/320 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:01:24] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-30 11:01:25] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2024-05-30 11:01:25] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2024-05-30 11:01:25] [INFO ] Deduced a trap composed of 16 places in 182 ms of which 2 ms to minimize.
[2024-05-30 11:01:26] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 2 ms to minimize.
[2024-05-30 11:01:26] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 3 ms to minimize.
[2024-05-30 11:01:26] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 3 ms to minimize.
[2024-05-30 11:01:26] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 2 ms to minimize.
[2024-05-30 11:01:26] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
[2024-05-30 11:01:27] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 1 ms to minimize.
[2024-05-30 11:01:27] [INFO ] Deduced a trap composed of 101 places in 100 ms of which 1 ms to minimize.
[2024-05-30 11:01:27] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 2 ms to minimize.
[2024-05-30 11:01:27] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 2 ms to minimize.
[2024-05-30 11:01:27] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 1 ms to minimize.
[2024-05-30 11:01:27] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 2 ms to minimize.
[2024-05-30 11:01:27] [INFO ] Deduced a trap composed of 7 places in 187 ms of which 2 ms to minimize.
[2024-05-30 11:01:28] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 2 ms to minimize.
[2024-05-30 11:01:28] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
[2024-05-30 11:01:28] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 3 ms to minimize.
[2024-05-30 11:01:28] [INFO ] Deduced a trap composed of 18 places in 190 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/702 variables, 20/340 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:01:30] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 2 ms to minimize.
[2024-05-30 11:01:30] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 1 ms to minimize.
[2024-05-30 11:01:30] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 2 ms to minimize.
[2024-05-30 11:01:30] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2024-05-30 11:01:30] [INFO ] Deduced a trap composed of 12 places in 181 ms of which 3 ms to minimize.
[2024-05-30 11:01:30] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 3 ms to minimize.
[2024-05-30 11:01:31] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 2 ms to minimize.
[2024-05-30 11:01:31] [INFO ] Deduced a trap composed of 20 places in 178 ms of which 3 ms to minimize.
[2024-05-30 11:01:31] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2024-05-30 11:01:31] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2024-05-30 11:01:31] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 1 ms to minimize.
[2024-05-30 11:01:31] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2024-05-30 11:01:32] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 2 ms to minimize.
[2024-05-30 11:01:32] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 3 ms to minimize.
[2024-05-30 11:01:32] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 3 ms to minimize.
[2024-05-30 11:01:32] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 2 ms to minimize.
[2024-05-30 11:01:32] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 3 ms to minimize.
[2024-05-30 11:01:33] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 3 ms to minimize.
[2024-05-30 11:01:33] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 3 ms to minimize.
[2024-05-30 11:01:33] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 20/360 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:01:34] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 3 ms to minimize.
[2024-05-30 11:01:35] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 3 ms to minimize.
[2024-05-30 11:01:35] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2024-05-30 11:01:35] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 2 ms to minimize.
[2024-05-30 11:01:35] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 2 ms to minimize.
[2024-05-30 11:01:35] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 3 ms to minimize.
[2024-05-30 11:01:36] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-05-30 11:01:36] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:01:36] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-05-30 11:01:36] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:01:36] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 3 ms to minimize.
[2024-05-30 11:01:36] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-05-30 11:01:36] [INFO ] Deduced a trap composed of 20 places in 154 ms of which 3 ms to minimize.
[2024-05-30 11:01:37] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 3 ms to minimize.
[2024-05-30 11:01:37] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 2 ms to minimize.
[2024-05-30 11:01:37] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 2 ms to minimize.
[2024-05-30 11:01:37] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 2 ms to minimize.
[2024-05-30 11:01:37] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2024-05-30 11:01:37] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
[2024-05-30 11:01:38] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 20/380 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:01:39] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 2 ms to minimize.
[2024-05-30 11:01:39] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 2 ms to minimize.
[2024-05-30 11:01:40] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 3 ms to minimize.
SMT process timed out in 60351ms, After SMT, problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 60361ms
Starting structural reductions in SI_LTL mode, iteration 1 : 703/1656 places, 952/1906 transitions.
Applied a total of 0 rules in 29 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61750 ms. Remains : 703/1656 places, 952/1906 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-07
Product exploration explored 100000 steps with 163 reset in 506 ms.
Product exploration explored 100000 steps with 164 reset in 616 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 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 41 ms :[(NOT p0)]
RANDOM walk for 2427 steps (0 resets) in 21 ms. (110 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 130 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 53 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2024-05-30 11:01:41] [INFO ] Invariant cache hit.
[2024-05-30 11:01:42] [INFO ] [Real]Absence check using 201 positive place invariants in 61 ms returned sat
[2024-05-30 11:01:43] [INFO ] [Real]Absence check using state equation in 809 ms returned sat
[2024-05-30 11:01:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 11:01:43] [INFO ] [Nat]Absence check using 201 positive place invariants in 61 ms returned sat
[2024-05-30 11:01:44] [INFO ] [Nat]Absence check using state equation in 777 ms returned sat
[2024-05-30 11:01:44] [INFO ] Computed and/alt/rep : 853/3685/853 causal constraints (skipped 97 transitions) in 60 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-30 11:01:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 2 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 952/952 transitions.
Applied a total of 0 rules in 16 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
[2024-05-30 11:01:58] [INFO ] Invariant cache hit.
[2024-05-30 11:01:58] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-05-30 11:01:58] [INFO ] Invariant cache hit.
[2024-05-30 11:01:59] [INFO ] Implicit Places using invariants and state equation in 720 ms returned []
Implicit Place search using SMT with State Equation took 1013 ms to find 0 implicit places.
[2024-05-30 11:01:59] [INFO ] Redundant transitions in 164 ms returned []
Running 950 sub problems to find dead transitions.
[2024-05-30 11:01:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:02:09] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2024-05-30 11:02:09] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 1 ms to minimize.
[2024-05-30 11:02:09] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:02:09] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2024-05-30 11:02:09] [INFO ] Deduced a trap composed of 106 places in 79 ms of which 1 ms to minimize.
[2024-05-30 11:02:09] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:02:10] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-05-30 11:02:10] [INFO ] Deduced a trap composed of 12 places in 193 ms of which 2 ms to minimize.
[2024-05-30 11:02:10] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 2 ms to minimize.
[2024-05-30 11:02:10] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 3 ms to minimize.
[2024-05-30 11:02:11] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 3 ms to minimize.
[2024-05-30 11:02:11] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 2 ms to minimize.
[2024-05-30 11:02:11] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 2 ms to minimize.
[2024-05-30 11:02:11] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 3 ms to minimize.
[2024-05-30 11:02:11] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 2 ms to minimize.
[2024-05-30 11:02:11] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 2 ms to minimize.
[2024-05-30 11:02:12] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-05-30 11:02:12] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-30 11:02:12] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 2 ms to minimize.
[2024-05-30 11:02:12] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:02:12] [INFO ] Deduced a trap composed of 111 places in 68 ms of which 1 ms to minimize.
[2024-05-30 11:02:12] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-30 11:02:13] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-05-30 11:02:13] [INFO ] Deduced a trap composed of 111 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:02:13] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-05-30 11:02:13] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:02:13] [INFO ] Deduced a trap composed of 109 places in 175 ms of which 2 ms to minimize.
[2024-05-30 11:02:13] [INFO ] Deduced a trap composed of 106 places in 186 ms of which 3 ms to minimize.
[2024-05-30 11:02:14] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 3 ms to minimize.
[2024-05-30 11:02:14] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:02:14] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 2 ms to minimize.
[2024-05-30 11:02:14] [INFO ] Deduced a trap composed of 110 places in 177 ms of which 3 ms to minimize.
[2024-05-30 11:02:14] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 3 ms to minimize.
[2024-05-30 11:02:15] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 3 ms to minimize.
[2024-05-30 11:02:15] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 2 ms to minimize.
[2024-05-30 11:02:15] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-30 11:02:15] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-30 11:02:15] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 3 ms to minimize.
[2024-05-30 11:02:16] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 3 ms to minimize.
[2024-05-30 11:02:16] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/702 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:02:16] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-30 11:02:16] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-05-30 11:02:16] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 1 ms to minimize.
[2024-05-30 11:02:17] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 3 ms to minimize.
[2024-05-30 11:02:17] [INFO ] Deduced a trap composed of 106 places in 77 ms of which 1 ms to minimize.
[2024-05-30 11:02:17] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-05-30 11:02:17] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-05-30 11:02:17] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 3 ms to minimize.
[2024-05-30 11:02:18] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 2 ms to minimize.
[2024-05-30 11:02:18] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 2 ms to minimize.
[2024-05-30 11:02:18] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 3 ms to minimize.
[2024-05-30 11:02:18] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 2 ms to minimize.
[2024-05-30 11:02:18] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 2 ms to minimize.
[2024-05-30 11:02:18] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 2 ms to minimize.
[2024-05-30 11:02:19] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 2 ms to minimize.
[2024-05-30 11:02:19] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 2 ms to minimize.
[2024-05-30 11:02:19] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2024-05-30 11:02:19] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2024-05-30 11:02:19] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2024-05-30 11:02:19] [INFO ] Deduced a trap composed of 22 places in 186 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 950 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 702/1655 variables, and 260 constraints, problems are : Problem set: 0 solved, 950 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 200/201 constraints, State Equation: 0/703 constraints, PredecessorRefiner: 950/950 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 950 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 60/260 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:02:31] [INFO ] Deduced a trap composed of 11 places in 199 ms of which 3 ms to minimize.
[2024-05-30 11:02:31] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 3 ms to minimize.
[2024-05-30 11:02:31] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 3 ms to minimize.
[2024-05-30 11:02:31] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 1 ms to minimize.
[2024-05-30 11:02:31] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-05-30 11:02:31] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 1 ms to minimize.
[2024-05-30 11:02:32] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 3 ms to minimize.
[2024-05-30 11:02:32] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 3 ms to minimize.
[2024-05-30 11:02:32] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 3 ms to minimize.
[2024-05-30 11:02:32] [INFO ] Deduced a trap composed of 16 places in 196 ms of which 2 ms to minimize.
[2024-05-30 11:02:32] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 3 ms to minimize.
[2024-05-30 11:02:33] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 2 ms to minimize.
[2024-05-30 11:02:33] [INFO ] Deduced a trap composed of 94 places in 185 ms of which 3 ms to minimize.
[2024-05-30 11:02:33] [INFO ] Deduced a trap composed of 93 places in 197 ms of which 3 ms to minimize.
[2024-05-30 11:02:33] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 3 ms to minimize.
[2024-05-30 11:02:33] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 2 ms to minimize.
[2024-05-30 11:02:34] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 3 ms to minimize.
[2024-05-30 11:02:34] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 2 ms to minimize.
[2024-05-30 11:02:34] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 2 ms to minimize.
[2024-05-30 11:02:34] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/702 variables, 20/280 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:02:35] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-30 11:02:35] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 3 ms to minimize.
[2024-05-30 11:02:35] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 3 ms to minimize.
[2024-05-30 11:02:35] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 3 ms to minimize.
[2024-05-30 11:02:36] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 2 ms to minimize.
[2024-05-30 11:02:36] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 3 ms to minimize.
[2024-05-30 11:02:36] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 3 ms to minimize.
[2024-05-30 11:02:36] [INFO ] Deduced a trap composed of 12 places in 188 ms of which 2 ms to minimize.
[2024-05-30 11:02:37] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-05-30 11:02:37] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 3 ms to minimize.
[2024-05-30 11:02:37] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 2 ms to minimize.
[2024-05-30 11:02:37] [INFO ] Deduced a trap composed of 18 places in 183 ms of which 3 ms to minimize.
[2024-05-30 11:02:38] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 2 ms to minimize.
[2024-05-30 11:02:38] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 3 ms to minimize.
[2024-05-30 11:02:38] [INFO ] Deduced a trap composed of 89 places in 188 ms of which 2 ms to minimize.
[2024-05-30 11:02:38] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 2 ms to minimize.
[2024-05-30 11:02:38] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 2 ms to minimize.
[2024-05-30 11:02:39] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 2 ms to minimize.
[2024-05-30 11:02:39] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 4 ms to minimize.
[2024-05-30 11:02:39] [INFO ] Deduced a trap composed of 18 places in 193 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 20/300 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:02:40] [INFO ] Deduced a trap composed of 15 places in 204 ms of which 3 ms to minimize.
[2024-05-30 11:02:40] [INFO ] Deduced a trap composed of 20 places in 178 ms of which 3 ms to minimize.
[2024-05-30 11:02:40] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 3 ms to minimize.
[2024-05-30 11:02:41] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 3 ms to minimize.
[2024-05-30 11:02:41] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 3 ms to minimize.
[2024-05-30 11:02:41] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 3 ms to minimize.
[2024-05-30 11:02:41] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 2 ms to minimize.
[2024-05-30 11:02:41] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
[2024-05-30 11:02:42] [INFO ] Deduced a trap composed of 12 places in 207 ms of which 3 ms to minimize.
[2024-05-30 11:02:42] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 2 ms to minimize.
[2024-05-30 11:02:42] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 3 ms to minimize.
[2024-05-30 11:02:42] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 2 ms to minimize.
[2024-05-30 11:02:42] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 3 ms to minimize.
[2024-05-30 11:02:43] [INFO ] Deduced a trap composed of 14 places in 206 ms of which 3 ms to minimize.
[2024-05-30 11:02:43] [INFO ] Deduced a trap composed of 7 places in 205 ms of which 3 ms to minimize.
[2024-05-30 11:02:43] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 2 ms to minimize.
[2024-05-30 11:02:43] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 3 ms to minimize.
[2024-05-30 11:02:44] [INFO ] Deduced a trap composed of 16 places in 180 ms of which 2 ms to minimize.
[2024-05-30 11:02:44] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 2 ms to minimize.
[2024-05-30 11:02:44] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/702 variables, 20/320 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:02:45] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 2 ms to minimize.
[2024-05-30 11:02:45] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 3 ms to minimize.
[2024-05-30 11:02:46] [INFO ] Deduced a trap composed of 11 places in 208 ms of which 2 ms to minimize.
[2024-05-30 11:02:46] [INFO ] Deduced a trap composed of 95 places in 193 ms of which 3 ms to minimize.
[2024-05-30 11:02:46] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 2 ms to minimize.
[2024-05-30 11:02:47] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 3 ms to minimize.
[2024-05-30 11:02:47] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 3 ms to minimize.
[2024-05-30 11:02:47] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 2 ms to minimize.
[2024-05-30 11:02:47] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 3 ms to minimize.
[2024-05-30 11:02:47] [INFO ] Deduced a trap composed of 6 places in 198 ms of which 3 ms to minimize.
[2024-05-30 11:02:48] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 3 ms to minimize.
[2024-05-30 11:02:48] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 3 ms to minimize.
[2024-05-30 11:02:48] [INFO ] Deduced a trap composed of 18 places in 205 ms of which 2 ms to minimize.
[2024-05-30 11:02:48] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 2 ms to minimize.
[2024-05-30 11:02:49] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 3 ms to minimize.
[2024-05-30 11:02:49] [INFO ] Deduced a trap composed of 88 places in 186 ms of which 3 ms to minimize.
[2024-05-30 11:02:49] [INFO ] Deduced a trap composed of 15 places in 235 ms of which 4 ms to minimize.
[2024-05-30 11:02:49] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 3 ms to minimize.
[2024-05-30 11:02:49] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 2 ms to minimize.
[2024-05-30 11:02:50] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/702 variables, 20/340 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:02:51] [INFO ] Deduced a trap composed of 14 places in 193 ms of which 2 ms to minimize.
[2024-05-30 11:02:51] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 1 ms to minimize.
[2024-05-30 11:02:51] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 3 ms to minimize.
[2024-05-30 11:02:51] [INFO ] Deduced a trap composed of 12 places in 197 ms of which 3 ms to minimize.
[2024-05-30 11:02:52] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 3 ms to minimize.
[2024-05-30 11:02:52] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 3 ms to minimize.
[2024-05-30 11:02:52] [INFO ] Deduced a trap composed of 11 places in 193 ms of which 3 ms to minimize.
[2024-05-30 11:02:52] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 3 ms to minimize.
[2024-05-30 11:02:53] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 3 ms to minimize.
[2024-05-30 11:02:53] [INFO ] Deduced a trap composed of 12 places in 196 ms of which 3 ms to minimize.
[2024-05-30 11:02:53] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 3 ms to minimize.
[2024-05-30 11:02:53] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 2 ms to minimize.
[2024-05-30 11:02:54] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 2 ms to minimize.
[2024-05-30 11:02:54] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 3 ms to minimize.
[2024-05-30 11:02:54] [INFO ] Deduced a trap composed of 78 places in 112 ms of which 2 ms to minimize.
[2024-05-30 11:02:54] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 3 ms to minimize.
[2024-05-30 11:02:54] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 3 ms to minimize.
[2024-05-30 11:02:55] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 1 ms to minimize.
[2024-05-30 11:02:55] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 1 ms to minimize.
[2024-05-30 11:02:55] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 20/360 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:02:56] [INFO ] Deduced a trap composed of 14 places in 189 ms of which 3 ms to minimize.
[2024-05-30 11:02:56] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 3 ms to minimize.
[2024-05-30 11:02:57] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 3 ms to minimize.
[2024-05-30 11:02:57] [INFO ] Deduced a trap composed of 7 places in 191 ms of which 3 ms to minimize.
[2024-05-30 11:02:57] [INFO ] Deduced a trap composed of 8 places in 194 ms of which 2 ms to minimize.
[2024-05-30 11:02:58] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 2 ms to minimize.
[2024-05-30 11:02:58] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 2 ms to minimize.
[2024-05-30 11:02:58] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 3 ms to minimize.
[2024-05-30 11:02:58] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 3 ms to minimize.
[2024-05-30 11:02:58] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 3 ms to minimize.
[2024-05-30 11:02:59] [INFO ] Deduced a trap composed of 16 places in 202 ms of which 2 ms to minimize.
[2024-05-30 11:02:59] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-05-30 11:02:59] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 3 ms to minimize.
[2024-05-30 11:02:59] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 2 ms to minimize.
SMT process timed out in 60366ms, After SMT, problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 60377ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61581 ms. Remains : 703/703 places, 952/952 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 166 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 42 ms :[(NOT p0)]
RANDOM walk for 2504 steps (0 resets) in 18 ms. (131 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 98 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 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2024-05-30 11:03:00] [INFO ] Invariant cache hit.
[2024-05-30 11:03:00] [INFO ] [Real]Absence check using 201 positive place invariants in 59 ms returned sat
[2024-05-30 11:03:01] [INFO ] [Real]Absence check using state equation in 824 ms returned sat
[2024-05-30 11:03:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 11:03:01] [INFO ] [Nat]Absence check using 201 positive place invariants in 58 ms returned sat
[2024-05-30 11:03:02] [INFO ] [Nat]Absence check using state equation in 726 ms returned sat
[2024-05-30 11:03:02] [INFO ] Computed and/alt/rep : 853/3685/853 causal constraints (skipped 97 transitions) in 53 ms.
[2024-05-30 11:03:16] [INFO ] Added : 680 causal constraints over 136 iterations in 13777 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 164 reset in 481 ms.
Product exploration explored 100000 steps with 163 reset in 587 ms.
Support contains 2 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 952/952 transitions.
Applied a total of 0 rules in 15 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
[2024-05-30 11:03:17] [INFO ] Invariant cache hit.
[2024-05-30 11:03:17] [INFO ] Implicit Places using invariants in 287 ms returned []
[2024-05-30 11:03:17] [INFO ] Invariant cache hit.
[2024-05-30 11:03:18] [INFO ] Implicit Places using invariants and state equation in 699 ms returned []
Implicit Place search using SMT with State Equation took 1005 ms to find 0 implicit places.
[2024-05-30 11:03:18] [INFO ] Redundant transitions in 155 ms returned []
Running 950 sub problems to find dead transitions.
[2024-05-30 11:03:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:03:28] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2024-05-30 11:03:29] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
[2024-05-30 11:03:29] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2024-05-30 11:03:29] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2024-05-30 11:03:29] [INFO ] Deduced a trap composed of 106 places in 80 ms of which 1 ms to minimize.
[2024-05-30 11:03:29] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:03:29] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 1 ms to minimize.
[2024-05-30 11:03:30] [INFO ] Deduced a trap composed of 12 places in 192 ms of which 2 ms to minimize.
[2024-05-30 11:03:30] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 3 ms to minimize.
[2024-05-30 11:03:30] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 2 ms to minimize.
[2024-05-30 11:03:30] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 3 ms to minimize.
[2024-05-30 11:03:30] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 2 ms to minimize.
[2024-05-30 11:03:31] [INFO ] Deduced a trap composed of 12 places in 198 ms of which 3 ms to minimize.
[2024-05-30 11:03:31] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 3 ms to minimize.
[2024-05-30 11:03:31] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 2 ms to minimize.
[2024-05-30 11:03:31] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 2 ms to minimize.
[2024-05-30 11:03:31] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2024-05-30 11:03:31] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-05-30 11:03:32] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 2 ms to minimize.
[2024-05-30 11:03:32] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:03:32] [INFO ] Deduced a trap composed of 111 places in 83 ms of which 1 ms to minimize.
[2024-05-30 11:03:32] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-30 11:03:32] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2024-05-30 11:03:33] [INFO ] Deduced a trap composed of 111 places in 87 ms of which 1 ms to minimize.
[2024-05-30 11:03:33] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2024-05-30 11:03:33] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-05-30 11:03:33] [INFO ] Deduced a trap composed of 109 places in 188 ms of which 2 ms to minimize.
[2024-05-30 11:03:33] [INFO ] Deduced a trap composed of 106 places in 183 ms of which 2 ms to minimize.
[2024-05-30 11:03:33] [INFO ] Deduced a trap composed of 15 places in 194 ms of which 3 ms to minimize.
[2024-05-30 11:03:34] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-30 11:03:34] [INFO ] Deduced a trap composed of 6 places in 197 ms of which 2 ms to minimize.
[2024-05-30 11:03:34] [INFO ] Deduced a trap composed of 110 places in 176 ms of which 2 ms to minimize.
[2024-05-30 11:03:34] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 3 ms to minimize.
[2024-05-30 11:03:35] [INFO ] Deduced a trap composed of 16 places in 202 ms of which 2 ms to minimize.
[2024-05-30 11:03:35] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 2 ms to minimize.
[2024-05-30 11:03:35] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 2 ms to minimize.
[2024-05-30 11:03:35] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2024-05-30 11:03:35] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 2 ms to minimize.
[2024-05-30 11:03:36] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 3 ms to minimize.
[2024-05-30 11:03:36] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/702 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:03:36] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-30 11:03:36] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
[2024-05-30 11:03:36] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2024-05-30 11:03:37] [INFO ] Deduced a trap composed of 15 places in 214 ms of which 3 ms to minimize.
[2024-05-30 11:03:37] [INFO ] Deduced a trap composed of 106 places in 75 ms of which 1 ms to minimize.
[2024-05-30 11:03:37] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 1 ms to minimize.
[2024-05-30 11:03:37] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2024-05-30 11:03:37] [INFO ] Deduced a trap composed of 12 places in 195 ms of which 2 ms to minimize.
[2024-05-30 11:03:38] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 3 ms to minimize.
[2024-05-30 11:03:38] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 3 ms to minimize.
[2024-05-30 11:03:38] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 2 ms to minimize.
[2024-05-30 11:03:38] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 2 ms to minimize.
[2024-05-30 11:03:38] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 2 ms to minimize.
[2024-05-30 11:03:38] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 2 ms to minimize.
[2024-05-30 11:03:39] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 2 ms to minimize.
[2024-05-30 11:03:39] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 3 ms to minimize.
[2024-05-30 11:03:39] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 1 ms to minimize.
[2024-05-30 11:03:39] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2024-05-30 11:03:39] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2024-05-30 11:03:39] [INFO ] Deduced a trap composed of 22 places in 179 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 950 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 702/1655 variables, and 260 constraints, problems are : Problem set: 0 solved, 950 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 200/201 constraints, State Equation: 0/703 constraints, PredecessorRefiner: 950/950 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 950 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 60/260 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:03:50] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 2 ms to minimize.
[2024-05-30 11:03:50] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 2 ms to minimize.
[2024-05-30 11:03:50] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 2 ms to minimize.
[2024-05-30 11:03:51] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 1 ms to minimize.
[2024-05-30 11:03:51] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 2 ms to minimize.
[2024-05-30 11:03:51] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
[2024-05-30 11:03:51] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 3 ms to minimize.
[2024-05-30 11:03:51] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 3 ms to minimize.
[2024-05-30 11:03:51] [INFO ] Deduced a trap composed of 12 places in 200 ms of which 3 ms to minimize.
[2024-05-30 11:03:52] [INFO ] Deduced a trap composed of 16 places in 212 ms of which 3 ms to minimize.
[2024-05-30 11:03:52] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 3 ms to minimize.
[2024-05-30 11:03:52] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 2 ms to minimize.
[2024-05-30 11:03:52] [INFO ] Deduced a trap composed of 94 places in 173 ms of which 3 ms to minimize.
[2024-05-30 11:03:52] [INFO ] Deduced a trap composed of 93 places in 182 ms of which 2 ms to minimize.
[2024-05-30 11:03:53] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 3 ms to minimize.
[2024-05-30 11:03:53] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 3 ms to minimize.
[2024-05-30 11:03:53] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 3 ms to minimize.
[2024-05-30 11:03:53] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 2 ms to minimize.
[2024-05-30 11:03:53] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 2 ms to minimize.
[2024-05-30 11:03:54] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/702 variables, 20/280 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:03:54] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:03:54] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 2 ms to minimize.
[2024-05-30 11:03:55] [INFO ] Deduced a trap composed of 15 places in 207 ms of which 2 ms to minimize.
[2024-05-30 11:03:55] [INFO ] Deduced a trap composed of 16 places in 176 ms of which 2 ms to minimize.
[2024-05-30 11:03:55] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 2 ms to minimize.
[2024-05-30 11:03:55] [INFO ] Deduced a trap composed of 20 places in 179 ms of which 3 ms to minimize.
[2024-05-30 11:03:55] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 2 ms to minimize.
[2024-05-30 11:03:56] [INFO ] Deduced a trap composed of 12 places in 181 ms of which 2 ms to minimize.
[2024-05-30 11:03:56] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-30 11:03:56] [INFO ] Deduced a trap composed of 13 places in 180 ms of which 2 ms to minimize.
[2024-05-30 11:03:57] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 2 ms to minimize.
[2024-05-30 11:03:57] [INFO ] Deduced a trap composed of 18 places in 200 ms of which 3 ms to minimize.
[2024-05-30 11:03:57] [INFO ] Deduced a trap composed of 12 places in 181 ms of which 2 ms to minimize.
[2024-05-30 11:03:57] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 2 ms to minimize.
[2024-05-30 11:03:58] [INFO ] Deduced a trap composed of 89 places in 193 ms of which 3 ms to minimize.
[2024-05-30 11:03:58] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 3 ms to minimize.
[2024-05-30 11:03:58] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 2 ms to minimize.
[2024-05-30 11:03:58] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 2 ms to minimize.
[2024-05-30 11:03:58] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 3 ms to minimize.
[2024-05-30 11:03:59] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 20/300 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:03:59] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 2 ms to minimize.
[2024-05-30 11:04:00] [INFO ] Deduced a trap composed of 20 places in 185 ms of which 3 ms to minimize.
[2024-05-30 11:04:00] [INFO ] Deduced a trap composed of 18 places in 179 ms of which 3 ms to minimize.
[2024-05-30 11:04:00] [INFO ] Deduced a trap composed of 18 places in 191 ms of which 3 ms to minimize.
[2024-05-30 11:04:00] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 3 ms to minimize.
[2024-05-30 11:04:00] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 2 ms to minimize.
[2024-05-30 11:04:01] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 3 ms to minimize.
[2024-05-30 11:04:01] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2024-05-30 11:04:01] [INFO ] Deduced a trap composed of 12 places in 208 ms of which 3 ms to minimize.
[2024-05-30 11:04:01] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 3 ms to minimize.
[2024-05-30 11:04:01] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 3 ms to minimize.
[2024-05-30 11:04:02] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 2 ms to minimize.
[2024-05-30 11:04:02] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 2 ms to minimize.
[2024-05-30 11:04:02] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 2 ms to minimize.
[2024-05-30 11:04:02] [INFO ] Deduced a trap composed of 7 places in 187 ms of which 3 ms to minimize.
[2024-05-30 11:04:03] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 2 ms to minimize.
[2024-05-30 11:04:03] [INFO ] Deduced a trap composed of 11 places in 193 ms of which 2 ms to minimize.
[2024-05-30 11:04:03] [INFO ] Deduced a trap composed of 16 places in 192 ms of which 3 ms to minimize.
[2024-05-30 11:04:03] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 3 ms to minimize.
[2024-05-30 11:04:04] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/702 variables, 20/320 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:04:04] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 2 ms to minimize.
[2024-05-30 11:04:05] [INFO ] Deduced a trap composed of 12 places in 200 ms of which 3 ms to minimize.
[2024-05-30 11:04:06] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 2 ms to minimize.
[2024-05-30 11:04:06] [INFO ] Deduced a trap composed of 95 places in 179 ms of which 2 ms to minimize.
[2024-05-30 11:04:06] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 3 ms to minimize.
[2024-05-30 11:04:06] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 3 ms to minimize.
[2024-05-30 11:04:06] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 2 ms to minimize.
[2024-05-30 11:04:07] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 3 ms to minimize.
[2024-05-30 11:04:07] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 3 ms to minimize.
[2024-05-30 11:04:07] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 3 ms to minimize.
[2024-05-30 11:04:07] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 3 ms to minimize.
[2024-05-30 11:04:07] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 3 ms to minimize.
[2024-05-30 11:04:08] [INFO ] Deduced a trap composed of 18 places in 174 ms of which 3 ms to minimize.
[2024-05-30 11:04:08] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 2 ms to minimize.
[2024-05-30 11:04:08] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 3 ms to minimize.
[2024-05-30 11:04:08] [INFO ] Deduced a trap composed of 88 places in 168 ms of which 3 ms to minimize.
[2024-05-30 11:04:08] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 3 ms to minimize.
[2024-05-30 11:04:09] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 3 ms to minimize.
[2024-05-30 11:04:09] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 3 ms to minimize.
[2024-05-30 11:04:09] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/702 variables, 20/340 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:04:10] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 2 ms to minimize.
[2024-05-30 11:04:10] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-30 11:04:10] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 3 ms to minimize.
[2024-05-30 11:04:10] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 3 ms to minimize.
[2024-05-30 11:04:11] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 2 ms to minimize.
[2024-05-30 11:04:11] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 3 ms to minimize.
[2024-05-30 11:04:11] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 3 ms to minimize.
[2024-05-30 11:04:12] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 3 ms to minimize.
[2024-05-30 11:04:12] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 3 ms to minimize.
[2024-05-30 11:04:12] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 2 ms to minimize.
[2024-05-30 11:04:12] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 3 ms to minimize.
[2024-05-30 11:04:12] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 2 ms to minimize.
[2024-05-30 11:04:13] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 2 ms to minimize.
[2024-05-30 11:04:13] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 2 ms to minimize.
[2024-05-30 11:04:13] [INFO ] Deduced a trap composed of 78 places in 113 ms of which 2 ms to minimize.
[2024-05-30 11:04:13] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 3 ms to minimize.
[2024-05-30 11:04:13] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 3 ms to minimize.
[2024-05-30 11:04:14] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 2 ms to minimize.
[2024-05-30 11:04:14] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 2 ms to minimize.
[2024-05-30 11:04:14] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 20/360 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:04:15] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 3 ms to minimize.
[2024-05-30 11:04:15] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 2 ms to minimize.
[2024-05-30 11:04:16] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 3 ms to minimize.
[2024-05-30 11:04:16] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 4 ms to minimize.
[2024-05-30 11:04:16] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 3 ms to minimize.
[2024-05-30 11:04:17] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 1 ms to minimize.
[2024-05-30 11:04:17] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 2 ms to minimize.
[2024-05-30 11:04:17] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 3 ms to minimize.
[2024-05-30 11:04:17] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 3 ms to minimize.
[2024-05-30 11:04:17] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 2 ms to minimize.
[2024-05-30 11:04:17] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 3 ms to minimize.
[2024-05-30 11:04:18] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-30 11:04:18] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 3 ms to minimize.
[2024-05-30 11:04:18] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 2 ms to minimize.
[2024-05-30 11:04:18] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 3 ms to minimize.
[2024-05-30 11:04:19] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 3 ms to minimize.
[2024-05-30 11:04:19] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 2 ms to minimize.
SMT process timed out in 60454ms, After SMT, problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 60463ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61675 ms. Remains : 703/703 places, 952/952 transitions.
Treatment of property ShieldRVs-PT-050B-LTLFireability-07 finished in 220975 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U p1)||X((p0&&G(p1))))))'
Support contains 4 out of 1656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1656/1656 places, 1906/1906 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1652 transition count 1902
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1652 transition count 1902
Applied a total of 8 rules in 76 ms. Remains 1652 /1656 variables (removed 4) and now considering 1902/1906 (removed 4) transitions.
// Phase 1: matrix 1902 rows 1652 cols
[2024-05-30 11:04:19] [INFO ] Computed 201 invariants in 13 ms
[2024-05-30 11:04:19] [INFO ] Implicit Places using invariants in 445 ms returned []
[2024-05-30 11:04:19] [INFO ] Invariant cache hit.
[2024-05-30 11:04:21] [INFO ] Implicit Places using invariants and state equation in 1715 ms returned []
Implicit Place search using SMT with State Equation took 2160 ms to find 0 implicit places.
Running 1901 sub problems to find dead transitions.
[2024-05-30 11:04:21] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1651/3554 variables, and 0 constraints, problems are : Problem set: 0 solved, 1901 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1652 constraints, PredecessorRefiner: 1901/1901 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1901 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1651/3554 variables, and 0 constraints, problems are : Problem set: 0 solved, 1901 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1652 constraints, PredecessorRefiner: 0/1901 constraints, Known Traps: 0/0 constraints]
After SMT, in 60620ms problems are : Problem set: 0 solved, 1901 unsolved
Search for dead transitions found 0 dead transitions in 60637ms
Starting structural reductions in LTL mode, iteration 1 : 1652/1656 places, 1902/1906 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62878 ms. Remains : 1652/1656 places, 1902/1906 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), true, (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-09 finished in 63062 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 U (p1||G(!p0))))))'
Support contains 3 out of 1656 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1656/1656 places, 1906/1906 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 1655 transition count 1705
Reduce places removed 200 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 201 rules applied. Total rules applied 401 place count 1455 transition count 1704
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 402 place count 1454 transition count 1704
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 248 Pre rules applied. Total rules applied 402 place count 1454 transition count 1456
Deduced a syphon composed of 248 places in 3 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 3 with 496 rules applied. Total rules applied 898 place count 1206 transition count 1456
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 901 place count 1203 transition count 1453
Iterating global reduction 3 with 3 rules applied. Total rules applied 904 place count 1203 transition count 1453
Performed 496 Post agglomeration using F-continuation condition.Transition count delta: 496
Deduced a syphon composed of 496 places in 2 ms
Reduce places removed 496 places and 0 transitions.
Iterating global reduction 3 with 992 rules applied. Total rules applied 1896 place count 707 transition count 957
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1898 place count 705 transition count 955
Applied a total of 1898 rules in 220 ms. Remains 705 /1656 variables (removed 951) and now considering 955/1906 (removed 951) transitions.
// Phase 1: matrix 955 rows 705 cols
[2024-05-30 11:05:22] [INFO ] Computed 201 invariants in 3 ms
[2024-05-30 11:05:22] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-30 11:05:22] [INFO ] Invariant cache hit.
[2024-05-30 11:05:23] [INFO ] Implicit Places using invariants and state equation in 700 ms returned []
Implicit Place search using SMT with State Equation took 998 ms to find 0 implicit places.
[2024-05-30 11:05:23] [INFO ] Redundant transitions in 152 ms returned [954]
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 951 sub problems to find dead transitions.
// Phase 1: matrix 954 rows 705 cols
[2024-05-30 11:05:23] [INFO ] Computed 201 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/703 variables, 197/197 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2024-05-30 11:05:34] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 1 ms to minimize.
[2024-05-30 11:05:34] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-05-30 11:05:34] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-30 11:05:34] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2024-05-30 11:05:34] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 1 ms to minimize.
[2024-05-30 11:05:34] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-05-30 11:05:34] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 0 ms to minimize.
[2024-05-30 11:05:34] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:05:34] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:05:34] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:05:35] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:05:35] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:05:35] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 2 ms to minimize.
[2024-05-30 11:05:35] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2024-05-30 11:05:35] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-30 11:05:35] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 2 ms to minimize.
[2024-05-30 11:05:35] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-05-30 11:05:35] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-30 11:05:35] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-30 11:05:35] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/703 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2024-05-30 11:05:36] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-30 11:05:36] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-30 11:05:36] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-30 11:05:36] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2024-05-30 11:05:36] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-30 11:05:36] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-30 11:05:36] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:05:36] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-30 11:05:36] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2024-05-30 11:05:37] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:05:37] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:05:37] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-05-30 11:05:37] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
[2024-05-30 11:05:37] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-05-30 11:05:37] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:05:37] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 1 ms to minimize.
[2024-05-30 11:05:37] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2024-05-30 11:05:37] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2024-05-30 11:05:38] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:05:38] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/703 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2024-05-30 11:05:38] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-30 11:05:38] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-30 11:05:38] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-30 11:05:38] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:05:38] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:05:39] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:05:39] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-30 11:05:39] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-30 11:05:39] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2024-05-30 11:05:39] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 1 ms to minimize.
[2024-05-30 11:05:39] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 1 ms to minimize.
[2024-05-30 11:05:39] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-05-30 11:05:39] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:05:40] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 1 ms to minimize.
[2024-05-30 11:05:40] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:05:40] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 2 ms to minimize.
[2024-05-30 11:05:40] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 2 ms to minimize.
[2024-05-30 11:05:40] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
[2024-05-30 11:05:40] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:05:40] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 20/257 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2024-05-30 11:05:50] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2024-05-30 11:05:50] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 1 ms to minimize.
[2024-05-30 11:05:50] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:05:50] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-30 11:05:51] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:05:51] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-30 11:05:51] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-05-30 11:05:51] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-05-30 11:05:51] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-30 11:05:51] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-30 11:05:51] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-05-30 11:05:51] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-30 11:05:51] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-30 11:05:51] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-30 11:05:51] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-30 11:05:52] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-30 11:05:52] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2024-05-30 11:05:52] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 2 ms to minimize.
[2024-05-30 11:05:52] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 2 ms to minimize.
[2024-05-30 11:05:52] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/703 variables, 20/277 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2024-05-30 11:05:53] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-30 11:05:53] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-30 11:05:53] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-05-30 11:05:53] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2024-05-30 11:05:53] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-05-30 11:05:53] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 2 ms to minimize.
[2024-05-30 11:05:53] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 2 ms to minimize.
[2024-05-30 11:05:54] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 703/1659 variables, and 285 constraints, problems are : Problem set: 0 solved, 951 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 197/201 constraints, State Equation: 0/705 constraints, PredecessorRefiner: 951/951 constraints, Known Traps: 88/88 constraints]
Escalating to Integer solving :Problem set: 0 solved, 951 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/703 variables, 197/197 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/703 variables, 88/285 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2024-05-30 11:05:54] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-05-30 11:05:55] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:05:55] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-05-30 11:05:55] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-05-30 11:05:55] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-30 11:05:55] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
[2024-05-30 11:05:55] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-05-30 11:05:55] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-30 11:05:56] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2024-05-30 11:05:56] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-30 11:05:56] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 3 ms to minimize.
[2024-05-30 11:05:56] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 3 ms to minimize.
[2024-05-30 11:05:56] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2024-05-30 11:05:56] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 3 ms to minimize.
[2024-05-30 11:05:57] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 2 ms to minimize.
[2024-05-30 11:05:57] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 3 ms to minimize.
[2024-05-30 11:05:57] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 3 ms to minimize.
[2024-05-30 11:05:57] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 2 ms to minimize.
[2024-05-30 11:05:57] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 3 ms to minimize.
[2024-05-30 11:05:58] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/703 variables, 20/305 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2024-05-30 11:05:58] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-05-30 11:05:58] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-30 11:05:58] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:05:59] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-30 11:05:59] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2024-05-30 11:05:59] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 2 ms to minimize.
[2024-05-30 11:05:59] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 2 ms to minimize.
[2024-05-30 11:06:00] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 2 ms to minimize.
[2024-05-30 11:06:00] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 2 ms to minimize.
[2024-05-30 11:06:00] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 2 ms to minimize.
[2024-05-30 11:06:00] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 2 ms to minimize.
[2024-05-30 11:06:00] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 2 ms to minimize.
[2024-05-30 11:06:00] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 2 ms to minimize.
[2024-05-30 11:06:00] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 2 ms to minimize.
[2024-05-30 11:06:01] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 2 ms to minimize.
[2024-05-30 11:06:01] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 2 ms to minimize.
[2024-05-30 11:06:01] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 2 ms to minimize.
[2024-05-30 11:06:01] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 2 ms to minimize.
[2024-05-30 11:06:01] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 2 ms to minimize.
[2024-05-30 11:06:02] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 20/325 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2024-05-30 11:06:03] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 2 ms to minimize.
[2024-05-30 11:06:03] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 3 ms to minimize.
[2024-05-30 11:06:03] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 4 ms to minimize.
[2024-05-30 11:06:03] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 2 ms to minimize.
[2024-05-30 11:06:03] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 2 ms to minimize.
[2024-05-30 11:06:03] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 3 ms to minimize.
[2024-05-30 11:06:04] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 3 ms to minimize.
[2024-05-30 11:06:04] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 2 ms to minimize.
[2024-05-30 11:06:04] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 2 ms to minimize.
[2024-05-30 11:06:04] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 3 ms to minimize.
[2024-05-30 11:06:05] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 3 ms to minimize.
[2024-05-30 11:06:05] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 2 ms to minimize.
[2024-05-30 11:06:05] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 2 ms to minimize.
[2024-05-30 11:06:05] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 1 ms to minimize.
[2024-05-30 11:06:05] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-30 11:06:05] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 2 ms to minimize.
[2024-05-30 11:06:06] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 2 ms to minimize.
[2024-05-30 11:06:06] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-30 11:06:06] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 2 ms to minimize.
[2024-05-30 11:06:06] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/703 variables, 20/345 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2024-05-30 11:06:06] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 1 ms to minimize.
[2024-05-30 11:06:06] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:06:07] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 2 ms to minimize.
[2024-05-30 11:06:08] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 2 ms to minimize.
[2024-05-30 11:06:08] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 2 ms to minimize.
[2024-05-30 11:06:08] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 3 ms to minimize.
[2024-05-30 11:06:08] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 2 ms to minimize.
[2024-05-30 11:06:08] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 1 ms to minimize.
[2024-05-30 11:06:09] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 3 ms to minimize.
[2024-05-30 11:06:09] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 3 ms to minimize.
[2024-05-30 11:06:09] [INFO ] Deduced a trap composed of 16 places in 180 ms of which 4 ms to minimize.
[2024-05-30 11:06:09] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 3 ms to minimize.
[2024-05-30 11:06:09] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 3 ms to minimize.
[2024-05-30 11:06:09] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 3 ms to minimize.
[2024-05-30 11:06:10] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 2 ms to minimize.
[2024-05-30 11:06:10] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 2 ms to minimize.
[2024-05-30 11:06:10] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 3 ms to minimize.
[2024-05-30 11:06:10] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 2 ms to minimize.
[2024-05-30 11:06:10] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 2 ms to minimize.
[2024-05-30 11:06:10] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/703 variables, 20/365 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2024-05-30 11:06:11] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:06:11] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-30 11:06:11] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:06:12] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-30 11:06:12] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-30 11:06:12] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:06:12] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 2 ms to minimize.
[2024-05-30 11:06:13] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 2 ms to minimize.
[2024-05-30 11:06:13] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
[2024-05-30 11:06:13] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 2 ms to minimize.
[2024-05-30 11:06:13] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 3 ms to minimize.
[2024-05-30 11:06:13] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 3 ms to minimize.
[2024-05-30 11:06:14] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 2 ms to minimize.
[2024-05-30 11:06:14] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 1 ms to minimize.
[2024-05-30 11:06:14] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2024-05-30 11:06:14] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-05-30 11:06:14] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 2 ms to minimize.
[2024-05-30 11:06:14] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 2 ms to minimize.
[2024-05-30 11:06:14] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-30 11:06:14] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/703 variables, 20/385 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2024-05-30 11:06:15] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:06:16] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 2 ms to minimize.
[2024-05-30 11:06:16] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 2 ms to minimize.
[2024-05-30 11:06:16] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 3 ms to minimize.
[2024-05-30 11:06:16] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:06:16] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 3 ms to minimize.
[2024-05-30 11:06:17] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 2 ms to minimize.
[2024-05-30 11:06:17] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-30 11:06:17] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 2 ms to minimize.
[2024-05-30 11:06:17] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 2 ms to minimize.
[2024-05-30 11:06:17] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 2 ms to minimize.
[2024-05-30 11:06:17] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 2 ms to minimize.
[2024-05-30 11:06:18] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 3 ms to minimize.
[2024-05-30 11:06:18] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 2 ms to minimize.
[2024-05-30 11:06:18] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 1 ms to minimize.
[2024-05-30 11:06:18] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 3 ms to minimize.
[2024-05-30 11:06:18] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 2 ms to minimize.
[2024-05-30 11:06:19] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 3 ms to minimize.
[2024-05-30 11:06:19] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 1 ms to minimize.
[2024-05-30 11:06:19] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/703 variables, 20/405 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2024-05-30 11:06:21] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 2 ms to minimize.
[2024-05-30 11:06:21] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 3 ms to minimize.
[2024-05-30 11:06:21] [INFO ] Deduced a trap composed of 12 places in 194 ms of which 3 ms to minimize.
[2024-05-30 11:06:21] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 3 ms to minimize.
[2024-05-30 11:06:21] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 2 ms to minimize.
[2024-05-30 11:06:22] [INFO ] Deduced a trap composed of 8 places in 194 ms of which 3 ms to minimize.
[2024-05-30 11:06:22] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 1 ms to minimize.
[2024-05-30 11:06:22] [INFO ] Deduced a trap composed of 7 places in 197 ms of which 4 ms to minimize.
[2024-05-30 11:06:22] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 1 ms to minimize.
[2024-05-30 11:06:23] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 3 ms to minimize.
[2024-05-30 11:06:23] [INFO ] Deduced a trap composed of 15 places in 193 ms of which 2 ms to minimize.
[2024-05-30 11:06:23] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 3 ms to minimize.
[2024-05-30 11:06:23] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 3 ms to minimize.
[2024-05-30 11:06:23] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 1 ms to minimize.
[2024-05-30 11:06:23] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 2 ms to minimize.
[2024-05-30 11:06:24] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 3 ms to minimize.
SMT process timed out in 60401ms, After SMT, problems are : Problem set: 0 solved, 951 unsolved
Search for dead transitions found 0 dead transitions in 60409ms
Starting structural reductions in SI_LTL mode, iteration 1 : 705/1656 places, 954/1906 transitions.
Applied a total of 0 rules in 16 ms. Remains 705 /705 variables (removed 0) and now considering 954/954 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61816 ms. Remains : 705/1656 places, 954/1906 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-11
Product exploration explored 100000 steps with 181 reset in 491 ms.
Product exploration explored 100000 steps with 183 reset in 591 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 238 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 65 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
RANDOM walk for 2145 steps (0 resets) in 17 ms. (119 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p1 (NOT p0)))), (F p0), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 5 factoid took 368 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 58 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 3 out of 705 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 705/705 places, 954/954 transitions.
Applied a total of 0 rules in 16 ms. Remains 705 /705 variables (removed 0) and now considering 954/954 (removed 0) transitions.
[2024-05-30 11:06:26] [INFO ] Invariant cache hit.
[2024-05-30 11:06:26] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-05-30 11:06:26] [INFO ] Invariant cache hit.
[2024-05-30 11:06:27] [INFO ] Implicit Places using invariants and state equation in 657 ms returned []
Implicit Place search using SMT with State Equation took 968 ms to find 0 implicit places.
[2024-05-30 11:06:27] [INFO ] Redundant transitions in 153 ms returned []
Running 951 sub problems to find dead transitions.
[2024-05-30 11:06:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/703 variables, 197/197 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2024-05-30 11:06:37] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2024-05-30 11:06:37] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-30 11:06:37] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2024-05-30 11:06:37] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 2 ms to minimize.
[2024-05-30 11:06:37] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:06:37] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-30 11:06:37] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-30 11:06:38] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:06:38] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:06:38] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:06:38] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:06:38] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-30 11:06:38] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-30 11:06:38] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 2 ms to minimize.
[2024-05-30 11:06:38] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-30 11:06:38] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-30 11:06:39] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:06:39] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-30 11:06:39] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-05-30 11:06:39] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/703 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2024-05-30 11:06:39] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:06:39] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:06:39] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-05-30 11:06:39] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:06:39] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-30 11:06:40] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-30 11:06:40] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:06:40] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-30 11:06:40] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-05-30 11:06:40] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:06:40] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-30 11:06:40] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-05-30 11:06:40] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
[2024-05-30 11:06:40] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:06:41] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
[2024-05-30 11:06:41] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:06:41] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:06:41] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
[2024-05-30 11:06:41] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-30 11:06:41] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/703 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2024-05-30 11:06:41] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:06:42] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-30 11:06:42] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-30 11:06:42] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-30 11:06:42] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-05-30 11:06:42] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-05-30 11:06:42] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-30 11:06:42] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-05-30 11:06:42] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-05-30 11:06:42] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:06:43] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:06:43] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:06:43] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2024-05-30 11:06:43] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-05-30 11:06:43] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
[2024-05-30 11:06:43] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2024-05-30 11:06:43] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2024-05-30 11:06:43] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-05-30 11:06:43] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 2 ms to minimize.
[2024-05-30 11:06:43] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 20/257 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2024-05-30 11:06:54] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-05-30 11:06:54] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2024-05-30 11:06:54] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-30 11:06:54] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2024-05-30 11:06:54] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-05-30 11:06:54] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:06:54] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-05-30 11:06:55] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-30 11:06:55] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-05-30 11:06:55] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-30 11:06:55] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-05-30 11:06:55] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-30 11:06:55] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-30 11:06:55] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-30 11:06:55] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-30 11:06:55] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-30 11:06:55] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 0 ms to minimize.
[2024-05-30 11:06:56] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 3 ms to minimize.
[2024-05-30 11:06:56] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 2 ms to minimize.
[2024-05-30 11:06:56] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/703 variables, 20/277 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2024-05-30 11:06:56] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:06:56] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-30 11:06:57] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-05-30 11:06:57] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
[2024-05-30 11:06:57] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2024-05-30 11:06:57] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2024-05-30 11:06:57] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
SMT process timed out in 30328ms, After SMT, problems are : Problem set: 0 solved, 951 unsolved
Search for dead transitions found 0 dead transitions in 30336ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31491 ms. Remains : 705/705 places, 954/954 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 230 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 80 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
RANDOM walk for 2126 steps (0 resets) in 26 ms. (78 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p1 (NOT p0)))), (F p0), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 5 factoid took 450 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 90 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 183 reset in 494 ms.
Product exploration explored 100000 steps with 181 reset in 604 ms.
Support contains 3 out of 705 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 705/705 places, 954/954 transitions.
Applied a total of 0 rules in 16 ms. Remains 705 /705 variables (removed 0) and now considering 954/954 (removed 0) transitions.
[2024-05-30 11:06:59] [INFO ] Invariant cache hit.
[2024-05-30 11:07:00] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-30 11:07:00] [INFO ] Invariant cache hit.
[2024-05-30 11:07:00] [INFO ] Implicit Places using invariants and state equation in 717 ms returned []
Implicit Place search using SMT with State Equation took 998 ms to find 0 implicit places.
[2024-05-30 11:07:01] [INFO ] Redundant transitions in 164 ms returned []
Running 951 sub problems to find dead transitions.
[2024-05-30 11:07:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/703 variables, 197/197 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2024-05-30 11:07:11] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:07:11] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-05-30 11:07:11] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2024-05-30 11:07:11] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:07:11] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-05-30 11:07:11] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:07:11] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 0 ms to minimize.
[2024-05-30 11:07:11] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:07:12] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-30 11:07:12] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:07:12] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:07:12] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-05-30 11:07:12] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-30 11:07:12] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-05-30 11:07:12] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:07:12] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 2 ms to minimize.
[2024-05-30 11:07:12] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-30 11:07:12] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-30 11:07:13] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
[2024-05-30 11:07:13] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/703 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2024-05-30 11:07:13] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-05-30 11:07:13] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-05-30 11:07:13] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:07:13] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:07:13] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-30 11:07:13] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:07:14] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-30 11:07:14] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-30 11:07:14] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-05-30 11:07:14] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-30 11:07:14] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:07:14] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:07:14] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-05-30 11:07:14] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:07:14] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:07:14] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:07:15] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:07:15] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:07:15] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-30 11:07:15] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/703 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2024-05-30 11:07:15] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:07:15] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:07:15] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-05-30 11:07:16] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:07:16] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:07:16] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-30 11:07:16] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-30 11:07:16] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:07:16] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:07:16] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 1 ms to minimize.
[2024-05-30 11:07:16] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 1 ms to minimize.
[2024-05-30 11:07:17] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-30 11:07:17] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
[2024-05-30 11:07:17] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-05-30 11:07:17] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-05-30 11:07:17] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2024-05-30 11:07:17] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:07:17] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
[2024-05-30 11:07:17] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-05-30 11:07:17] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 20/257 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2024-05-30 11:07:27] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-05-30 11:07:27] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-05-30 11:07:28] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-30 11:07:28] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:07:28] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-30 11:07:28] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-05-30 11:07:28] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-30 11:07:28] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-30 11:07:28] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-30 11:07:29] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 0 ms to minimize.
[2024-05-30 11:07:29] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2024-05-30 11:07:29] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-30 11:07:29] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-30 11:07:29] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-30 11:07:29] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-30 11:07:29] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-30 11:07:29] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 0 ms to minimize.
[2024-05-30 11:07:29] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 2 ms to minimize.
[2024-05-30 11:07:29] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 2 ms to minimize.
[2024-05-30 11:07:30] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/703 variables, 20/277 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2024-05-30 11:07:30] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:07:30] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-30 11:07:30] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2024-05-30 11:07:31] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 0 ms to minimize.
[2024-05-30 11:07:31] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2024-05-30 11:07:31] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
SMT process timed out in 30281ms, After SMT, problems are : Problem set: 0 solved, 951 unsolved
Search for dead transitions found 0 dead transitions in 30290ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31478 ms. Remains : 705/705 places, 954/954 transitions.
Treatment of property ShieldRVs-PT-050B-LTLFireability-11 finished in 129009 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(p2))))'
Support contains 4 out of 1656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1656/1656 places, 1906/1906 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1652 transition count 1902
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1652 transition count 1902
Applied a total of 8 rules in 82 ms. Remains 1652 /1656 variables (removed 4) and now considering 1902/1906 (removed 4) transitions.
// Phase 1: matrix 1902 rows 1652 cols
[2024-05-30 11:07:31] [INFO ] Computed 201 invariants in 12 ms
[2024-05-30 11:07:31] [INFO ] Implicit Places using invariants in 474 ms returned []
[2024-05-30 11:07:31] [INFO ] Invariant cache hit.
[2024-05-30 11:07:33] [INFO ] Implicit Places using invariants and state equation in 1732 ms returned []
Implicit Place search using SMT with State Equation took 2207 ms to find 0 implicit places.
Running 1901 sub problems to find dead transitions.
[2024-05-30 11:07:33] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1651/3554 variables, and 0 constraints, problems are : Problem set: 0 solved, 1901 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1652 constraints, PredecessorRefiner: 1901/1901 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1901 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1651/3554 variables, and 0 constraints, problems are : Problem set: 0 solved, 1901 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1652 constraints, PredecessorRefiner: 0/1901 constraints, Known Traps: 0/0 constraints]
After SMT, in 60603ms problems are : Problem set: 0 solved, 1901 unsolved
Search for dead transitions found 0 dead transitions in 60622ms
Starting structural reductions in LTL mode, iteration 1 : 1652/1656 places, 1902/1906 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62917 ms. Remains : 1652/1656 places, 1902/1906 transitions.
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p2) (NOT p0)), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-12 finished in 63248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 1656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1656/1656 places, 1906/1906 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1652 transition count 1902
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1652 transition count 1902
Applied a total of 8 rules in 90 ms. Remains 1652 /1656 variables (removed 4) and now considering 1902/1906 (removed 4) transitions.
[2024-05-30 11:08:34] [INFO ] Invariant cache hit.
[2024-05-30 11:08:35] [INFO ] Implicit Places using invariants in 530 ms returned []
[2024-05-30 11:08:35] [INFO ] Invariant cache hit.
[2024-05-30 11:08:37] [INFO ] Implicit Places using invariants and state equation in 1798 ms returned []
Implicit Place search using SMT with State Equation took 2331 ms to find 0 implicit places.
Running 1901 sub problems to find dead transitions.
[2024-05-30 11:08:37] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1651/3554 variables, and 0 constraints, problems are : Problem set: 0 solved, 1901 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1652 constraints, PredecessorRefiner: 1901/1901 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1651/3554 variables, and 0 constraints, problems are : Problem set: 0 solved, 1901 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1652 constraints, PredecessorRefiner: 0/1901 constraints, Known Traps: 0/0 constraints]
After SMT, in 60598ms problems are : Problem set: 0 solved, 1901 unsolved
Search for dead transitions found 0 dead transitions in 60619ms
Starting structural reductions in LTL mode, iteration 1 : 1652/1656 places, 1902/1906 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63047 ms. Remains : 1652/1656 places, 1902/1906 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-13 finished in 63216 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)||(p1 U (p2||G(p1)))))))'
Support contains 4 out of 1656 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1656/1656 places, 1906/1906 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 1655 transition count 1706
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 1456 transition count 1706
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 398 place count 1456 transition count 1456
Deduced a syphon composed of 250 places in 2 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 898 place count 1206 transition count 1456
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 901 place count 1203 transition count 1453
Iterating global reduction 2 with 3 rules applied. Total rules applied 904 place count 1203 transition count 1453
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 904 place count 1203 transition count 1452
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 906 place count 1202 transition count 1452
Performed 496 Post agglomeration using F-continuation condition.Transition count delta: 496
Deduced a syphon composed of 496 places in 1 ms
Reduce places removed 496 places and 0 transitions.
Iterating global reduction 2 with 992 rules applied. Total rules applied 1898 place count 706 transition count 956
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1900 place count 704 transition count 954
Applied a total of 1900 rules in 191 ms. Remains 704 /1656 variables (removed 952) and now considering 954/1906 (removed 952) transitions.
// Phase 1: matrix 954 rows 704 cols
[2024-05-30 11:09:38] [INFO ] Computed 201 invariants in 3 ms
[2024-05-30 11:09:38] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-05-30 11:09:38] [INFO ] Invariant cache hit.
[2024-05-30 11:09:39] [INFO ] Implicit Places using invariants and state equation in 714 ms returned []
Implicit Place search using SMT with State Equation took 1009 ms to find 0 implicit places.
[2024-05-30 11:09:39] [INFO ] Redundant transitions in 173 ms returned [953]
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 950 sub problems to find dead transitions.
// Phase 1: matrix 953 rows 704 cols
[2024-05-30 11:09:39] [INFO ] Computed 201 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:09:49] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 3 ms to minimize.
[2024-05-30 11:09:49] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 2 ms to minimize.
[2024-05-30 11:09:49] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 2 ms to minimize.
[2024-05-30 11:09:50] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 2 ms to minimize.
[2024-05-30 11:09:50] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 2 ms to minimize.
[2024-05-30 11:09:50] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 2 ms to minimize.
[2024-05-30 11:09:50] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 2 ms to minimize.
[2024-05-30 11:09:50] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 2 ms to minimize.
[2024-05-30 11:09:51] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 2 ms to minimize.
[2024-05-30 11:09:51] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 2 ms to minimize.
[2024-05-30 11:09:51] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 3 ms to minimize.
[2024-05-30 11:09:51] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 2 ms to minimize.
[2024-05-30 11:09:51] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 2 ms to minimize.
[2024-05-30 11:09:51] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 2 ms to minimize.
[2024-05-30 11:09:51] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:09:52] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 2 ms to minimize.
[2024-05-30 11:09:52] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 3 ms to minimize.
[2024-05-30 11:09:52] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 2 ms to minimize.
[2024-05-30 11:09:52] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 2 ms to minimize.
[2024-05-30 11:09:52] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:09:53] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 2 ms to minimize.
[2024-05-30 11:09:53] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 2 ms to minimize.
[2024-05-30 11:09:53] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 2 ms to minimize.
[2024-05-30 11:09:53] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 2 ms to minimize.
[2024-05-30 11:09:53] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 0 ms to minimize.
[2024-05-30 11:09:54] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 2 ms to minimize.
[2024-05-30 11:09:54] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 2 ms to minimize.
[2024-05-30 11:09:54] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 3 ms to minimize.
[2024-05-30 11:09:54] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 2 ms to minimize.
[2024-05-30 11:09:54] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 2 ms to minimize.
[2024-05-30 11:09:54] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 2 ms to minimize.
[2024-05-30 11:09:55] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 2 ms to minimize.
[2024-05-30 11:09:55] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 2 ms to minimize.
[2024-05-30 11:09:55] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 3 ms to minimize.
[2024-05-30 11:09:55] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2024-05-30 11:09:55] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:09:55] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 0 ms to minimize.
[2024-05-30 11:09:55] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 2 ms to minimize.
[2024-05-30 11:09:56] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2024-05-30 11:09:56] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/702 variables, 20/239 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:09:56] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 2 ms to minimize.
[2024-05-30 11:09:57] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 2 ms to minimize.
[2024-05-30 11:09:57] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 2 ms to minimize.
[2024-05-30 11:09:57] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-05-30 11:09:57] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 0 ms to minimize.
[2024-05-30 11:09:57] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 2 ms to minimize.
[2024-05-30 11:09:57] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 2 ms to minimize.
[2024-05-30 11:09:58] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 2 ms to minimize.
[2024-05-30 11:09:58] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 2 ms to minimize.
[2024-05-30 11:09:58] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 2 ms to minimize.
[2024-05-30 11:09:58] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 2 ms to minimize.
[2024-05-30 11:09:58] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-05-30 11:09:59] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 2 ms to minimize.
[2024-05-30 11:09:59] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 1 ms to minimize.
[2024-05-30 11:09:59] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-05-30 11:09:59] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 2 ms to minimize.
[2024-05-30 11:09:59] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 2 ms to minimize.
[2024-05-30 11:09:59] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 2 ms to minimize.
[2024-05-30 11:09:59] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 1 ms to minimize.
[2024-05-30 11:10:00] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 950 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 702/1657 variables, and 259 constraints, problems are : Problem set: 0 solved, 950 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 199/201 constraints, State Equation: 0/704 constraints, PredecessorRefiner: 950/950 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 950 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 60/259 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:10:10] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 2 ms to minimize.
[2024-05-30 11:10:10] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 2 ms to minimize.
[2024-05-30 11:10:11] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 2 ms to minimize.
[2024-05-30 11:10:11] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 2 ms to minimize.
[2024-05-30 11:10:11] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 2 ms to minimize.
[2024-05-30 11:10:11] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 3 ms to minimize.
[2024-05-30 11:10:11] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-30 11:10:11] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 2 ms to minimize.
[2024-05-30 11:10:11] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 2 ms to minimize.
[2024-05-30 11:10:12] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:10:12] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-30 11:10:12] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 2 ms to minimize.
[2024-05-30 11:10:12] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 3 ms to minimize.
[2024-05-30 11:10:12] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 2 ms to minimize.
[2024-05-30 11:10:13] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 2 ms to minimize.
[2024-05-30 11:10:13] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 2 ms to minimize.
[2024-05-30 11:10:13] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 3 ms to minimize.
[2024-05-30 11:10:13] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 2 ms to minimize.
[2024-05-30 11:10:13] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 2 ms to minimize.
[2024-05-30 11:10:13] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/702 variables, 20/279 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:10:14] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 3 ms to minimize.
[2024-05-30 11:10:14] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 2 ms to minimize.
[2024-05-30 11:10:14] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2024-05-30 11:10:15] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 2 ms to minimize.
[2024-05-30 11:10:15] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 2 ms to minimize.
[2024-05-30 11:10:15] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 2 ms to minimize.
[2024-05-30 11:10:15] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-30 11:10:15] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:10:16] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 3 ms to minimize.
[2024-05-30 11:10:16] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 2 ms to minimize.
[2024-05-30 11:10:16] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 2 ms to minimize.
[2024-05-30 11:10:16] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 2 ms to minimize.
[2024-05-30 11:10:16] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 1 ms to minimize.
[2024-05-30 11:10:16] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2024-05-30 11:10:17] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 2 ms to minimize.
[2024-05-30 11:10:17] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 3 ms to minimize.
[2024-05-30 11:10:17] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 2 ms to minimize.
[2024-05-30 11:10:17] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 2 ms to minimize.
[2024-05-30 11:10:17] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 3 ms to minimize.
[2024-05-30 11:10:17] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 20/299 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:10:18] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
[2024-05-30 11:10:19] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2024-05-30 11:10:19] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2024-05-30 11:10:19] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 1 ms to minimize.
[2024-05-30 11:10:19] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 1 ms to minimize.
[2024-05-30 11:10:19] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 2 ms to minimize.
[2024-05-30 11:10:19] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 2 ms to minimize.
[2024-05-30 11:10:19] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 3 ms to minimize.
[2024-05-30 11:10:20] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 2 ms to minimize.
[2024-05-30 11:10:20] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 3 ms to minimize.
[2024-05-30 11:10:20] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 2 ms to minimize.
[2024-05-30 11:10:20] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 1 ms to minimize.
[2024-05-30 11:10:20] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 2 ms to minimize.
[2024-05-30 11:10:20] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 1 ms to minimize.
[2024-05-30 11:10:21] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 2 ms to minimize.
[2024-05-30 11:10:21] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 1 ms to minimize.
[2024-05-30 11:10:21] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 2 ms to minimize.
[2024-05-30 11:10:21] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 1 ms to minimize.
[2024-05-30 11:10:21] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2024-05-30 11:10:21] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/702 variables, 20/319 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:10:23] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 2 ms to minimize.
[2024-05-30 11:10:23] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 2 ms to minimize.
[2024-05-30 11:10:23] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 2 ms to minimize.
[2024-05-30 11:10:23] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 2 ms to minimize.
[2024-05-30 11:10:23] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 2 ms to minimize.
[2024-05-30 11:10:23] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 3 ms to minimize.
[2024-05-30 11:10:24] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 2 ms to minimize.
[2024-05-30 11:10:24] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 2 ms to minimize.
[2024-05-30 11:10:24] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 2 ms to minimize.
[2024-05-30 11:10:24] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 3 ms to minimize.
[2024-05-30 11:10:24] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
[2024-05-30 11:10:25] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 2 ms to minimize.
[2024-05-30 11:10:25] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 2 ms to minimize.
[2024-05-30 11:10:25] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 2 ms to minimize.
[2024-05-30 11:10:25] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 2 ms to minimize.
[2024-05-30 11:10:25] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 2 ms to minimize.
[2024-05-30 11:10:25] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 2 ms to minimize.
[2024-05-30 11:10:26] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 2 ms to minimize.
[2024-05-30 11:10:26] [INFO ] Deduced a trap composed of 27 places in 184 ms of which 2 ms to minimize.
[2024-05-30 11:10:26] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/702 variables, 20/339 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:10:27] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 1 ms to minimize.
[2024-05-30 11:10:28] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 2 ms to minimize.
[2024-05-30 11:10:28] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 1 ms to minimize.
[2024-05-30 11:10:28] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 2 ms to minimize.
[2024-05-30 11:10:28] [INFO ] Deduced a trap composed of 6 places in 168 ms of which 2 ms to minimize.
[2024-05-30 11:10:28] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 2 ms to minimize.
[2024-05-30 11:10:28] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 3 ms to minimize.
[2024-05-30 11:10:29] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 2 ms to minimize.
[2024-05-30 11:10:29] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 2 ms to minimize.
[2024-05-30 11:10:29] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 2 ms to minimize.
[2024-05-30 11:10:29] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 2 ms to minimize.
[2024-05-30 11:10:29] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 1 ms to minimize.
[2024-05-30 11:10:29] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 1 ms to minimize.
[2024-05-30 11:10:29] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-30 11:10:30] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 2 ms to minimize.
[2024-05-30 11:10:30] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 2 ms to minimize.
[2024-05-30 11:10:30] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 3 ms to minimize.
[2024-05-30 11:10:30] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 3 ms to minimize.
[2024-05-30 11:10:30] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 2 ms to minimize.
[2024-05-30 11:10:30] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 20/359 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:10:32] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 2 ms to minimize.
[2024-05-30 11:10:32] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 2 ms to minimize.
[2024-05-30 11:10:32] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 2 ms to minimize.
[2024-05-30 11:10:32] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 1 ms to minimize.
[2024-05-30 11:10:33] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 2 ms to minimize.
[2024-05-30 11:10:33] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 2 ms to minimize.
[2024-05-30 11:10:33] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 2 ms to minimize.
[2024-05-30 11:10:33] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 2 ms to minimize.
[2024-05-30 11:10:33] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 2 ms to minimize.
[2024-05-30 11:10:33] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 2 ms to minimize.
[2024-05-30 11:10:34] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 2 ms to minimize.
[2024-05-30 11:10:34] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 2 ms to minimize.
[2024-05-30 11:10:34] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 2 ms to minimize.
[2024-05-30 11:10:34] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
[2024-05-30 11:10:35] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2024-05-30 11:10:35] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 2 ms to minimize.
[2024-05-30 11:10:35] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 1 ms to minimize.
[2024-05-30 11:10:35] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 2 ms to minimize.
[2024-05-30 11:10:35] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 3 ms to minimize.
[2024-05-30 11:10:35] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 20/379 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:10:36] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 3 ms to minimize.
[2024-05-30 11:10:37] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 2 ms to minimize.
[2024-05-30 11:10:37] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 2 ms to minimize.
[2024-05-30 11:10:37] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 1 ms to minimize.
[2024-05-30 11:10:37] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 2 ms to minimize.
[2024-05-30 11:10:37] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 2 ms to minimize.
[2024-05-30 11:10:37] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 3 ms to minimize.
[2024-05-30 11:10:38] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 2 ms to minimize.
[2024-05-30 11:10:38] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 2 ms to minimize.
[2024-05-30 11:10:38] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 2 ms to minimize.
[2024-05-30 11:10:39] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 2 ms to minimize.
[2024-05-30 11:10:39] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 2 ms to minimize.
[2024-05-30 11:10:39] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 702/1657 variables, and 392 constraints, problems are : Problem set: 0 solved, 950 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 199/201 constraints, State Equation: 0/704 constraints, PredecessorRefiner: 0/950 constraints, Known Traps: 193/193 constraints]
After SMT, in 60334ms problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 60344ms
Starting structural reductions in SI_LTL mode, iteration 1 : 704/1656 places, 953/1906 transitions.
Applied a total of 0 rules in 17 ms. Remains 704 /704 variables (removed 0) and now considering 953/953 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61745 ms. Remains : 704/1656 places, 953/1906 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-14
Product exploration explored 100000 steps with 150 reset in 513 ms.
Product exploration explored 100000 steps with 153 reset in 591 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 p0) p1) (AND (NOT p0) p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 110 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (57 resets) in 459 ms. (86 steps per ms) remains 1/5 properties
BEST_FIRST walk for 29931 steps (6 resets) in 113 ms. (262 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (OR p2 p0 p1))), (F (NOT (AND (OR (NOT p2) p0) (OR p0 (NOT p1)))))]
Knowledge based reduction with 11 factoid took 257 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Support contains 4 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 953/953 transitions.
Applied a total of 0 rules in 15 ms. Remains 704 /704 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2024-05-30 11:10:41] [INFO ] Invariant cache hit.
[2024-05-30 11:10:41] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-05-30 11:10:41] [INFO ] Invariant cache hit.
[2024-05-30 11:10:42] [INFO ] Implicit Places using invariants and state equation in 697 ms returned []
Implicit Place search using SMT with State Equation took 1033 ms to find 0 implicit places.
[2024-05-30 11:10:42] [INFO ] Redundant transitions in 158 ms returned []
Running 950 sub problems to find dead transitions.
[2024-05-30 11:10:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:10:52] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 2 ms to minimize.
[2024-05-30 11:10:53] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 2 ms to minimize.
[2024-05-30 11:10:53] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 2 ms to minimize.
[2024-05-30 11:10:53] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 2 ms to minimize.
[2024-05-30 11:10:53] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 2 ms to minimize.
[2024-05-30 11:10:53] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 2 ms to minimize.
[2024-05-30 11:10:54] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 2 ms to minimize.
[2024-05-30 11:10:54] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 2 ms to minimize.
[2024-05-30 11:10:54] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 2 ms to minimize.
[2024-05-30 11:10:54] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 19 ms to minimize.
[2024-05-30 11:10:54] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 2 ms to minimize.
[2024-05-30 11:10:54] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 2 ms to minimize.
[2024-05-30 11:10:54] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 2 ms to minimize.
[2024-05-30 11:10:55] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 2 ms to minimize.
[2024-05-30 11:10:55] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2024-05-30 11:10:55] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 2 ms to minimize.
[2024-05-30 11:10:55] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 2 ms to minimize.
[2024-05-30 11:10:55] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 2 ms to minimize.
[2024-05-30 11:10:55] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 2 ms to minimize.
[2024-05-30 11:10:56] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:10:56] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 2 ms to minimize.
[2024-05-30 11:10:56] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 2 ms to minimize.
[2024-05-30 11:10:56] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 2 ms to minimize.
[2024-05-30 11:10:57] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 2 ms to minimize.
[2024-05-30 11:10:57] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-30 11:10:57] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 2 ms to minimize.
[2024-05-30 11:10:57] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 2 ms to minimize.
[2024-05-30 11:10:57] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 2 ms to minimize.
[2024-05-30 11:10:57] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 3 ms to minimize.
[2024-05-30 11:10:58] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 2 ms to minimize.
[2024-05-30 11:10:58] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 2 ms to minimize.
[2024-05-30 11:10:58] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 2 ms to minimize.
[2024-05-30 11:10:58] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 2 ms to minimize.
[2024-05-30 11:10:58] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 2 ms to minimize.
[2024-05-30 11:10:58] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 2 ms to minimize.
[2024-05-30 11:10:58] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:10:59] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2024-05-30 11:10:59] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 2 ms to minimize.
[2024-05-30 11:10:59] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 3 ms to minimize.
[2024-05-30 11:10:59] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/702 variables, 20/239 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:11:00] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 2 ms to minimize.
[2024-05-30 11:11:00] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 2 ms to minimize.
[2024-05-30 11:11:00] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 2 ms to minimize.
[2024-05-30 11:11:00] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-30 11:11:00] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2024-05-30 11:11:00] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 2 ms to minimize.
[2024-05-30 11:11:00] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 2 ms to minimize.
[2024-05-30 11:11:01] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 2 ms to minimize.
[2024-05-30 11:11:01] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 2 ms to minimize.
[2024-05-30 11:11:01] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 2 ms to minimize.
[2024-05-30 11:11:01] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 2 ms to minimize.
[2024-05-30 11:11:01] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-30 11:11:01] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 2 ms to minimize.
[2024-05-30 11:11:02] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 2 ms to minimize.
[2024-05-30 11:11:02] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 2 ms to minimize.
[2024-05-30 11:11:02] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 2 ms to minimize.
[2024-05-30 11:11:02] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 2 ms to minimize.
[2024-05-30 11:11:02] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 2 ms to minimize.
[2024-05-30 11:11:02] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 2 ms to minimize.
[2024-05-30 11:11:03] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:11:12] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 2 ms to minimize.
[2024-05-30 11:11:13] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 702/1657 variables, and 261 constraints, problems are : Problem set: 0 solved, 950 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 199/201 constraints, State Equation: 0/704 constraints, PredecessorRefiner: 950/950 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 950 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 62/261 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:11:14] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 3 ms to minimize.
[2024-05-30 11:11:14] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 2 ms to minimize.
[2024-05-30 11:11:14] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 2 ms to minimize.
[2024-05-30 11:11:14] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-30 11:11:14] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-30 11:11:15] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 2 ms to minimize.
[2024-05-30 11:11:15] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 2 ms to minimize.
[2024-05-30 11:11:15] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-30 11:11:15] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:11:15] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 2 ms to minimize.
[2024-05-30 11:11:15] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 3 ms to minimize.
[2024-05-30 11:11:15] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 2 ms to minimize.
[2024-05-30 11:11:16] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 3 ms to minimize.
[2024-05-30 11:11:16] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 2 ms to minimize.
[2024-05-30 11:11:16] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 2 ms to minimize.
[2024-05-30 11:11:16] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 2 ms to minimize.
[2024-05-30 11:11:16] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 2 ms to minimize.
[2024-05-30 11:11:16] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 2 ms to minimize.
[2024-05-30 11:11:17] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:11:17] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/702 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:11:17] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 1 ms to minimize.
[2024-05-30 11:11:18] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 2 ms to minimize.
[2024-05-30 11:11:18] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 2 ms to minimize.
[2024-05-30 11:11:18] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 2 ms to minimize.
[2024-05-30 11:11:18] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 2 ms to minimize.
[2024-05-30 11:11:18] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 2 ms to minimize.
[2024-05-30 11:11:19] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 2 ms to minimize.
[2024-05-30 11:11:19] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
[2024-05-30 11:11:19] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 2 ms to minimize.
[2024-05-30 11:11:19] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 2 ms to minimize.
[2024-05-30 11:11:19] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 2 ms to minimize.
[2024-05-30 11:11:19] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 1 ms to minimize.
[2024-05-30 11:11:20] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 3 ms to minimize.
[2024-05-30 11:11:20] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 2 ms to minimize.
[2024-05-30 11:11:20] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 2 ms to minimize.
[2024-05-30 11:11:20] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 2 ms to minimize.
[2024-05-30 11:11:20] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 3 ms to minimize.
[2024-05-30 11:11:20] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 3 ms to minimize.
[2024-05-30 11:11:21] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 2 ms to minimize.
[2024-05-30 11:11:21] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 20/301 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:11:22] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 2 ms to minimize.
[2024-05-30 11:11:22] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 2 ms to minimize.
[2024-05-30 11:11:22] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 2 ms to minimize.
[2024-05-30 11:11:22] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 3 ms to minimize.
[2024-05-30 11:11:23] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 2 ms to minimize.
[2024-05-30 11:11:23] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 1 ms to minimize.
[2024-05-30 11:11:23] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 1 ms to minimize.
[2024-05-30 11:11:23] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 2 ms to minimize.
[2024-05-30 11:11:23] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 2 ms to minimize.
[2024-05-30 11:11:23] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 2 ms to minimize.
[2024-05-30 11:11:23] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 2 ms to minimize.
[2024-05-30 11:11:24] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 2 ms to minimize.
[2024-05-30 11:11:24] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 2 ms to minimize.
[2024-05-30 11:11:24] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 2 ms to minimize.
[2024-05-30 11:11:24] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 2 ms to minimize.
[2024-05-30 11:11:24] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 3 ms to minimize.
[2024-05-30 11:11:24] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 2 ms to minimize.
[2024-05-30 11:11:25] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 2 ms to minimize.
[2024-05-30 11:11:25] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 2 ms to minimize.
[2024-05-30 11:11:25] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/702 variables, 20/321 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:11:26] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 2 ms to minimize.
[2024-05-30 11:11:26] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 3 ms to minimize.
[2024-05-30 11:11:26] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 2 ms to minimize.
[2024-05-30 11:11:27] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 2 ms to minimize.
[2024-05-30 11:11:27] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 2 ms to minimize.
[2024-05-30 11:11:27] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 2 ms to minimize.
[2024-05-30 11:11:27] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 1 ms to minimize.
[2024-05-30 11:11:27] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 2 ms to minimize.
[2024-05-30 11:11:27] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 2 ms to minimize.
[2024-05-30 11:11:28] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 2 ms to minimize.
[2024-05-30 11:11:28] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-30 11:11:28] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 3 ms to minimize.
[2024-05-30 11:11:28] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 2 ms to minimize.
[2024-05-30 11:11:28] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 2 ms to minimize.
[2024-05-30 11:11:28] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 2 ms to minimize.
[2024-05-30 11:11:28] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 2 ms to minimize.
[2024-05-30 11:11:29] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 2 ms to minimize.
[2024-05-30 11:11:29] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 3 ms to minimize.
[2024-05-30 11:11:29] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 2 ms to minimize.
[2024-05-30 11:11:29] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/702 variables, 20/341 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:11:30] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 2 ms to minimize.
[2024-05-30 11:11:30] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 2 ms to minimize.
[2024-05-30 11:11:30] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 3 ms to minimize.
[2024-05-30 11:11:31] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 2 ms to minimize.
[2024-05-30 11:11:31] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 1 ms to minimize.
[2024-05-30 11:11:31] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 2 ms to minimize.
[2024-05-30 11:11:31] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 3 ms to minimize.
[2024-05-30 11:11:31] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 2 ms to minimize.
[2024-05-30 11:11:31] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 2 ms to minimize.
[2024-05-30 11:11:31] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 1 ms to minimize.
[2024-05-30 11:11:32] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 2 ms to minimize.
[2024-05-30 11:11:32] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 2 ms to minimize.
[2024-05-30 11:11:32] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 2 ms to minimize.
[2024-05-30 11:11:32] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 2 ms to minimize.
[2024-05-30 11:11:33] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 2 ms to minimize.
[2024-05-30 11:11:33] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 2 ms to minimize.
[2024-05-30 11:11:33] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 2 ms to minimize.
[2024-05-30 11:11:33] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
[2024-05-30 11:11:33] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 2 ms to minimize.
[2024-05-30 11:11:33] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 20/361 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:11:34] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 2 ms to minimize.
[2024-05-30 11:11:35] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 2 ms to minimize.
[2024-05-30 11:11:35] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2024-05-30 11:11:35] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 1 ms to minimize.
[2024-05-30 11:11:35] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 3 ms to minimize.
[2024-05-30 11:11:36] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 2 ms to minimize.
[2024-05-30 11:11:36] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 2 ms to minimize.
[2024-05-30 11:11:36] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 3 ms to minimize.
[2024-05-30 11:11:36] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 2 ms to minimize.
[2024-05-30 11:11:36] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 2 ms to minimize.
[2024-05-30 11:11:36] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 2 ms to minimize.
[2024-05-30 11:11:37] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 2 ms to minimize.
[2024-05-30 11:11:37] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
[2024-05-30 11:11:37] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 2 ms to minimize.
[2024-05-30 11:11:37] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2024-05-30 11:11:37] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 2 ms to minimize.
[2024-05-30 11:11:37] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2024-05-30 11:11:37] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2024-05-30 11:11:37] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2024-05-30 11:11:38] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 20/381 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:11:38] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 2 ms to minimize.
[2024-05-30 11:11:39] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 2 ms to minimize.
[2024-05-30 11:11:39] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 2 ms to minimize.
[2024-05-30 11:11:39] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 2 ms to minimize.
[2024-05-30 11:11:39] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 2 ms to minimize.
[2024-05-30 11:11:39] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 2 ms to minimize.
[2024-05-30 11:11:40] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 2 ms to minimize.
[2024-05-30 11:11:40] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 2 ms to minimize.
[2024-05-30 11:11:40] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 2 ms to minimize.
[2024-05-30 11:11:40] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 2 ms to minimize.
[2024-05-30 11:11:40] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 2 ms to minimize.
[2024-05-30 11:11:41] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 1 ms to minimize.
[2024-05-30 11:11:41] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 2 ms to minimize.
[2024-05-30 11:11:41] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-30 11:11:41] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2024-05-30 11:11:41] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2024-05-30 11:11:41] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-30 11:11:41] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 2 ms to minimize.
[2024-05-30 11:11:41] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 1 ms to minimize.
[2024-05-30 11:11:42] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/702 variables, 20/401 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:11:42] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 2 ms to minimize.
[2024-05-30 11:11:43] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 2 ms to minimize.
SMT process timed out in 60357ms, After SMT, problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 60366ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61598 ms. Remains : 704/704 places, 953/953 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 140 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
RANDOM walk for 17434 steps (25 resets) in 138 ms. (125 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (OR p2 p0 p1))), (F (NOT (AND (OR (NOT p2) p0) (OR p0 (NOT p1)))))]
Knowledge based reduction with 11 factoid took 313 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 151 reset in 483 ms.
Product exploration explored 100000 steps with 151 reset in 578 ms.
Support contains 4 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 953/953 transitions.
Applied a total of 0 rules in 15 ms. Remains 704 /704 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2024-05-30 11:11:45] [INFO ] Invariant cache hit.
[2024-05-30 11:11:45] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-30 11:11:45] [INFO ] Invariant cache hit.
[2024-05-30 11:11:46] [INFO ] Implicit Places using invariants and state equation in 651 ms returned []
Implicit Place search using SMT with State Equation took 906 ms to find 0 implicit places.
[2024-05-30 11:11:46] [INFO ] Redundant transitions in 162 ms returned []
Running 950 sub problems to find dead transitions.
[2024-05-30 11:11:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:11:56] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 2 ms to minimize.
[2024-05-30 11:11:56] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 2 ms to minimize.
[2024-05-30 11:11:56] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 2 ms to minimize.
[2024-05-30 11:11:57] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 2 ms to minimize.
[2024-05-30 11:11:57] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 2 ms to minimize.
[2024-05-30 11:11:57] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 2 ms to minimize.
[2024-05-30 11:11:57] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 2 ms to minimize.
[2024-05-30 11:11:57] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 2 ms to minimize.
[2024-05-30 11:11:57] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 2 ms to minimize.
[2024-05-30 11:11:58] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 2 ms to minimize.
[2024-05-30 11:11:58] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 2 ms to minimize.
[2024-05-30 11:11:58] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 2 ms to minimize.
[2024-05-30 11:11:58] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 1 ms to minimize.
[2024-05-30 11:11:58] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 2 ms to minimize.
[2024-05-30 11:11:58] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-30 11:11:58] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 2 ms to minimize.
[2024-05-30 11:11:59] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 3 ms to minimize.
[2024-05-30 11:11:59] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 2 ms to minimize.
[2024-05-30 11:11:59] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 2 ms to minimize.
[2024-05-30 11:11:59] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:12:00] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 2 ms to minimize.
[2024-05-30 11:12:00] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 2 ms to minimize.
[2024-05-30 11:12:00] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 2 ms to minimize.
[2024-05-30 11:12:00] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 2 ms to minimize.
[2024-05-30 11:12:00] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-30 11:12:00] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 2 ms to minimize.
[2024-05-30 11:12:01] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 2 ms to minimize.
[2024-05-30 11:12:01] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 2 ms to minimize.
[2024-05-30 11:12:01] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 2 ms to minimize.
[2024-05-30 11:12:01] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 2 ms to minimize.
[2024-05-30 11:12:01] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 2 ms to minimize.
[2024-05-30 11:12:01] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 2 ms to minimize.
[2024-05-30 11:12:01] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 3 ms to minimize.
[2024-05-30 11:12:02] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 2 ms to minimize.
[2024-05-30 11:12:02] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 2 ms to minimize.
[2024-05-30 11:12:02] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-30 11:12:02] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-30 11:12:02] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 2 ms to minimize.
[2024-05-30 11:12:02] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2024-05-30 11:12:02] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/702 variables, 20/239 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:12:03] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 2 ms to minimize.
[2024-05-30 11:12:03] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 2 ms to minimize.
[2024-05-30 11:12:03] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 2 ms to minimize.
[2024-05-30 11:12:03] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-30 11:12:03] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-05-30 11:12:04] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 1 ms to minimize.
[2024-05-30 11:12:04] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 2 ms to minimize.
[2024-05-30 11:12:04] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 2 ms to minimize.
[2024-05-30 11:12:04] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 2 ms to minimize.
[2024-05-30 11:12:04] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 2 ms to minimize.
[2024-05-30 11:12:04] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 2 ms to minimize.
[2024-05-30 11:12:04] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:12:05] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 2 ms to minimize.
[2024-05-30 11:12:05] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
[2024-05-30 11:12:05] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 2 ms to minimize.
[2024-05-30 11:12:05] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 2 ms to minimize.
[2024-05-30 11:12:05] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 2 ms to minimize.
[2024-05-30 11:12:06] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 2 ms to minimize.
[2024-05-30 11:12:06] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 2 ms to minimize.
[2024-05-30 11:12:06] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 11:12:16] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 2 ms to minimize.
[2024-05-30 11:12:16] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 3 ms to minimize.
SMT process timed out in 30376ms, After SMT, problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 30386ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31477 ms. Remains : 704/704 places, 953/953 transitions.
Treatment of property ShieldRVs-PT-050B-LTLFireability-14 finished in 158882 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(G(p0))||(p1&&(X(F(p3))||p2))))))'
Support contains 5 out of 1656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1656/1656 places, 1906/1906 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1653 transition count 1903
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1653 transition count 1903
Applied a total of 6 rules in 94 ms. Remains 1653 /1656 variables (removed 3) and now considering 1903/1906 (removed 3) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2024-05-30 11:12:16] [INFO ] Computed 201 invariants in 8 ms
[2024-05-30 11:12:17] [INFO ] Implicit Places using invariants in 456 ms returned []
[2024-05-30 11:12:17] [INFO ] Invariant cache hit.
[2024-05-30 11:12:18] [INFO ] Implicit Places using invariants and state equation in 1542 ms returned []
Implicit Place search using SMT with State Equation took 1998 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2024-05-30 11:12:18] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1652/3556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1653 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 timeout
1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1652/3556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1653 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints]
After SMT, in 60628ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 60648ms
Starting structural reductions in LTL mode, iteration 1 : 1653/1656 places, 1903/1906 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62747 ms. Remains : 1653/1656 places, 1903/1906 transitions.
Stuttering acceptance computed with spot in 272 ms :[true, (NOT p3), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p3) (NOT p0)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-15
Entered a terminal (fully accepting) state of product in 314 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-15 finished in 63050 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)||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||X((p1||X(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(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' '!(G(F((!p0 U (p1||G(!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' '!(F(G((F(p0)||(p1 U (p2||G(p1)))))))'
[2024-05-30 11:13:20] [INFO ] Flatten gal took : 71 ms
[2024-05-30 11:13:20] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-30 11:13:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1656 places, 1906 transitions and 6506 arcs took 11 ms.
Total runtime 1581049 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running ShieldRVs-PT-050B
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/406/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1656
TRANSITIONS: 1906
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.022s, Sys 0.018s]
SAVING FILE /home/mcc/execution/406/model (.net / .def) ...
EXPORT TIME: [User 0.005s, Sys 0.001s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 8849
MODEL NAME: /home/mcc/execution/406/model
1656 places, 1906 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//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//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-050B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ShieldRVs-PT-050B, 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 r355-tall-171683759700860"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-050B.tgz
mv ShieldRVs-PT-050B 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 ;