About the Execution of GreatSPN+red for ShieldIIPt-PT-050B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12698.163 | 3600000.00 | 9270950.00 | 7201.30 | ??T?T?FF??T??T?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-171683758500335.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 ShieldIIPt-PT-050B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683758500335
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 20:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 20:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 12 20:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 12 20:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 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 860K 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 ShieldIIPt-PT-050B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716946348076
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-050B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 01:32:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 01:32:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 01:32:29] [INFO ] Load time of PNML (sax parser for PT used): 209 ms
[2024-05-29 01:32:29] [INFO ] Transformed 3503 places.
[2024-05-29 01:32:29] [INFO ] Transformed 3253 transitions.
[2024-05-29 01:32:29] [INFO ] Found NUPN structural information;
[2024-05-29 01:32:29] [INFO ] Parsed PT model containing 3503 places and 3253 transitions and 8106 arcs in 463 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 2108 ms. (18 steps per ms) remains 12/16 properties
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 513 ms. (77 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 858 ms. (46 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 221 ms. (180 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 12/12 properties
// Phase 1: matrix 3253 rows 3503 cols
[2024-05-29 01:32:31] [INFO ] Computed 451 invariants in 49 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 269/269 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/269 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 2127/2396 variables, 273/542 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2396 variables, 2127/2669 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2396 variables, 0/2669 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 1107/3503 variables, 178/2847 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3503 variables, 1107/3954 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3503 variables, 0/3954 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 3253/6756 variables, 3503/7457 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6756 variables, 0/7457 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6756/6756 variables, and 7457 constraints, problems are : Problem set: 0 solved, 12 unsolved in 5041 ms.
Refiners :[Domain max(s): 3503/3503 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 3503/3503 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 269/269 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/269 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 2127/2396 variables, 273/542 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2396 variables, 2127/2669 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-29 01:32:38] [INFO ] Deduced a trap composed of 23 places in 358 ms of which 51 ms to minimize.
[2024-05-29 01:32:38] [INFO ] Deduced a trap composed of 29 places in 280 ms of which 6 ms to minimize.
[2024-05-29 01:32:38] [INFO ] Deduced a trap composed of 30 places in 351 ms of which 6 ms to minimize.
[2024-05-29 01:32:39] [INFO ] Deduced a trap composed of 26 places in 305 ms of which 9 ms to minimize.
[2024-05-29 01:32:39] [INFO ] Deduced a trap composed of 26 places in 305 ms of which 4 ms to minimize.
[2024-05-29 01:32:39] [INFO ] Deduced a trap composed of 20 places in 262 ms of which 4 ms to minimize.
[2024-05-29 01:32:40] [INFO ] Deduced a trap composed of 35 places in 249 ms of which 5 ms to minimize.
[2024-05-29 01:32:40] [INFO ] Deduced a trap composed of 60 places in 214 ms of which 4 ms to minimize.
[2024-05-29 01:32:40] [INFO ] Deduced a trap composed of 30 places in 213 ms of which 5 ms to minimize.
[2024-05-29 01:32:40] [INFO ] Deduced a trap composed of 33 places in 205 ms of which 4 ms to minimize.
[2024-05-29 01:32:41] [INFO ] Deduced a trap composed of 26 places in 194 ms of which 4 ms to minimize.
[2024-05-29 01:32:41] [INFO ] Deduced a trap composed of 38 places in 192 ms of which 4 ms to minimize.
[2024-05-29 01:32:41] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 4 ms to minimize.
[2024-05-29 01:32:41] [INFO ] Deduced a trap composed of 35 places in 183 ms of which 4 ms to minimize.
[2024-05-29 01:32:42] [INFO ] Deduced a trap composed of 44 places in 196 ms of which 4 ms to minimize.
SMT process timed out in 10437ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 269 out of 3503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3503/3503 places, 3253/3253 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 645 transitions
Trivial Post-agglo rules discarded 645 transitions
Performed 645 trivial Post agglomeration. Transition count delta: 645
Iterating post reduction 0 with 645 rules applied. Total rules applied 645 place count 3503 transition count 2608
Reduce places removed 645 places and 0 transitions.
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Iterating post reduction 1 with 715 rules applied. Total rules applied 1360 place count 2858 transition count 2538
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 1430 place count 2788 transition count 2538
Performed 214 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 214 Pre rules applied. Total rules applied 1430 place count 2788 transition count 2324
Deduced a syphon composed of 214 places in 7 ms
Reduce places removed 214 places and 0 transitions.
Iterating global reduction 3 with 428 rules applied. Total rules applied 1858 place count 2574 transition count 2324
Discarding 313 places :
Symmetric choice reduction at 3 with 313 rule applications. Total rules 2171 place count 2261 transition count 2011
Iterating global reduction 3 with 313 rules applied. Total rules applied 2484 place count 2261 transition count 2011
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 2486 place count 2261 transition count 2009
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2487 place count 2260 transition count 2009
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 102 Pre rules applied. Total rules applied 2487 place count 2260 transition count 1907
Deduced a syphon composed of 102 places in 16 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 5 with 204 rules applied. Total rules applied 2691 place count 2158 transition count 1907
Performed 725 Post agglomeration using F-continuation condition.Transition count delta: 725
Deduced a syphon composed of 725 places in 3 ms
Reduce places removed 725 places and 0 transitions.
Iterating global reduction 5 with 1450 rules applied. Total rules applied 4141 place count 1433 transition count 1182
Renaming transitions due to excessive name length > 1024 char.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 100 places in 4 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 5 with 200 rules applied. Total rules applied 4341 place count 1333 transition count 1224
Free-agglomeration rule applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 4352 place count 1333 transition count 1213
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 4363 place count 1322 transition count 1213
Partial Free-agglomeration rule applied 39 times.
Drop transitions (Partial Free agglomeration) removed 39 transitions
Iterating global reduction 6 with 39 rules applied. Total rules applied 4402 place count 1322 transition count 1213
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4403 place count 1321 transition count 1212
Applied a total of 4403 rules in 1216 ms. Remains 1321 /3503 variables (removed 2182) and now considering 1212/3253 (removed 2041) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1226 ms. Remains : 1321/3503 places, 1212/3253 transitions.
RANDOM walk for 40000 steps (8 resets) in 924 ms. (43 steps per ms) remains 11/12 properties
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 385 ms. (103 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 440 ms. (90 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 288 ms. (138 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 225 ms. (177 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 399 ms. (100 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 349 ms. (114 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 287 ms. (138 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 82414 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 11
Probabilistic random walk after 82414 steps, saw 57586 distinct states, run finished after 3006 ms. (steps per millisecond=27 ) properties seen :0
// Phase 1: matrix 1212 rows 1321 cols
[2024-05-29 01:32:47] [INFO ] Computed 451 invariants in 21 ms
[2024-05-29 01:32:47] [INFO ] State equation strengthened by 183 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 679/947 variables, 273/273 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/947 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 268/1215 variables, 128/401 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1215 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1165/2380 variables, 1215/1616 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2380 variables, 181/1797 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2380 variables, 0/1797 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 133/2513 variables, 90/1887 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2513 variables, 41/1928 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2513 variables, 2/1930 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2513 variables, 0/1930 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 2/2515 variables, 2/1932 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2515 variables, 2/1934 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2515 variables, 0/1934 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 4/2519 variables, 2/1936 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2519 variables, 0/1936 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 14/2533 variables, 14/1950 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2533 variables, 5/1955 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2533 variables, 0/1955 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (OVERLAPS) 0/2533 variables, 0/1955 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2533/2533 variables, and 1955 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5803 ms.
Refiners :[Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 1321/1321 constraints, ReadFeed: 183/183 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 679/947 variables, 273/273 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 01:32:53] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 2 ms to minimize.
[2024-05-29 01:32:54] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 3 ms to minimize.
[2024-05-29 01:32:54] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 2 ms to minimize.
[2024-05-29 01:32:54] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2024-05-29 01:32:54] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-29 01:32:54] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 2 ms to minimize.
[2024-05-29 01:32:54] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 2 ms to minimize.
[2024-05-29 01:32:54] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-29 01:32:54] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-29 01:32:54] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 2 ms to minimize.
[2024-05-29 01:32:54] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 2 ms to minimize.
[2024-05-29 01:32:54] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
[2024-05-29 01:32:55] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 2 ms to minimize.
[2024-05-29 01:32:55] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-05-29 01:32:55] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 2 ms to minimize.
[2024-05-29 01:32:55] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2024-05-29 01:32:55] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 2 ms to minimize.
[2024-05-29 01:32:55] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 2 ms to minimize.
[2024-05-29 01:32:55] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 5 ms to minimize.
[2024-05-29 01:32:55] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/947 variables, 20/293 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 01:32:55] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2024-05-29 01:32:56] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
[2024-05-29 01:32:56] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 2 ms to minimize.
[2024-05-29 01:32:56] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2024-05-29 01:32:56] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 2 ms to minimize.
[2024-05-29 01:32:56] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-05-29 01:32:56] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
[2024-05-29 01:32:56] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2024-05-29 01:32:56] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 2 ms to minimize.
[2024-05-29 01:32:56] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 2 ms to minimize.
[2024-05-29 01:32:56] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 2 ms to minimize.
[2024-05-29 01:32:57] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 2 ms to minimize.
[2024-05-29 01:32:57] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 2 ms to minimize.
[2024-05-29 01:32:57] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 2 ms to minimize.
[2024-05-29 01:32:57] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 2 ms to minimize.
[2024-05-29 01:32:57] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 3 ms to minimize.
[2024-05-29 01:32:57] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-05-29 01:32:57] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2024-05-29 01:32:57] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 2 ms to minimize.
[2024-05-29 01:32:57] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/947 variables, 20/313 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 01:32:57] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 5 ms to minimize.
[2024-05-29 01:32:58] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
[2024-05-29 01:32:58] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 2 ms to minimize.
[2024-05-29 01:32:58] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-29 01:32:58] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-29 01:32:58] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 2 ms to minimize.
[2024-05-29 01:32:58] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 2 ms to minimize.
[2024-05-29 01:32:58] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/947 variables, 8/321 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 01:32:58] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2024-05-29 01:32:58] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/947 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 01:32:59] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 2 ms to minimize.
[2024-05-29 01:32:59] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/947 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 01:32:59] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 1 ms to minimize.
[2024-05-29 01:32:59] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-05-29 01:33:00] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/947 variables, 3/328 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/947 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 268/1215 variables, 128/456 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 01:33:00] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 2 ms to minimize.
[2024-05-29 01:33:00] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 2 ms to minimize.
[2024-05-29 01:33:00] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 2 ms to minimize.
[2024-05-29 01:33:00] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 2 ms to minimize.
[2024-05-29 01:33:00] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 2 ms to minimize.
[2024-05-29 01:33:01] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-29 01:33:01] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2024-05-29 01:33:01] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 2 ms to minimize.
[2024-05-29 01:33:01] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 2 ms to minimize.
[2024-05-29 01:33:01] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-05-29 01:33:01] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 2 ms to minimize.
[2024-05-29 01:33:01] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 1 ms to minimize.
[2024-05-29 01:33:02] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
[2024-05-29 01:33:02] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-05-29 01:33:02] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 2 ms to minimize.
[2024-05-29 01:33:02] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1215 variables, 16/472 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 01:33:02] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 2 ms to minimize.
[2024-05-29 01:33:02] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2024-05-29 01:33:02] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 2 ms to minimize.
[2024-05-29 01:33:03] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 2 ms to minimize.
[2024-05-29 01:33:03] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 3 ms to minimize.
[2024-05-29 01:33:03] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1215 variables, 6/478 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 01:33:03] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 2 ms to minimize.
[2024-05-29 01:33:03] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1215 variables, 2/480 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 01:33:03] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1215 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 01:33:04] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 2 ms to minimize.
[2024-05-29 01:33:04] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 2 ms to minimize.
[2024-05-29 01:33:04] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 2 ms to minimize.
[2024-05-29 01:33:04] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1215 variables, 4/485 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 01:33:05] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2024-05-29 01:33:05] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-29 01:33:05] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-05-29 01:33:05] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-29 01:33:05] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2024-05-29 01:33:05] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-29 01:33:05] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 2 ms to minimize.
[2024-05-29 01:33:05] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 2 ms to minimize.
[2024-05-29 01:33:05] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 2 ms to minimize.
[2024-05-29 01:33:05] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 2 ms to minimize.
[2024-05-29 01:33:05] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 2 ms to minimize.
[2024-05-29 01:33:06] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-05-29 01:33:06] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-29 01:33:06] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 2 ms to minimize.
[2024-05-29 01:33:06] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-05-29 01:33:06] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1215 variables, 16/501 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 01:33:06] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 2 ms to minimize.
[2024-05-29 01:33:06] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-29 01:33:07] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1215 variables, 3/504 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1215 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (OVERLAPS) 1165/2380 variables, 1215/1719 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2380 variables, 181/1900 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2380 variables, 6/1906 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 01:33:09] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 2 ms to minimize.
[2024-05-29 01:33:09] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 3 ms to minimize.
[2024-05-29 01:33:09] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 3 ms to minimize.
[2024-05-29 01:33:10] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 3 ms to minimize.
[2024-05-29 01:33:10] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 3 ms to minimize.
[2024-05-29 01:33:10] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 3 ms to minimize.
[2024-05-29 01:33:10] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 3 ms to minimize.
[2024-05-29 01:33:10] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 3 ms to minimize.
[2024-05-29 01:33:11] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/2380 variables, 9/1915 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 01:33:12] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/2380 variables, 1/1916 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2380 variables, 0/1916 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (OVERLAPS) 133/2513 variables, 90/2006 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2513 variables, 41/2047 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2513 variables, 2/2049 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2513 variables, 5/2054 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 01:33:17] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 4 ms to minimize.
[2024-05-29 01:33:17] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 3 ms to minimize.
[2024-05-29 01:33:18] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 3 ms to minimize.
[2024-05-29 01:33:18] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 3 ms to minimize.
[2024-05-29 01:33:18] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 3 ms to minimize.
[2024-05-29 01:33:18] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 4 ms to minimize.
[2024-05-29 01:33:19] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 3 ms to minimize.
[2024-05-29 01:33:19] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 3 ms to minimize.
[2024-05-29 01:33:19] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 3 ms to minimize.
[2024-05-29 01:33:19] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 3 ms to minimize.
[2024-05-29 01:33:19] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 3 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/2513 variables, 11/2065 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2513 variables, 0/2065 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 30 (OVERLAPS) 2/2515 variables, 2/2067 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2515 variables, 2/2069 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2515 variables, 0/2069 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 33 (OVERLAPS) 4/2519 variables, 2/2071 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2519 variables, 0/2071 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 35 (OVERLAPS) 14/2533 variables, 14/2085 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2533 variables, 5/2090 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2533 variables, 0/2090 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 38 (OVERLAPS) 0/2533 variables, 0/2090 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2533/2533 variables, and 2090 constraints, problems are : Problem set: 0 solved, 11 unsolved in 39978 ms.
Refiners :[Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 1321/1321 constraints, ReadFeed: 183/183 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 124/124 constraints]
After SMT, in 45890ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 35299 ms.
Support contains 268 out of 1321 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1321/1321 places, 1212/1212 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1320 transition count 1211
Applied a total of 2 rules in 73 ms. Remains 1320 /1321 variables (removed 1) and now considering 1211/1212 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 1320/1321 places, 1211/1212 transitions.
RANDOM walk for 40000 steps (8 resets) in 758 ms. (52 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 298 ms. (133 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 389 ms. (102 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 299 ms. (133 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 339 ms. (117 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 347 ms. (114 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 89855 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :0 out of 11
Probabilistic random walk after 89855 steps, saw 62350 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
// Phase 1: matrix 1211 rows 1320 cols
[2024-05-29 01:34:13] [INFO ] Computed 451 invariants in 4 ms
[2024-05-29 01:34:13] [INFO ] State equation strengthened by 183 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 678/946 variables, 273/273 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/946 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 268/1214 variables, 128/401 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1214 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1164/2378 variables, 1214/1615 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2378 variables, 181/1796 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2378 variables, 0/1796 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 133/2511 variables, 90/1886 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2511 variables, 41/1927 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2511 variables, 2/1929 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2511 variables, 0/1929 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 2/2513 variables, 2/1931 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2513 variables, 2/1933 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2513 variables, 0/1933 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 4/2517 variables, 2/1935 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2517 variables, 0/1935 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 14/2531 variables, 14/1949 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2531 variables, 5/1954 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2531 variables, 0/1954 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (OVERLAPS) 0/2531 variables, 0/1954 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2531/2531 variables, and 1954 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5856 ms.
Refiners :[Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 1320/1320 constraints, ReadFeed: 183/183 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 678/946 variables, 273/273 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 01:34:19] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 2 ms to minimize.
[2024-05-29 01:34:19] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 2 ms to minimize.
[2024-05-29 01:34:19] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 3 ms to minimize.
[2024-05-29 01:34:19] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-05-29 01:34:19] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 2 ms to minimize.
[2024-05-29 01:34:19] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 2 ms to minimize.
[2024-05-29 01:34:20] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 2 ms to minimize.
[2024-05-29 01:34:20] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 2 ms to minimize.
[2024-05-29 01:34:20] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 2 ms to minimize.
[2024-05-29 01:34:20] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-05-29 01:34:20] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-05-29 01:34:20] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-05-29 01:34:20] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2024-05-29 01:34:20] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-29 01:34:20] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 2 ms to minimize.
[2024-05-29 01:34:20] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
[2024-05-29 01:34:20] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 2 ms to minimize.
[2024-05-29 01:34:21] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 2 ms to minimize.
[2024-05-29 01:34:21] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 2 ms to minimize.
[2024-05-29 01:34:21] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/946 variables, 20/293 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 01:34:21] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 3 ms to minimize.
[2024-05-29 01:34:21] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 3 ms to minimize.
[2024-05-29 01:34:21] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2024-05-29 01:34:21] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-05-29 01:34:21] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
[2024-05-29 01:34:21] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 2 ms to minimize.
[2024-05-29 01:34:22] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
[2024-05-29 01:34:22] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 2 ms to minimize.
[2024-05-29 01:34:22] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 2 ms to minimize.
[2024-05-29 01:34:22] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 2 ms to minimize.
[2024-05-29 01:34:22] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 2 ms to minimize.
[2024-05-29 01:34:22] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 2 ms to minimize.
[2024-05-29 01:34:22] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-05-29 01:34:22] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 2 ms to minimize.
[2024-05-29 01:34:22] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-05-29 01:34:23] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 2 ms to minimize.
[2024-05-29 01:34:23] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 2 ms to minimize.
[2024-05-29 01:34:23] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 2 ms to minimize.
[2024-05-29 01:34:23] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-05-29 01:34:23] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/946 variables, 20/313 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 01:34:23] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 2 ms to minimize.
[2024-05-29 01:34:23] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-29 01:34:23] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-29 01:34:23] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-29 01:34:23] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2024-05-29 01:34:24] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 2 ms to minimize.
[2024-05-29 01:34:24] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-05-29 01:34:24] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/946 variables, 8/321 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 01:34:24] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/946 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 01:34:24] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/946 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/946 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 268/1214 variables, 128/451 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 01:34:25] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 2 ms to minimize.
[2024-05-29 01:34:25] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 2 ms to minimize.
[2024-05-29 01:34:25] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 2 ms to minimize.
[2024-05-29 01:34:25] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 2 ms to minimize.
[2024-05-29 01:34:25] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 2 ms to minimize.
[2024-05-29 01:34:25] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2024-05-29 01:34:25] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 2 ms to minimize.
[2024-05-29 01:34:26] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-05-29 01:34:26] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 2 ms to minimize.
[2024-05-29 01:34:26] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
[2024-05-29 01:34:26] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-29 01:34:26] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 2 ms to minimize.
[2024-05-29 01:34:26] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 2 ms to minimize.
[2024-05-29 01:34:26] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2024-05-29 01:34:26] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 2 ms to minimize.
[2024-05-29 01:34:26] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 2 ms to minimize.
[2024-05-29 01:34:27] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 1 ms to minimize.
[2024-05-29 01:34:27] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1214 variables, 18/469 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 01:34:27] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 2 ms to minimize.
[2024-05-29 01:34:27] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 2 ms to minimize.
[2024-05-29 01:34:27] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 2 ms to minimize.
[2024-05-29 01:34:27] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 2 ms to minimize.
[2024-05-29 01:34:27] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 1 ms to minimize.
[2024-05-29 01:34:28] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-05-29 01:34:28] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-05-29 01:34:28] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 2 ms to minimize.
[2024-05-29 01:34:28] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 2 ms to minimize.
[2024-05-29 01:34:28] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 2 ms to minimize.
[2024-05-29 01:34:28] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-05-29 01:34:28] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 2 ms to minimize.
[2024-05-29 01:34:28] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 2 ms to minimize.
[2024-05-29 01:34:28] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 2 ms to minimize.
[2024-05-29 01:34:28] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1214 variables, 15/484 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 01:34:29] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 1 ms to minimize.
[2024-05-29 01:34:29] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 3 ms to minimize.
[2024-05-29 01:34:29] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 2 ms to minimize.
[2024-05-29 01:34:29] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-29 01:34:29] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 2 ms to minimize.
[2024-05-29 01:34:29] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1214 variables, 6/490 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1214 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 1164/2378 variables, 1214/1704 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2378 variables, 181/1885 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2378 variables, 6/1891 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 01:34:31] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 2 ms to minimize.
[2024-05-29 01:34:31] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 3 ms to minimize.
[2024-05-29 01:34:31] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2378 variables, 3/1894 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2378 variables, 0/1894 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (OVERLAPS) 133/2511 variables, 90/1984 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2511 variables, 41/2025 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2511 variables, 2/2027 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2511 variables, 5/2032 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 01:34:37] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 4 ms to minimize.
[2024-05-29 01:34:37] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 3 ms to minimize.
[2024-05-29 01:34:37] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 4 ms to minimize.
[2024-05-29 01:34:37] [INFO ] Deduced a trap composed of 6 places in 168 ms of which 4 ms to minimize.
[2024-05-29 01:34:38] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 3 ms to minimize.
[2024-05-29 01:34:38] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 3 ms to minimize.
[2024-05-29 01:34:38] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/2511 variables, 7/2039 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 01:34:41] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/2511 variables, 1/2040 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2511 variables, 0/2040 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (OVERLAPS) 2/2513 variables, 2/2042 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2513 variables, 2/2044 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 01:34:45] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 3 ms to minimize.
[2024-05-29 01:34:46] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 2 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/2513 variables, 2/2046 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2513 variables, 0/2046 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 29 (OVERLAPS) 4/2517 variables, 2/2048 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2517 variables, 0/2048 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 31 (OVERLAPS) 14/2531 variables, 14/2062 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2531 variables, 5/2067 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2531 variables, 0/2067 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 34 (OVERLAPS) 0/2531 variables, 0/2067 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2531/2531 variables, and 2067 constraints, problems are : Problem set: 0 solved, 11 unsolved in 37055 ms.
Refiners :[Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 1320/1320 constraints, ReadFeed: 183/183 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 102/102 constraints]
After SMT, in 42973ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 14590 ms.
Support contains 268 out of 1320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1320/1320 places, 1211/1211 transitions.
Applied a total of 0 rules in 40 ms. Remains 1320 /1320 variables (removed 0) and now considering 1211/1211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 1320/1320 places, 1211/1211 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1320/1320 places, 1211/1211 transitions.
Applied a total of 0 rules in 28 ms. Remains 1320 /1320 variables (removed 0) and now considering 1211/1211 (removed 0) transitions.
[2024-05-29 01:35:10] [INFO ] Invariant cache hit.
[2024-05-29 01:35:11] [INFO ] Implicit Places using invariants in 632 ms returned [1306]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 645 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1319/1320 places, 1211/1211 transitions.
Applied a total of 0 rules in 29 ms. Remains 1319 /1319 variables (removed 0) and now considering 1211/1211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 703 ms. Remains : 1319/1320 places, 1211/1211 transitions.
RANDOM walk for 40000 steps (8 resets) in 887 ms. (45 steps per ms) remains 10/11 properties
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 290 ms. (137 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 307 ms. (129 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 352 ms. (113 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 352 ms. (113 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 282 ms. (141 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 91456 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :0 out of 10
Probabilistic random walk after 91456 steps, saw 63233 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
// Phase 1: matrix 1211 rows 1319 cols
[2024-05-29 01:35:15] [INFO ] Computed 450 invariants in 5 ms
[2024-05-29 01:35:15] [INFO ] State equation strengthened by 181 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 635/873 variables, 245/245 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/873 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 311/1184 variables, 145/390 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1184 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1131/2315 variables, 1184/1574 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2315 variables, 176/1750 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2315 variables, 0/1750 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 164/2479 variables, 98/1848 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2479 variables, 37/1885 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2479 variables, 4/1889 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2479 variables, 0/1889 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 9/2488 variables, 10/1899 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2488 variables, 7/1906 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2488 variables, 0/1906 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 8/2496 variables, 4/1910 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2496 variables, 0/1910 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 31/2527 variables, 28/1938 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2527 variables, 8/1946 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2527 variables, 1/1947 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2527 variables, 0/1947 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 2/2529 variables, 1/1948 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2529 variables, 0/1948 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (OVERLAPS) 1/2530 variables, 2/1950 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2530 variables, 0/1950 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (OVERLAPS) 0/2530 variables, 0/1950 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2530/2530 variables, and 1950 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5885 ms.
Refiners :[Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 1319/1319 constraints, ReadFeed: 181/181 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 635/873 variables, 245/245 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-29 01:35:21] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 1 ms to minimize.
[2024-05-29 01:35:21] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 2 ms to minimize.
[2024-05-29 01:35:21] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 2 ms to minimize.
[2024-05-29 01:35:22] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-05-29 01:35:22] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-29 01:35:22] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2024-05-29 01:35:22] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-05-29 01:35:22] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 2 ms to minimize.
[2024-05-29 01:35:22] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2024-05-29 01:35:22] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
[2024-05-29 01:35:22] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-29 01:35:22] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 2 ms to minimize.
[2024-05-29 01:35:22] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
[2024-05-29 01:35:22] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 2 ms to minimize.
[2024-05-29 01:35:22] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 2 ms to minimize.
[2024-05-29 01:35:23] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
[2024-05-29 01:35:23] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-05-29 01:35:23] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 2 ms to minimize.
[2024-05-29 01:35:23] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 2 ms to minimize.
[2024-05-29 01:35:23] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/873 variables, 20/265 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-29 01:35:23] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2024-05-29 01:35:23] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-05-29 01:35:23] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 1 ms to minimize.
[2024-05-29 01:35:23] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 2 ms to minimize.
[2024-05-29 01:35:23] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 2 ms to minimize.
[2024-05-29 01:35:24] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 2 ms to minimize.
[2024-05-29 01:35:24] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 2 ms to minimize.
[2024-05-29 01:35:24] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 2 ms to minimize.
[2024-05-29 01:35:24] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 2 ms to minimize.
[2024-05-29 01:35:24] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
[2024-05-29 01:35:24] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 2 ms to minimize.
[2024-05-29 01:35:24] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
[2024-05-29 01:35:24] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/873 variables, 13/278 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-29 01:35:24] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 2 ms to minimize.
[2024-05-29 01:35:25] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2024-05-29 01:35:25] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/873 variables, 3/281 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-29 01:35:25] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/873 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/873 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 311/1184 variables, 145/427 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-29 01:35:25] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 2 ms to minimize.
[2024-05-29 01:35:25] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 2 ms to minimize.
[2024-05-29 01:35:26] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 2 ms to minimize.
[2024-05-29 01:35:26] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 1 ms to minimize.
[2024-05-29 01:35:26] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
[2024-05-29 01:35:26] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 2 ms to minimize.
[2024-05-29 01:35:26] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 2 ms to minimize.
[2024-05-29 01:35:26] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 2 ms to minimize.
[2024-05-29 01:35:26] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 2 ms to minimize.
[2024-05-29 01:35:26] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2024-05-29 01:35:26] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 2 ms to minimize.
[2024-05-29 01:35:26] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 2 ms to minimize.
[2024-05-29 01:35:27] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 2 ms to minimize.
[2024-05-29 01:35:27] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-29 01:35:27] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-29 01:35:27] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2024-05-29 01:35:27] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2024-05-29 01:35:27] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2024-05-29 01:35:27] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 2 ms to minimize.
[2024-05-29 01:35:27] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1184 variables, 20/447 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-29 01:35:27] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-05-29 01:35:28] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-05-29 01:35:28] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 2 ms to minimize.
[2024-05-29 01:35:28] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 2 ms to minimize.
[2024-05-29 01:35:28] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
[2024-05-29 01:35:28] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2024-05-29 01:35:28] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 2 ms to minimize.
[2024-05-29 01:35:28] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1184 variables, 8/455 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-29 01:35:29] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-05-29 01:35:29] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1184 variables, 2/457 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-29 01:35:29] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1184 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-29 01:35:29] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-05-29 01:35:29] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-05-29 01:35:30] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 2 ms to minimize.
[2024-05-29 01:35:30] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1184 variables, 4/462 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-29 01:35:30] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 2 ms to minimize.
[2024-05-29 01:35:30] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 2 ms to minimize.
[2024-05-29 01:35:30] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 2 ms to minimize.
[2024-05-29 01:35:30] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 2 ms to minimize.
[2024-05-29 01:35:30] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1184 variables, 5/467 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-29 01:35:31] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-29 01:35:31] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1184 variables, 2/469 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1184 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 1131/2315 variables, 1184/1653 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2315 variables, 176/1829 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2315 variables, 6/1835 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-29 01:35:33] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 2 ms to minimize.
[2024-05-29 01:35:33] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 3 ms to minimize.
[2024-05-29 01:35:33] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 2 ms to minimize.
[2024-05-29 01:35:33] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 3 ms to minimize.
[2024-05-29 01:35:34] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 2 ms to minimize.
[2024-05-29 01:35:34] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 2 ms to minimize.
[2024-05-29 01:35:34] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2315 variables, 7/1842 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-29 01:35:35] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/2315 variables, 1/1843 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-29 01:35:36] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/2315 variables, 1/1844 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2315 variables, 0/1844 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (OVERLAPS) 164/2479 variables, 98/1942 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2479 variables, 37/1979 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2479 variables, 4/1983 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2479 variables, 4/1987 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-29 01:35:39] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 2 ms to minimize.
[2024-05-29 01:35:39] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 3 ms to minimize.
[2024-05-29 01:35:39] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 3 ms to minimize.
[2024-05-29 01:35:40] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 2 ms to minimize.
[2024-05-29 01:35:40] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 3 ms to minimize.
[2024-05-29 01:35:40] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 3 ms to minimize.
[2024-05-29 01:35:41] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 2 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/2479 variables, 7/1994 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2479 variables, 0/1994 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 29 (OVERLAPS) 9/2488 variables, 10/2004 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2488 variables, 7/2011 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-29 01:35:45] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 3 ms to minimize.
[2024-05-29 01:35:45] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 3 ms to minimize.
[2024-05-29 01:35:45] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 3 ms to minimize.
[2024-05-29 01:35:46] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 3 ms to minimize.
[2024-05-29 01:35:46] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 3 ms to minimize.
[2024-05-29 01:35:46] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 3 ms to minimize.
[2024-05-29 01:35:46] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 2 ms to minimize.
[2024-05-29 01:35:47] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 3 ms to minimize.
[2024-05-29 01:35:47] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 2 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/2488 variables, 9/2020 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2488 variables, 0/2020 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 33 (OVERLAPS) 8/2496 variables, 4/2024 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2496 variables, 0/2024 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 35 (OVERLAPS) 31/2527 variables, 28/2052 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2527 variables, 8/2060 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2527 variables, 1/2061 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-29 01:35:53] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 2 ms to minimize.
[2024-05-29 01:35:53] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 2 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/2527 variables, 2/2063 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2527 variables, 0/2063 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 40 (OVERLAPS) 2/2529 variables, 1/2064 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/2529 variables, 0/2064 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 42 (OVERLAPS) 1/2530 variables, 2/2066 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2530 variables, 0/2066 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 44 (OVERLAPS) 0/2530 variables, 0/2066 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2530/2530 variables, and 2066 constraints, problems are : Problem set: 0 solved, 10 unsolved in 39686 ms.
Refiners :[Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 1319/1319 constraints, ReadFeed: 181/181 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 106/106 constraints]
After SMT, in 45633ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 25410 ms.
Support contains 238 out of 1319 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1319/1319 places, 1211/1211 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1319 transition count 1209
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 1317 transition count 1208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 1316 transition count 1208
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 6 place count 1316 transition count 1199
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 24 place count 1307 transition count 1199
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 25 place count 1306 transition count 1198
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 1306 transition count 1198
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 54 place count 1292 transition count 1184
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 68 place count 1285 transition count 1188
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 1285 transition count 1187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 70 place count 1284 transition count 1187
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 73 place count 1284 transition count 1187
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 76 place count 1281 transition count 1184
Applied a total of 76 rules in 190 ms. Remains 1281 /1319 variables (removed 38) and now considering 1184/1211 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 1281/1319 places, 1184/1211 transitions.
RANDOM walk for 40000 steps (8 resets) in 789 ms. (50 steps per ms) remains 9/10 properties
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 195 ms. (204 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 306 ms. (130 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 286 ms. (139 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 252 ms. (158 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 9/9 properties
// Phase 1: matrix 1184 rows 1281 cols
[2024-05-29 01:36:27] [INFO ] Computed 450 invariants in 8 ms
[2024-05-29 01:36:27] [INFO ] State equation strengthened by 183 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 584/807 variables, 229/229 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/807 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 324/1131 variables, 151/380 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1131 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1089/2220 variables, 1131/1511 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2220 variables, 179/1690 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2220 variables, 0/1690 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 190/2410 variables, 112/1802 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2410 variables, 49/1851 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2410 variables, 4/1855 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2410 variables, 0/1855 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 4/2414 variables, 5/1860 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2414 variables, 4/1864 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2414 variables, 0/1864 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 4/2418 variables, 2/1866 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2418 variables, 0/1866 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 40/2458 variables, 29/1895 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2458 variables, 10/1905 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2458 variables, 0/1905 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 1/2459 variables, 2/1907 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2459 variables, 1/1908 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2459 variables, 0/1908 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 6/2465 variables, 4/1912 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2465 variables, 2/1914 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2465 variables, 0/1914 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (OVERLAPS) 0/2465 variables, 0/1914 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2465/2465 variables, and 1914 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5497 ms.
Refiners :[Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 1281/1281 constraints, ReadFeed: 183/183 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 584/807 variables, 229/229 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 01:36:33] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 2 ms to minimize.
[2024-05-29 01:36:33] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-29 01:36:33] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-05-29 01:36:33] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 2 ms to minimize.
[2024-05-29 01:36:33] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 2 ms to minimize.
[2024-05-29 01:36:33] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-05-29 01:36:33] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-29 01:36:34] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-29 01:36:34] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-29 01:36:34] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-05-29 01:36:34] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-29 01:36:34] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-29 01:36:34] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2024-05-29 01:36:34] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-29 01:36:34] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-29 01:36:34] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-29 01:36:34] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-29 01:36:34] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-29 01:36:34] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-29 01:36:34] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/807 variables, 20/249 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 01:36:34] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-05-29 01:36:35] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-29 01:36:35] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 2 ms to minimize.
[2024-05-29 01:36:35] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 2 ms to minimize.
[2024-05-29 01:36:35] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 3 ms to minimize.
[2024-05-29 01:36:35] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 2 ms to minimize.
[2024-05-29 01:36:35] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 2 ms to minimize.
[2024-05-29 01:36:35] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 2 ms to minimize.
[2024-05-29 01:36:35] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 2 ms to minimize.
[2024-05-29 01:36:35] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 2 ms to minimize.
[2024-05-29 01:36:35] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 2 ms to minimize.
[2024-05-29 01:36:36] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 2 ms to minimize.
[2024-05-29 01:36:36] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2024-05-29 01:36:36] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 2 ms to minimize.
[2024-05-29 01:36:36] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 2 ms to minimize.
[2024-05-29 01:36:36] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 2 ms to minimize.
[2024-05-29 01:36:36] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 2 ms to minimize.
[2024-05-29 01:36:36] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/807 variables, 18/267 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/807 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 324/1131 variables, 151/418 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 01:36:37] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-05-29 01:36:37] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 2 ms to minimize.
[2024-05-29 01:36:37] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2024-05-29 01:36:37] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 1 ms to minimize.
[2024-05-29 01:36:37] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 2 ms to minimize.
[2024-05-29 01:36:37] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2024-05-29 01:36:37] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 2 ms to minimize.
[2024-05-29 01:36:37] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
[2024-05-29 01:36:37] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-29 01:36:37] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 2 ms to minimize.
[2024-05-29 01:36:37] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
[2024-05-29 01:36:38] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-29 01:36:38] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-29 01:36:38] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 2 ms to minimize.
[2024-05-29 01:36:38] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2024-05-29 01:36:38] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
[2024-05-29 01:36:38] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2024-05-29 01:36:38] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-29 01:36:38] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 2 ms to minimize.
[2024-05-29 01:36:38] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1131 variables, 20/438 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 01:36:39] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 2 ms to minimize.
[2024-05-29 01:36:39] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2024-05-29 01:36:39] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 1 ms to minimize.
[2024-05-29 01:36:39] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 2 ms to minimize.
[2024-05-29 01:36:39] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 2 ms to minimize.
[2024-05-29 01:36:39] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 2 ms to minimize.
[2024-05-29 01:36:39] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 1 ms to minimize.
[2024-05-29 01:36:39] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 2 ms to minimize.
[2024-05-29 01:36:39] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 2 ms to minimize.
[2024-05-29 01:36:39] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2024-05-29 01:36:40] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2024-05-29 01:36:40] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 1 ms to minimize.
[2024-05-29 01:36:40] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1131 variables, 13/451 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 01:36:40] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 2 ms to minimize.
[2024-05-29 01:36:40] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-29 01:36:40] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
[2024-05-29 01:36:40] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 2 ms to minimize.
[2024-05-29 01:36:40] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-05-29 01:36:41] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1131 variables, 6/457 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1131 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 1089/2220 variables, 1131/1588 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2220 variables, 179/1767 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2220 variables, 6/1773 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 01:36:44] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 2 ms to minimize.
[2024-05-29 01:36:44] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 3 ms to minimize.
[2024-05-29 01:36:44] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2220 variables, 3/1776 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2220 variables, 0/1776 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 190/2410 variables, 112/1888 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2410 variables, 49/1937 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2410 variables, 4/1941 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2410 variables, 3/1944 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 01:36:47] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 4 ms to minimize.
[2024-05-29 01:36:48] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 3 ms to minimize.
[2024-05-29 01:36:48] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 3 ms to minimize.
[2024-05-29 01:36:48] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 3 ms to minimize.
[2024-05-29 01:36:49] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2410 variables, 5/1949 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2410 variables, 0/1949 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 4/2414 variables, 5/1954 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2414 variables, 4/1958 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2414 variables, 0/1958 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (OVERLAPS) 4/2418 variables, 2/1960 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 01:36:54] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 3 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/2418 variables, 1/1961 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2418 variables, 0/1961 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (OVERLAPS) 40/2458 variables, 29/1990 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2458 variables, 10/2000 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2458 variables, 0/2000 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (OVERLAPS) 1/2459 variables, 2/2002 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2459 variables, 1/2003 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2459 variables, 0/2003 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 33 (OVERLAPS) 6/2465 variables, 4/2007 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2465 variables, 2/2009 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 01:37:00] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 2 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/2465 variables, 1/2010 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2465 variables, 0/2010 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 37 (OVERLAPS) 0/2465 variables, 0/2010 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2465/2465 variables, and 2010 constraints, problems are : Problem set: 0 solved, 9 unsolved in 31524 ms.
Refiners :[Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 1281/1281 constraints, ReadFeed: 183/183 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 87/87 constraints]
After SMT, in 37075ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 8076 ms.
Support contains 223 out of 1281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1281/1281 places, 1184/1184 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1281 transition count 1182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1279 transition count 1182
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 1279 transition count 1177
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 1274 transition count 1177
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 36 place count 1263 transition count 1166
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 1261 transition count 1168
Applied a total of 40 rules in 87 ms. Remains 1261 /1281 variables (removed 20) and now considering 1168/1184 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 1261/1281 places, 1168/1184 transitions.
RANDOM walk for 40000 steps (8 resets) in 763 ms. (52 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 367 ms. (108 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 488 ms. (81 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 398 ms. (100 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 381 ms. (104 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 281 ms. (141 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 94154 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :0 out of 9
Probabilistic random walk after 94154 steps, saw 60082 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
// Phase 1: matrix 1168 rows 1261 cols
[2024-05-29 01:37:17] [INFO ] Computed 450 invariants in 4 ms
[2024-05-29 01:37:17] [INFO ] State equation strengthened by 190 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 573/796 variables, 229/229 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/796 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 317/1113 variables, 151/380 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1113 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1075/2188 variables, 1113/1493 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2188 variables, 186/1679 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2188 variables, 0/1679 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 188/2376 variables, 112/1791 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2376 variables, 50/1841 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2376 variables, 4/1845 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2376 variables, 0/1845 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 3/2379 variables, 4/1849 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2379 variables, 3/1852 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2379 variables, 0/1852 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 4/2383 variables, 2/1854 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2383 variables, 0/1854 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 39/2422 variables, 28/1882 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2422 variables, 10/1892 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2422 variables, 0/1892 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 1/2423 variables, 2/1894 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2423 variables, 1/1895 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2423 variables, 0/1895 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 6/2429 variables, 4/1899 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2429 variables, 2/1901 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2429 variables, 0/1901 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (OVERLAPS) 0/2429 variables, 0/1901 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2429/2429 variables, and 1901 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5511 ms.
Refiners :[Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 1261/1261 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 573/796 variables, 229/229 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 01:37:23] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-05-29 01:37:23] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2024-05-29 01:37:23] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 2 ms to minimize.
[2024-05-29 01:37:23] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-05-29 01:37:23] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-05-29 01:37:23] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-29 01:37:23] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-29 01:37:23] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-29 01:37:23] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2024-05-29 01:37:23] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 2 ms to minimize.
[2024-05-29 01:37:23] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 2 ms to minimize.
[2024-05-29 01:37:23] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-29 01:37:23] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 2 ms to minimize.
[2024-05-29 01:37:24] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-29 01:37:24] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-05-29 01:37:24] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-29 01:37:24] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-29 01:37:24] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 1 ms to minimize.
[2024-05-29 01:37:24] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-29 01:37:24] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/796 variables, 20/249 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 01:37:24] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-29 01:37:24] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-05-29 01:37:24] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 2 ms to minimize.
[2024-05-29 01:37:24] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 2 ms to minimize.
[2024-05-29 01:37:25] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-05-29 01:37:25] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
[2024-05-29 01:37:25] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 2 ms to minimize.
[2024-05-29 01:37:25] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 2 ms to minimize.
[2024-05-29 01:37:25] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-05-29 01:37:25] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-29 01:37:25] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 2 ms to minimize.
[2024-05-29 01:37:25] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/796 variables, 12/261 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/796 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 317/1113 variables, 151/412 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 01:37:25] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 2 ms to minimize.
[2024-05-29 01:37:25] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-05-29 01:37:26] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2024-05-29 01:37:26] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 2 ms to minimize.
[2024-05-29 01:37:26] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2024-05-29 01:37:26] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 2 ms to minimize.
[2024-05-29 01:37:26] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 2 ms to minimize.
[2024-05-29 01:37:26] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2024-05-29 01:37:26] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 2 ms to minimize.
[2024-05-29 01:37:26] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-29 01:37:26] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 2 ms to minimize.
[2024-05-29 01:37:26] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2024-05-29 01:37:27] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2024-05-29 01:37:27] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 2 ms to minimize.
[2024-05-29 01:37:27] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 2 ms to minimize.
[2024-05-29 01:37:27] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 2 ms to minimize.
[2024-05-29 01:37:27] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1113 variables, 17/429 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 01:37:27] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2024-05-29 01:37:27] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 2 ms to minimize.
[2024-05-29 01:37:27] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2024-05-29 01:37:27] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 2 ms to minimize.
[2024-05-29 01:37:28] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 2 ms to minimize.
[2024-05-29 01:37:28] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-29 01:37:28] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1113 variables, 7/436 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1113 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1075/2188 variables, 1113/1549 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2188 variables, 186/1735 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2188 variables, 6/1741 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 01:37:30] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 3 ms to minimize.
[2024-05-29 01:37:30] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 3 ms to minimize.
[2024-05-29 01:37:30] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 3 ms to minimize.
[2024-05-29 01:37:30] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 3 ms to minimize.
[2024-05-29 01:37:30] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 3 ms to minimize.
[2024-05-29 01:37:31] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 3 ms to minimize.
[2024-05-29 01:37:31] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 3 ms to minimize.
[2024-05-29 01:37:31] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 3 ms to minimize.
[2024-05-29 01:37:31] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2188 variables, 9/1750 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 01:37:32] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2188 variables, 1/1751 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2188 variables, 0/1751 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 188/2376 variables, 112/1863 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2376 variables, 50/1913 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2376 variables, 4/1917 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2376 variables, 3/1920 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 01:37:36] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 3 ms to minimize.
[2024-05-29 01:37:36] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 3 ms to minimize.
[2024-05-29 01:37:36] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 3 ms to minimize.
[2024-05-29 01:37:37] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 2 ms to minimize.
[2024-05-29 01:37:37] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2376 variables, 5/1925 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 01:37:39] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 2 ms to minimize.
[2024-05-29 01:37:39] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 3 ms to minimize.
[2024-05-29 01:37:39] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/2376 variables, 3/1928 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2376 variables, 0/1928 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (OVERLAPS) 3/2379 variables, 4/1932 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2379 variables, 3/1935 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2379 variables, 0/1935 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (OVERLAPS) 4/2383 variables, 2/1937 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2383 variables, 0/1937 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (OVERLAPS) 39/2422 variables, 28/1965 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2422 variables, 10/1975 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2422 variables, 0/1975 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (OVERLAPS) 1/2423 variables, 2/1977 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2423 variables, 1/1978 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 01:37:46] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 2 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/2423 variables, 1/1979 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2423 variables, 0/1979 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 34 (OVERLAPS) 6/2429 variables, 4/1983 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2429 variables, 2/1985 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2429 variables, 0/1985 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 37 (OVERLAPS) 0/2429 variables, 0/1985 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2429/2429 variables, and 1985 constraints, problems are : Problem set: 0 solved, 9 unsolved in 28427 ms.
Refiners :[Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 1261/1261 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 75/75 constraints]
After SMT, in 33978ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 7114 ms.
Support contains 223 out of 1261 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1261/1261 places, 1168/1168 transitions.
Applied a total of 0 rules in 33 ms. Remains 1261 /1261 variables (removed 0) and now considering 1168/1168 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 1261/1261 places, 1168/1168 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1261/1261 places, 1168/1168 transitions.
Applied a total of 0 rules in 26 ms. Remains 1261 /1261 variables (removed 0) and now considering 1168/1168 (removed 0) transitions.
[2024-05-29 01:37:58] [INFO ] Invariant cache hit.
[2024-05-29 01:37:58] [INFO ] Implicit Places using invariants in 538 ms returned [1250]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 543 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1260/1261 places, 1168/1168 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1260 transition count 1167
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1259 transition count 1167
Applied a total of 2 rules in 32 ms. Remains 1259 /1260 variables (removed 1) and now considering 1167/1168 (removed 1) transitions.
// Phase 1: matrix 1167 rows 1259 cols
[2024-05-29 01:37:58] [INFO ] Computed 449 invariants in 6 ms
[2024-05-29 01:37:59] [INFO ] Implicit Places using invariants in 550 ms returned [1244]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 552 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1258/1261 places, 1167/1168 transitions.
Applied a total of 0 rules in 26 ms. Remains 1258 /1258 variables (removed 0) and now considering 1167/1167 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1179 ms. Remains : 1258/1261 places, 1167/1168 transitions.
RANDOM walk for 40000 steps (8 resets) in 667 ms. (59 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 320 ms. (124 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 232 ms. (171 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 378 ms. (105 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 361 ms. (110 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 240 ms. (165 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 333 ms. (119 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 97070 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :0 out of 9
Probabilistic random walk after 97070 steps, saw 60072 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
// Phase 1: matrix 1167 rows 1258 cols
[2024-05-29 01:38:03] [INFO ] Computed 448 invariants in 4 ms
[2024-05-29 01:38:03] [INFO ] State equation strengthened by 187 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 571/794 variables, 228/228 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/794 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 316/1110 variables, 150/378 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1110 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1074/2184 variables, 1110/1488 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2184 variables, 183/1671 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2184 variables, 0/1671 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 188/2372 variables, 112/1783 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2372 variables, 50/1833 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2372 variables, 4/1837 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2372 variables, 0/1837 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 3/2375 variables, 4/1841 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2375 variables, 3/1844 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2375 variables, 0/1844 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 4/2379 variables, 2/1846 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2379 variables, 0/1846 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 39/2418 variables, 28/1874 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2418 variables, 10/1884 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2418 variables, 0/1884 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 1/2419 variables, 2/1886 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2419 variables, 1/1887 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2419 variables, 0/1887 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 6/2425 variables, 4/1891 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2425 variables, 2/1893 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2425 variables, 0/1893 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (OVERLAPS) 0/2425 variables, 0/1893 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2425/2425 variables, and 1893 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5613 ms.
Refiners :[Positive P Invariants (semi-flows): 448/448 constraints, State Equation: 1258/1258 constraints, ReadFeed: 187/187 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 571/794 variables, 228/228 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 01:38:09] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 2 ms to minimize.
[2024-05-29 01:38:09] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2024-05-29 01:38:09] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 6 ms to minimize.
[2024-05-29 01:38:09] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-05-29 01:38:09] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2024-05-29 01:38:09] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 2 ms to minimize.
[2024-05-29 01:38:09] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-05-29 01:38:10] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
[2024-05-29 01:38:10] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 2 ms to minimize.
[2024-05-29 01:38:10] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-29 01:38:10] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 2 ms to minimize.
[2024-05-29 01:38:10] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2024-05-29 01:38:10] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-29 01:38:10] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-29 01:38:10] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-29 01:38:10] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 2 ms to minimize.
[2024-05-29 01:38:10] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 2 ms to minimize.
[2024-05-29 01:38:10] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-05-29 01:38:10] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 2 ms to minimize.
[2024-05-29 01:38:11] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/794 variables, 20/248 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 01:38:11] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-05-29 01:38:11] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 2 ms to minimize.
[2024-05-29 01:38:11] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 2 ms to minimize.
[2024-05-29 01:38:11] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 1 ms to minimize.
[2024-05-29 01:38:11] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 2 ms to minimize.
[2024-05-29 01:38:11] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2024-05-29 01:38:11] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 2 ms to minimize.
[2024-05-29 01:38:11] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-29 01:38:11] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
[2024-05-29 01:38:11] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-05-29 01:38:12] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 2 ms to minimize.
[2024-05-29 01:38:12] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 2 ms to minimize.
[2024-05-29 01:38:12] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 2 ms to minimize.
[2024-05-29 01:38:12] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-29 01:38:12] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/794 variables, 15/263 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 01:38:12] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/794 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/794 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 316/1110 variables, 150/414 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 01:38:12] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 2 ms to minimize.
[2024-05-29 01:38:13] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-29 01:38:13] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2024-05-29 01:38:13] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2024-05-29 01:38:13] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 1 ms to minimize.
[2024-05-29 01:38:13] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-05-29 01:38:13] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-05-29 01:38:13] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-05-29 01:38:13] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 2 ms to minimize.
[2024-05-29 01:38:13] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
[2024-05-29 01:38:13] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 2 ms to minimize.
[2024-05-29 01:38:13] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-29 01:38:14] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 2 ms to minimize.
[2024-05-29 01:38:14] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 2 ms to minimize.
[2024-05-29 01:38:14] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 2 ms to minimize.
[2024-05-29 01:38:14] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 2 ms to minimize.
[2024-05-29 01:38:14] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 2 ms to minimize.
[2024-05-29 01:38:14] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2024-05-29 01:38:14] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-05-29 01:38:14] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1110 variables, 20/434 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 01:38:15] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1110 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 01:38:15] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 2 ms to minimize.
[2024-05-29 01:38:15] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 2 ms to minimize.
[2024-05-29 01:38:15] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 2 ms to minimize.
[2024-05-29 01:38:15] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1110 variables, 4/439 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 01:38:15] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-05-29 01:38:16] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-05-29 01:38:16] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 2 ms to minimize.
[2024-05-29 01:38:16] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1110 variables, 4/443 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1110 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 1074/2184 variables, 1110/1553 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2184 variables, 183/1736 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2184 variables, 6/1742 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 01:38:18] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 3 ms to minimize.
[2024-05-29 01:38:18] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 3 ms to minimize.
[2024-05-29 01:38:19] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 3 ms to minimize.
[2024-05-29 01:38:19] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 3 ms to minimize.
[2024-05-29 01:38:19] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 3 ms to minimize.
[2024-05-29 01:38:19] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 3 ms to minimize.
[2024-05-29 01:38:19] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 3 ms to minimize.
[2024-05-29 01:38:20] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 3 ms to minimize.
[2024-05-29 01:38:20] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2184 variables, 9/1751 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2184 variables, 0/1751 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 188/2372 variables, 112/1863 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2372 variables, 50/1913 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2372 variables, 4/1917 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2372 variables, 3/1920 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 01:38:24] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 3 ms to minimize.
[2024-05-29 01:38:24] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 3 ms to minimize.
[2024-05-29 01:38:24] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 3 ms to minimize.
[2024-05-29 01:38:25] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 3 ms to minimize.
[2024-05-29 01:38:25] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 3 ms to minimize.
[2024-05-29 01:38:25] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 2 ms to minimize.
[2024-05-29 01:38:26] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 3 ms to minimize.
[2024-05-29 01:38:26] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 3 ms to minimize.
[2024-05-29 01:38:26] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 2 ms to minimize.
[2024-05-29 01:38:26] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 3 ms to minimize.
[2024-05-29 01:38:27] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/2372 variables, 11/1931 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2372 variables, 0/1931 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 3/2375 variables, 4/1935 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2375 variables, 3/1938 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 01:38:31] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 3 ms to minimize.
[2024-05-29 01:38:31] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 3 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/2375 variables, 2/1940 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2375 variables, 0/1940 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (OVERLAPS) 4/2379 variables, 2/1942 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2379 variables, 0/1942 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (OVERLAPS) 39/2418 variables, 28/1970 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2418 variables, 10/1980 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2418 variables, 0/1980 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (OVERLAPS) 1/2419 variables, 2/1982 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2419 variables, 1/1983 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 01:38:38] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 3 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/2419 variables, 1/1984 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2419 variables, 0/1984 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 36 (OVERLAPS) 6/2425 variables, 4/1988 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2425 variables, 2/1990 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2425 variables, 0/1990 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 39 (OVERLAPS) 0/2425 variables, 0/1990 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2425/2425 variables, and 1990 constraints, problems are : Problem set: 0 solved, 9 unsolved in 34215 ms.
Refiners :[Positive P Invariants (semi-flows): 448/448 constraints, State Equation: 1258/1258 constraints, ReadFeed: 187/187 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 88/88 constraints]
After SMT, in 39870ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 28104 ms.
Support contains 223 out of 1258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1258/1258 places, 1167/1167 transitions.
Applied a total of 0 rules in 24 ms. Remains 1258 /1258 variables (removed 0) and now considering 1167/1167 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 1258/1258 places, 1167/1167 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1258/1258 places, 1167/1167 transitions.
Applied a total of 0 rules in 23 ms. Remains 1258 /1258 variables (removed 0) and now considering 1167/1167 (removed 0) transitions.
[2024-05-29 01:39:11] [INFO ] Invariant cache hit.
[2024-05-29 01:39:12] [INFO ] Implicit Places using invariants in 521 ms returned []
[2024-05-29 01:39:12] [INFO ] Invariant cache hit.
[2024-05-29 01:39:12] [INFO ] State equation strengthened by 187 read => feed constraints.
[2024-05-29 01:39:15] [INFO ] Implicit Places using invariants and state equation in 3514 ms returned []
Implicit Place search using SMT with State Equation took 4037 ms to find 0 implicit places.
[2024-05-29 01:39:15] [INFO ] Redundant transitions in 72 ms returned []
Running 1151 sub problems to find dead transitions.
[2024-05-29 01:39:15] [INFO ] Invariant cache hit.
[2024-05-29 01:39:15] [INFO ] State equation strengthened by 187 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1242 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 1151 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 Real declared 1242/2425 variables, and 88 constraints, problems are : Problem set: 0 solved, 1151 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 88/448 constraints, State Equation: 0/1258 constraints, ReadFeed: 0/187 constraints, PredecessorRefiner: 1151/1151 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1242 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1242 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
At refinement iteration 2 (OVERLAPS) 16/1258 variables, 360/448 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
[2024-05-29 01:40:09] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-29 01:40:09] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-29 01:40:09] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2024-05-29 01:40:09] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-29 01:40:09] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2024-05-29 01:40:09] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-29 01:40:09] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-29 01:40:09] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-29 01:40:09] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-29 01:40:10] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2024-05-29 01:40:10] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-29 01:40:10] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 01:40:10] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-29 01:40:10] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-29 01:40:10] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-05-29 01:40:10] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-05-29 01:40:10] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-29 01:40:11] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-05-29 01:40:11] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-29 01:40:11] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1258 variables, 20/468 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
[2024-05-29 01:40:13] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-29 01:40:13] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-29 01:40:13] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-29 01:40:14] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-29 01:40:14] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-29 01:40:14] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-29 01:40:14] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-29 01:40:14] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2024-05-29 01:40:14] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 01:40:14] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 01:40:15] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 01:40:15] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2024-05-29 01:40:15] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2024-05-29 01:40:15] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-29 01:40:15] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-29 01:40:15] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-29 01:40:15] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-29 01:40:15] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-29 01:40:16] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 1)
(s11 0)
(s12 1)
(s13 0)
(s14 1)
(s15 0)
(s16 1)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 1)
(s37 0)
(s38 0)
(s39 1)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 1)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 1)
(s64 0)
(s65 1)
(s66 0)
(s67 1)
(s68 0)
(s69 1)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 1)
(s75 0)
(s76 0)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 1)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 1)
(s94 0)
(s95 1)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 1)
(s103 0)
(s104 0)
(s105 1)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 1)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 0)
(s119 1)
(s120 0)
(s121 1)
(s122 0)
(s123 1)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 1)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 1)
(s137 0)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 1)
(s162 0)
(s163 0)
(s164 0)
(s165 1)
(s166 0)
(s167 0)
(s168 0)
(s169 1)
(s170 0)
(s171 0)
(s172 0)
(s173 1)
(s174 0)
(s175 1)
(s176 1)
(s177 0)
(s178 0)
(s179 1)
(s180 1)
(s181 0)
(s182 0)
(s183 1)
(s184 0)
(s185 0)
(s186 1)
(s187 0)
(s188 0)
(s189 0)
(s190 1)
(s191 0)
(s192 1)
(s193 0)
(s194 1)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 1)
(s201 0)
(s202 1)
(s203 0)
(s204 1)
(s205 1)
(s206 0)
(s207 0)
(s208 0)
(s209 1)
(s210 0)
(s211 0)
(s212 0)
(s213 1)
(s214 1)
(s215 0)
(s216 0)
(s217 1)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 1)
(s224 0)
(s225 1)
(s226 0)
(s227 1)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 0)
(s235 0)
(s236 1)
(s237 0)
(s238 1)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 1)
(s247 0)
(s248 0)
(s249 0)
(s250 1)
(s251 0)
(s252 1)
(s253 0)
(s254 1)
(s255 0)
(s256 1)
(s257 0)
(s258 0)
(s259 1)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 1)
(s266 0)
(s267 0)
(s268 0)
(s269 1)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 1)
(s275 0)
(s276 0)
(s277 1)
(s278 0)
(s279 0)
(s280 1)
(s281 0)
(s282 1)
(s283 0)
(s284 1)
(s285 0)
(s286 0)
(s287 0)
(s288 1)
(s289 0)
(s290 1)
(s291 0)
(s292 0)
(s293 0)
(s294 1)
(s295 0)
(s296 0)
(s297 1)
(s298 0)
(s299 1)
(s300 1)
(s301 0)
(s302 0)
(s303 0)
(s304 1)
(s305 0)
(s306 1)
(s307 0)
(s308 1)
(s309 1)
(s310 0)
(s311 0)
(s312 0)
(s313 1)
(s314 0)
(s315 1)
(s316 0)
(s317 0)
(s318 1)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 1)
(s324 0)
(s325 1)
(s326 0)
(s327 1)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 1)
(s334 1)
(s335 0)
(s336 0)
(s337 1)
(s338 0)
(s339 0)
(s340 0)
(s341 1)
(s342 0)
(s343 0)
(s344 0)
(s345 1)
(s346 1)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 1)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 1)
(s362 1)
(s363 0)
(s364 0)
(s365 0)
(s366 1)
(s367 0)
(s368 1)
(s369 0)
(s370 1)
(s371 0)
(s372 0)
(s373 0)
(s374 1)
(s375 0)
(s376 1)
(s377 0)
(s378 0)
(s379 0)
(s380 1)
(s381 0)
(s382 1)
(s383 1)
(s384 0)
(s385 0)
(s386 1)
(s387 0)
(s388 1)
(s389 0)
(s390 1)
(s391 0)
(s392 0)
(s393 1)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 1)
(s400 0)
(s401 0)
(s402 1)
(s403 0)
(s404 0)
(s405 1)
(s406 0)
(s407 1)
(s408 0)
(s409 1)
(s410 0)
(s411 1)
(s412 0)
(s413 1)
(s414 0)
(s415 1)
(s416 0)
(s417 0)
(s418 0)
(s419 1)
(s420 0)
(s421 0)
(s422 1)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 1)
(s428 0)
(s429 0)
(s430 1)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 1)
(s437 0)
(s438 0)
(s439 1)
(s440 1)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 1)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 1)
(s452 0)
(s453 1)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 1)
(s460 0)
(s461 0)
(s462 0)
(s463 1)
(s464 0)
(s465 1)
(s466 0)
(s467 1)
(s468 0)
(s469 1)
(s470 0)
(s471 0)
(s472 1)
(s473 0)
(s474 0)
(s475 1)
(s476 0)
(s477 0)
(s478 1)
(s479 0)
(s480 0)
(s481 0)
(s482 1)
(s483 0)
(s484 0)
(s485 0)
(s486 1)
(s487 0)
(s488 0)
(s489 1)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 1)
(s496 0)
(s497 1)
(s498 0)
(s499 0)
(s500 1)
(s501 0)
(s502 1)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 1)
(s508 0)
(s509 1)
(s510 0)
(s511 1)
(s512 0)
(s513 0)
(s514 1)
(s515 0)
(s516 1)
(s517 0)
(s518 1)
(s519 0)
(s520 1)
(s521 0)
(s522 1)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 1)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 1)
(s534 0)
(s535 0)
(s536 1)
(s537 0)
(s538 0)
(s539 1)
(s540 0)
(s541 0)
(s542 0)
(s543 1)
(s544 0)
(s545 1)
(s546 0)
(s547 1)
(s548 0)
(s549 0)
(s550 1)
(s551 0)
(s552 0)
(s553 1)
(s554 0)
(s555 1)
(s556 0)
(s557 0)
(s558 1)
(s559 0)
(s560 1)
(s561 1)
(s562 0)
(s563 0)
(s564 1)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 1)
(s571 0)
(s572 1)
(s573 0)
(s574 1)
(s575 1)
(s576 0)
(s577 0)
(s578 0)
(s579 1)
(s580 1)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 1)
(s588 0)
(s589 0)
(s590 0)
(s591 1)
(s592 0)
(s593 1)
(s594 0)
(s595 1)
(s596 0)
(s597 1)
(s598 0)
(s599 0)
(s600 0)
(s601 1)
(s602 1)
(s603 0)
(s604 0)
(s605 1)
(s606 0)
(s607 1)
(s608 1)
(s609 0)
(s610 0)
(s611 0)
(s612 1)
(s613 0)
(s614 1)
(s615 0)
(s616 1)
(s617 0)
(s618 0)
(s619 1)
(s620 0)
(s621 0)
(s622 1)
(s623 0)
(s624 0)
(s625 0)
(s626 1)
(s627 0)
(s628 0)
(s629 1)
(s630 1)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 1)
(s637 0)
(s638 0)
(s639 0)
(s640 1)
(s641 1)
(s642 0)
(s643 0)
(s644 1)
(s645 0)
(s646 1)
(s647 0)
(s648 1)
(s649 1)
(s650 0)
(s651 0)
(s652 1)
(s653 0)
(s654 1)
(s655 1)
(s656 0)
(s657 0)
(s658 1)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 1)
(s665 0)
(s666 1)
(s667 0)
(s668 0)
(s669 0)
(s670 1)
(s671 1)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 1)
(s677 0)
(s678 1)
(s679 0)
(s680 0)
(s681 1)
(s682 0)
(s683 0)
(s684 0)
(s685 1)
(s686 0)
(s687 1)
(s688 0)
(s689 1)
(s690 0)
(s691 1)
(s692 0)
(s693 0)
(s694 1)
(s695 1)
(s696 0)
(s697 0)
(s698 1)
(s699 0)
(s700 0)
(s701 1)
(s702 0)
(s703 1)
(s704 0)
(s705 0)
(s706 1)
(s707 0)
(s708 1)
(s709 0)
(s710 1)
(s711 0)
(s712 1)
(s713 0)
(s714 1)
(s715 0)
(s716 1)
(s717 0)
(s718 0)
(s719 0)
(s720 1)
(s721 0)
(s722 0)
(s723 0)
(s724 0)
(s725 1)
(s726 0)
(s727 0)
(s728 0)
(s729 0)
(s730 0)
(s731 0)
(s732 1)
(s733 0)
(s734 0)
(s735 0)
(s736 1)
(s737 0)
(s738 1)
(s739 0)
(s740 1)
(s741 0)
(s742 1)
(s743 0)
(s744 1)
(s745 1)
(s746 0)
(s747 0)
(s748 1)
(s749 0)
(s750 1)
(s751 0)
(s752 1)
(s753 0)
(s754 0)
(s755 1)
(s756 0)
(s757 1)
(s758 0)
(s759 1)
(s760 0)
(s761 1)
(s762 0)
(s763 0)
(s764 1)
(s765 0)
(s766 1)
(s767 0)
(s768 1)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 1)
(s774 0)
(s775 0)
(s776 0)
(s777 1)
(s778 0)
(s779 0)
(s780 1)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 0)
(s787 1)
(s788 1)
(s789 0)
(s790 0)
(s791 1)
(s792 0)
(s793 1)
(s794 0)
(s795 1)
(s796 0)
(s797 0)
(s798 0)
(s799 1)
(s800 0)
(s801 0)
(s802 0)
(s803 1)
(s804 0)
(s805 0)
(s806 1)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 0)
(s812 1)
(s813 0)
(s814 1)
(s815 0)
(s816 1)
(s817 0)
(s818 1)
(s819 0)
(s820 0)
(s821 1)
(s822 0)
(s823 0)
(s824 1)
(s825 0)
(s826 0)
(s827 0)
(s828 0)
(s829 1)
(s830 0)
(s831 0)
(s832 1)
(s833 0)
(s834 0)
(s835 0)
(s836 0)
(s837 1)
(s838 0)
(s839 0)
(s840 1)
(s841 0)
(s842 1)
(s843 0)
(s844 0)
(s845 1)
(s846 0)
(s847 0)
(s848 0)
(s849 1)
(s850 0)
(s851 0)
(s852 1)
(s853 0)
(s854 1)
(s855 0)
(s856 0)
(s857 1)
(s858 0)
(s859 1)
(s860 1)
(s861 0)
(s862 0)
(s863 1)
(s864 0)
(s865 0)
(s866 1)
(s867 0)
(s868 1)
(s869 0)
(s870 1)
(s871 0)
(s872 0)
(s873 1)
(s874 1)
(s875 0)
(s876 0)
(s877 0)
(s878 1)
(s879 0)
(s880 1)
(s881 0)
(s882 1)
(s883 0)
(s884 1)
(s885 1)
(s886 0)
(s887 0)
(s888 1)
(s889 0)
(s890 0)
(s891 0)
(s892 0)
(s893 1)
(s894 0)
(s895 1)
(s896 0)
(s897 0)
(s898 1)
(s899 0)
(s900 0)
(s901 0)
(s902 1)
(s903 0)
(s904 1)
(s905 0)
(s906 1)
(s907 0)
(s908 1)
(s909 0)
(s910 1)
(s911 1)
(s912 0)
(s913 0)
(s914 0)
(s915 1)
(s916 0)
(s917 0)
(s918 1)
(s919 0)
(s920 0)
(s921 0)
(s922 1)
(s923 0)
(s924 0)
(s925 0)
(s926 1)
(s927 0)
(s928 1)
(s929 0)
(s930 1)
(s931 1)
(s932 0)
(s933 0)
(s934 1)
(s935 1)
(s936 0)
(s937 0)
(s938 0)
(s939 1)
(s940 0)
(s941 0)
(s942 0)
(s943 1)
(s944 0)
(s945 1)
(s946 0)
(s947 0)
(s948 1)
(s949 0)
(s950 0)
(s951 0)
(s952 0)
(s953 0)
(s954 1)
(s955 0)
(s956 1)
(s957 0)
(s958 0)
(s959 0)
(s960 1)
(s961 0)
(s962 0)
(s963 0)
(s964 1)
(s965 0)
(s966 0)
(s967 0)
(s968 0)
(s969 1)
(s970 0)
(s971 0)
(s972 0)
(s973 1)
(s974 0)
(s975 0)
(s976 1)
(s977 0)
(s978 1)
(s979 0)
(s980 0)
(s981 1)
(s982 0)
(s983 1)
(s984 1)
(s985 0)
(s986 1)
(s987 0)
(s988 1)
(s989 0)
(s990 0)
(s991 1)
(s992 1)
(s993 0)
(s994 1)
(s995 0)
(s996 0)
(s997 0)
(s998 1)
(s999 1)
(s1000 0)
(s1001 0)
(s1002 1)
(s1003 0)
(s1004 0)
(s1005 1)
(s1006 0)
(s1007 1)
(s1008 0)
(s1009 0)
(s1010 1)
(s1011 0)
(s1012 0)
(s1013 0)
(s1014 0)
(s1015 1)
(s1016 0)
(s1017 1)
(s1018 1)
(s1019 0)
(s1020 0)
(s1021 0)
(s1022 1)
(s1023 0)
(s1024 1)
(s1025 0)
(s1026 1)
(s1027 0)
(s1028 1)
(s1029 0)
(s1030 1)
(s1031 1)
(s1032 0)
(s1033 0)
(s1034 0)
(s1035 1)
(s1036 0)
(s1037 1)
(s1038 0)
(s1039 0)
(s1040 0)
(s1041 1)
(s1042 0)
(s1043 0)
(s1044 0)
(s1045 1)
(s1046 0)
(s1047 1)
(s1048 0)
(s1049 1)
(s1050 0)
(s1051 1)
(s1052 0)
(s1053 0)
(s1054 1)
(s1055 1)
(s1056 0)
(s1057 0)
(s1058 1)
(s1059 0)
(s1060 0)
(s1061 1)
(s1062 0)
(s1063 0)
(s1064 0)
(s1065 1)
(s1066 0)
(s1067 0)
(s1068 0)
(s1069 1)
(s1070 0)
(s1071 1)
(s1072 0)
(s1073 1)
(s1074 0)
(s1075 1)
(s1076 0)
(s1077 1)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1258/2425 variables, and 487 constraints, problems are : Problem set: 0 solved, 1151 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 448/448 constraints, State Equation: 0/1258 constraints, ReadFeed: 0/187 constraints, PredecessorRefiner: 0/1151 constraints, Known Traps: 39/39 constraints]
After SMT, in 60419ms problems are : Problem set: 0 solved, 1151 unsolved
Search for dead transitions found 0 dead transitions in 60433ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64576 ms. Remains : 1258/1258 places, 1167/1167 transitions.
[2024-05-29 01:40:16] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-05-29 01:40:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1258 places, 1167 transitions and 4903 arcs took 10 ms.
[2024-05-29 01:40:16] [INFO ] Flatten gal took : 154 ms
Total runtime 467320 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running ShieldIIPt-PT-050B
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1258
TRANSITIONS: 1167
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.030s, Sys 0.005s]
SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.004s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 2545
MODEL NAME: /home/mcc/execution/410/model
1258 places, 1167 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-050B"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldIIPt-PT-050B, examination is ReachabilityFireability"
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-171683758500335"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-050B.tgz
mv ShieldIIPt-PT-050B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;