About the Execution of LTSMin+red for Peterson-PT-4
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 691.119 | 1393754.00 | 3707047.00 | 1820.30 | FT?TFFFFFFFFFTFF | 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.r512-smll-171654407300268.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 ltsminxred
Input is Peterson-PT-4, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407300268
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 48K Apr 12 02:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 222K Apr 12 02:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 57K Apr 12 02:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 270K Apr 12 02:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 29K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 23K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 75K Apr 12 03:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 304K Apr 12 03:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 212K Apr 12 03:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 982K Apr 12 03:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 298K 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 Peterson-PT-4-LTLFireability-00
FORMULA_NAME Peterson-PT-4-LTLFireability-01
FORMULA_NAME Peterson-PT-4-LTLFireability-02
FORMULA_NAME Peterson-PT-4-LTLFireability-03
FORMULA_NAME Peterson-PT-4-LTLFireability-04
FORMULA_NAME Peterson-PT-4-LTLFireability-05
FORMULA_NAME Peterson-PT-4-LTLFireability-06
FORMULA_NAME Peterson-PT-4-LTLFireability-07
FORMULA_NAME Peterson-PT-4-LTLFireability-08
FORMULA_NAME Peterson-PT-4-LTLFireability-09
FORMULA_NAME Peterson-PT-4-LTLFireability-10
FORMULA_NAME Peterson-PT-4-LTLFireability-11
FORMULA_NAME Peterson-PT-4-LTLFireability-12
FORMULA_NAME Peterson-PT-4-LTLFireability-13
FORMULA_NAME Peterson-PT-4-LTLFireability-14
FORMULA_NAME Peterson-PT-4-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717271374342
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:49:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 19:49:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:49:36] [INFO ] Load time of PNML (sax parser for PT used): 219 ms
[2024-06-01 19:49:36] [INFO ] Transformed 480 places.
[2024-06-01 19:49:36] [INFO ] Transformed 690 transitions.
[2024-06-01 19:49:36] [INFO ] Found NUPN structural information;
[2024-06-01 19:49:36] [INFO ] Parsed PT model containing 480 places and 690 transitions and 2120 arcs in 374 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Peterson-PT-4-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 383 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 63 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2024-06-01 19:49:36] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2024-06-01 19:49:36] [INFO ] Computed 19 invariants in 27 ms
[2024-06-01 19:49:37] [INFO ] Implicit Places using invariants in 758 ms returned []
[2024-06-01 19:49:37] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-06-01 19:49:37] [INFO ] Invariant cache hit.
[2024-06-01 19:49:38] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 19:49:38] [INFO ] Implicit Places using invariants and state equation in 906 ms returned []
Implicit Place search using SMT with State Equation took 1725 ms to find 0 implicit places.
Running 685 sub problems to find dead transitions.
[2024-06-01 19:49:38] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-06-01 19:49:38] [INFO ] Invariant cache hit.
[2024-06-01 19:49:38] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 475/475 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 4/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 3 (OVERLAPS) 5/480 variables, 10/489 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 5/494 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 5/499 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:50:00] [INFO ] Deduced a trap composed of 10 places in 342 ms of which 38 ms to minimize.
[2024-06-01 19:50:00] [INFO ] Deduced a trap composed of 35 places in 535 ms of which 6 ms to minimize.
[2024-06-01 19:50:01] [INFO ] Deduced a trap composed of 27 places in 342 ms of which 26 ms to minimize.
[2024-06-01 19:50:01] [INFO ] Deduced a trap composed of 36 places in 318 ms of which 16 ms to minimize.
[2024-06-01 19:50:01] [INFO ] Deduced a trap composed of 36 places in 211 ms of which 4 ms to minimize.
[2024-06-01 19:50:02] [INFO ] Deduced a trap composed of 45 places in 269 ms of which 4 ms to minimize.
[2024-06-01 19:50:02] [INFO ] Deduced a trap composed of 54 places in 252 ms of which 4 ms to minimize.
[2024-06-01 19:50:02] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 5 ms to minimize.
[2024-06-01 19:50:02] [INFO ] Deduced a trap composed of 58 places in 198 ms of which 3 ms to minimize.
[2024-06-01 19:50:03] [INFO ] Deduced a trap composed of 14 places in 256 ms of which 5 ms to minimize.
[2024-06-01 19:50:03] [INFO ] Deduced a trap composed of 17 places in 270 ms of which 4 ms to minimize.
[2024-06-01 19:50:03] [INFO ] Deduced a trap composed of 13 places in 270 ms of which 4 ms to minimize.
[2024-06-01 19:50:04] [INFO ] Deduced a trap composed of 18 places in 274 ms of which 5 ms to minimize.
[2024-06-01 19:50:04] [INFO ] Deduced a trap composed of 10 places in 287 ms of which 4 ms to minimize.
[2024-06-01 19:50:04] [INFO ] Deduced a trap composed of 54 places in 219 ms of which 4 ms to minimize.
[2024-06-01 19:50:04] [INFO ] Deduced a trap composed of 60 places in 172 ms of which 3 ms to minimize.
[2024-06-01 19:50:04] [INFO ] Deduced a trap composed of 64 places in 146 ms of which 3 ms to minimize.
[2024-06-01 19:50:05] [INFO ] Deduced a trap composed of 39 places in 260 ms of which 4 ms to minimize.
[2024-06-01 19:50:05] [INFO ] Deduced a trap composed of 40 places in 228 ms of which 4 ms to minimize.
[2024-06-01 19:50:05] [INFO ] Deduced a trap composed of 18 places in 271 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 20/519 constraints. Problems are: Problem set: 0 solved, 685 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 480/1110 variables, and 519 constraints, problems are : Problem set: 0 solved, 685 unsolved in 30042 ms.
Refiners :[Domain max(s): 480/480 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/480 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 685/685 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 685 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 475/475 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 4/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 20/499 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 4 (OVERLAPS) 5/480 variables, 10/509 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 5/514 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 5/519 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:50:18] [INFO ] Deduced a trap composed of 14 places in 252 ms of which 4 ms to minimize.
[2024-06-01 19:50:18] [INFO ] Deduced a trap composed of 57 places in 226 ms of which 3 ms to minimize.
[2024-06-01 19:50:19] [INFO ] Deduced a trap composed of 86 places in 222 ms of which 3 ms to minimize.
[2024-06-01 19:50:19] [INFO ] Deduced a trap composed of 83 places in 214 ms of which 4 ms to minimize.
[2024-06-01 19:50:19] [INFO ] Deduced a trap composed of 84 places in 215 ms of which 4 ms to minimize.
[2024-06-01 19:50:19] [INFO ] Deduced a trap composed of 65 places in 193 ms of which 3 ms to minimize.
[2024-06-01 19:50:19] [INFO ] Deduced a trap composed of 62 places in 192 ms of which 3 ms to minimize.
[2024-06-01 19:50:20] [INFO ] Deduced a trap composed of 62 places in 198 ms of which 3 ms to minimize.
[2024-06-01 19:50:20] [INFO ] Deduced a trap composed of 96 places in 156 ms of which 3 ms to minimize.
[2024-06-01 19:50:20] [INFO ] Deduced a trap composed of 39 places in 243 ms of which 3 ms to minimize.
[2024-06-01 19:50:20] [INFO ] Deduced a trap composed of 61 places in 186 ms of which 3 ms to minimize.
[2024-06-01 19:50:20] [INFO ] Deduced a trap composed of 61 places in 187 ms of which 3 ms to minimize.
[2024-06-01 19:50:21] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 3 ms to minimize.
[2024-06-01 19:50:21] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 4 ms to minimize.
[2024-06-01 19:50:21] [INFO ] Deduced a trap composed of 21 places in 253 ms of which 4 ms to minimize.
[2024-06-01 19:50:21] [INFO ] Deduced a trap composed of 40 places in 225 ms of which 4 ms to minimize.
[2024-06-01 19:50:22] [INFO ] Deduced a trap composed of 25 places in 205 ms of which 4 ms to minimize.
[2024-06-01 19:50:22] [INFO ] Deduced a trap composed of 65 places in 193 ms of which 3 ms to minimize.
[2024-06-01 19:50:22] [INFO ] Deduced a trap composed of 65 places in 202 ms of which 3 ms to minimize.
[2024-06-01 19:50:22] [INFO ] Deduced a trap composed of 65 places in 204 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 20/539 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:50:24] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 4 ms to minimize.
[2024-06-01 19:50:24] [INFO ] Deduced a trap composed of 32 places in 259 ms of which 4 ms to minimize.
[2024-06-01 19:50:24] [INFO ] Deduced a trap composed of 102 places in 241 ms of which 4 ms to minimize.
[2024-06-01 19:50:24] [INFO ] Deduced a trap composed of 62 places in 253 ms of which 4 ms to minimize.
[2024-06-01 19:50:25] [INFO ] Deduced a trap composed of 48 places in 209 ms of which 3 ms to minimize.
[2024-06-01 19:50:25] [INFO ] Deduced a trap composed of 62 places in 283 ms of which 4 ms to minimize.
[2024-06-01 19:50:25] [INFO ] Deduced a trap composed of 62 places in 214 ms of which 4 ms to minimize.
[2024-06-01 19:50:25] [INFO ] Deduced a trap composed of 43 places in 189 ms of which 4 ms to minimize.
[2024-06-01 19:50:26] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 3 ms to minimize.
[2024-06-01 19:50:26] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 2 ms to minimize.
[2024-06-01 19:50:26] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 3 ms to minimize.
[2024-06-01 19:50:26] [INFO ] Deduced a trap composed of 80 places in 94 ms of which 2 ms to minimize.
[2024-06-01 19:50:26] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 2 ms to minimize.
[2024-06-01 19:50:26] [INFO ] Deduced a trap composed of 58 places in 134 ms of which 3 ms to minimize.
[2024-06-01 19:50:26] [INFO ] Deduced a trap composed of 42 places in 146 ms of which 3 ms to minimize.
[2024-06-01 19:50:27] [INFO ] Deduced a trap composed of 54 places in 136 ms of which 3 ms to minimize.
[2024-06-01 19:50:27] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 3 ms to minimize.
[2024-06-01 19:50:27] [INFO ] Deduced a trap composed of 43 places in 166 ms of which 3 ms to minimize.
[2024-06-01 19:50:27] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 2 ms to minimize.
[2024-06-01 19:50:27] [INFO ] Deduced a trap composed of 50 places in 114 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 20/559 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:50:30] [INFO ] Deduced a trap composed of 88 places in 156 ms of which 3 ms to minimize.
[2024-06-01 19:50:30] [INFO ] Deduced a trap composed of 87 places in 147 ms of which 3 ms to minimize.
[2024-06-01 19:50:30] [INFO ] Deduced a trap composed of 87 places in 171 ms of which 3 ms to minimize.
[2024-06-01 19:50:30] [INFO ] Deduced a trap composed of 112 places in 153 ms of which 3 ms to minimize.
[2024-06-01 19:50:31] [INFO ] Deduced a trap composed of 128 places in 154 ms of which 3 ms to minimize.
[2024-06-01 19:50:31] [INFO ] Deduced a trap composed of 36 places in 299 ms of which 5 ms to minimize.
[2024-06-01 19:50:31] [INFO ] Deduced a trap composed of 83 places in 124 ms of which 2 ms to minimize.
[2024-06-01 19:50:31] [INFO ] Deduced a trap composed of 35 places in 243 ms of which 4 ms to minimize.
[2024-06-01 19:50:32] [INFO ] Deduced a trap composed of 76 places in 146 ms of which 3 ms to minimize.
[2024-06-01 19:50:32] [INFO ] Deduced a trap composed of 76 places in 159 ms of which 3 ms to minimize.
[2024-06-01 19:50:32] [INFO ] Deduced a trap composed of 47 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:50:32] [INFO ] Deduced a trap composed of 58 places in 134 ms of which 3 ms to minimize.
[2024-06-01 19:50:32] [INFO ] Deduced a trap composed of 76 places in 145 ms of which 3 ms to minimize.
[2024-06-01 19:50:33] [INFO ] Deduced a trap composed of 76 places in 156 ms of which 3 ms to minimize.
[2024-06-01 19:50:33] [INFO ] Deduced a trap composed of 92 places in 166 ms of which 3 ms to minimize.
[2024-06-01 19:50:33] [INFO ] Deduced a trap composed of 92 places in 153 ms of which 3 ms to minimize.
[2024-06-01 19:50:33] [INFO ] Deduced a trap composed of 92 places in 163 ms of which 3 ms to minimize.
[2024-06-01 19:50:33] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 1 ms to minimize.
[2024-06-01 19:50:33] [INFO ] Deduced a trap composed of 69 places in 87 ms of which 2 ms to minimize.
[2024-06-01 19:50:34] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/480 variables, 20/579 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:50:37] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:50:38] [INFO ] Deduced a trap composed of 54 places in 237 ms of which 3 ms to minimize.
[2024-06-01 19:50:38] [INFO ] Deduced a trap composed of 84 places in 202 ms of which 3 ms to minimize.
[2024-06-01 19:50:38] [INFO ] Deduced a trap composed of 84 places in 225 ms of which 3 ms to minimize.
[2024-06-01 19:50:38] [INFO ] Deduced a trap composed of 83 places in 180 ms of which 4 ms to minimize.
[2024-06-01 19:50:39] [INFO ] Deduced a trap composed of 119 places in 127 ms of which 3 ms to minimize.
SMT process timed out in 60482ms, After SMT, problems are : Problem set: 0 solved, 685 unsolved
Search for dead transitions found 0 dead transitions in 60520ms
Finished structural reductions in LTL mode , in 1 iterations and 62360 ms. Remains : 480/480 places, 690/690 transitions.
Support contains 383 out of 480 places after structural reductions.
[2024-06-01 19:50:39] [INFO ] Flatten gal took : 104 ms
[2024-06-01 19:50:39] [INFO ] Flatten gal took : 64 ms
[2024-06-01 19:50:39] [INFO ] Input system was already deterministic with 690 transitions.
Reduction of identical properties reduced properties to check from 29 to 25
RANDOM walk for 40000 steps (8 resets) in 3424 ms. (11 steps per ms) remains 10/25 properties
BEST_FIRST walk for 40004 steps (8 resets) in 471 ms. (84 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 10/10 properties
[2024-06-01 19:50:41] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-06-01 19:50:41] [INFO ] Invariant cache hit.
[2024-06-01 19:50:41] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp17 is UNSAT
At refinement iteration 4 (OVERLAPS) 437/465 variables, 10/44 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 437/481 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-06-01 19:50:41] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-06-01 19:50:41] [INFO ] Deduced a trap composed of 128 places in 104 ms of which 2 ms to minimize.
[2024-06-01 19:50:41] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:50:42] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 3 ms to minimize.
[2024-06-01 19:50:42] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 2 ms to minimize.
[2024-06-01 19:50:42] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 2 ms to minimize.
[2024-06-01 19:50:42] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:50:42] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 2 ms to minimize.
[2024-06-01 19:50:42] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 2 ms to minimize.
[2024-06-01 19:50:42] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-06-01 19:50:42] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 3 ms to minimize.
[2024-06-01 19:50:42] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 3 ms to minimize.
[2024-06-01 19:50:43] [INFO ] Deduced a trap composed of 144 places in 95 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 13/494 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-06-01 19:50:43] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-06-01 19:50:43] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-06-01 19:50:43] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/465 variables, 3/497 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-06-01 19:50:43] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/465 variables, 1/498 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-06-01 19:50:43] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 3 ms to minimize.
[2024-06-01 19:50:43] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/465 variables, 2/500 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 0/500 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 630/1095 variables, 465/965 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1095 variables, 116/1081 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-06-01 19:50:44] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1095 variables, 1/1082 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1095 variables, 0/1082 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 15/1110 variables, 15/1097 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1110 variables, 15/1112 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1110 variables, 3/1115 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1110 variables, 0/1115 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 0/1110 variables, 0/1115 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1110/1110 variables, and 1115 constraints, problems are : Problem set: 1 solved, 9 unsolved in 4521 ms.
Refiners :[Domain max(s): 480/480 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 480/480 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 1 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 5/30 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 436/460 variables, 9/39 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 436/475 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 4/479 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 0/479 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 630/1090 variables, 460/939 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1090 variables, 116/1055 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 8/1063 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1090 variables, 0/1063 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 20/1110 variables, 20/1083 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1110 variables, 20/1103 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1110 variables, 4/1107 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1110 variables, 1/1108 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1110 variables, 16/1124 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-06-01 19:50:47] [INFO ] Deduced a trap composed of 69 places in 245 ms of which 4 ms to minimize.
[2024-06-01 19:50:48] [INFO ] Deduced a trap composed of 101 places in 243 ms of which 4 ms to minimize.
[2024-06-01 19:50:48] [INFO ] Deduced a trap composed of 101 places in 247 ms of which 4 ms to minimize.
[2024-06-01 19:50:48] [INFO ] Deduced a trap composed of 91 places in 238 ms of which 4 ms to minimize.
[2024-06-01 19:50:48] [INFO ] Deduced a trap composed of 48 places in 254 ms of which 4 ms to minimize.
[2024-06-01 19:50:49] [INFO ] Deduced a trap composed of 39 places in 244 ms of which 4 ms to minimize.
[2024-06-01 19:50:49] [INFO ] Deduced a trap composed of 93 places in 221 ms of which 3 ms to minimize.
[2024-06-01 19:50:49] [INFO ] Deduced a trap composed of 69 places in 250 ms of which 4 ms to minimize.
[2024-06-01 19:50:49] [INFO ] Deduced a trap composed of 93 places in 235 ms of which 3 ms to minimize.
[2024-06-01 19:50:50] [INFO ] Deduced a trap composed of 40 places in 237 ms of which 3 ms to minimize.
[2024-06-01 19:50:50] [INFO ] Deduced a trap composed of 39 places in 211 ms of which 3 ms to minimize.
[2024-06-01 19:50:50] [INFO ] Deduced a trap composed of 64 places in 249 ms of which 3 ms to minimize.
[2024-06-01 19:50:50] [INFO ] Deduced a trap composed of 91 places in 193 ms of which 3 ms to minimize.
SMT process timed out in 9637ms, After SMT, problems are : Problem set: 1 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 24 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 186 transitions
Trivial Post-agglo rules discarded 186 transitions
Performed 186 trivial Post agglomeration. Transition count delta: 186
Iterating post reduction 0 with 186 rules applied. Total rules applied 186 place count 480 transition count 504
Reduce places removed 186 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 190 rules applied. Total rules applied 376 place count 294 transition count 500
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 380 place count 290 transition count 500
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 95 Pre rules applied. Total rules applied 380 place count 290 transition count 405
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 570 place count 195 transition count 405
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 596 place count 182 transition count 392
Applied a total of 596 rules in 107 ms. Remains 182 /480 variables (removed 298) and now considering 392/690 (removed 298) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 182/480 places, 392/690 transitions.
RANDOM walk for 40000 steps (8 resets) in 568 ms. (70 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 500214 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :0 out of 9
Probabilistic random walk after 500214 steps, saw 83742 distinct states, run finished after 3020 ms. (steps per millisecond=165 ) properties seen :0
[2024-06-01 19:50:54] [INFO ] Flow matrix only has 332 transitions (discarded 60 similar events)
// Phase 1: matrix 332 rows 182 cols
[2024-06-01 19:50:54] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 19:50:54] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 138/162 variables, 10/38 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 138/176 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 19:50:54] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:50:54] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:50:54] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 2 ms to minimize.
[2024-06-01 19:50:55] [INFO ] Deduced a trap composed of 55 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 4/181 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 332/494 variables, 162/343 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/494 variables, 116/459 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/494 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 20/514 variables, 20/479 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/514 variables, 20/499 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/514 variables, 4/503 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/514 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 0/514 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 514/514 variables, and 503 constraints, problems are : Problem set: 0 solved, 9 unsolved in 901 ms.
Refiners :[Domain max(s): 182/182 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 182/182 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 138/162 variables, 10/38 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 138/176 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 4/181 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 332/494 variables, 162/343 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/494 variables, 116/459 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/494 variables, 8/467 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/494 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 20/514 variables, 20/487 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/514 variables, 20/507 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/514 variables, 4/511 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/514 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 19:50:56] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
[2024-06-01 19:50:56] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
[2024-06-01 19:50:56] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 2 ms to minimize.
[2024-06-01 19:50:56] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 2 ms to minimize.
[2024-06-01 19:50:56] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 2 ms to minimize.
[2024-06-01 19:50:56] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 2 ms to minimize.
[2024-06-01 19:50:56] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 2 ms to minimize.
[2024-06-01 19:50:56] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
[2024-06-01 19:50:56] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 2 ms to minimize.
[2024-06-01 19:50:57] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 2 ms to minimize.
[2024-06-01 19:50:57] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-06-01 19:50:57] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:50:57] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-06-01 19:50:57] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 1 ms to minimize.
[2024-06-01 19:50:57] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 2 ms to minimize.
[2024-06-01 19:50:57] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:50:57] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:50:57] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 2 ms to minimize.
[2024-06-01 19:50:57] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
[2024-06-01 19:50:57] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/514 variables, 20/532 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 19:50:58] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 2 ms to minimize.
[2024-06-01 19:50:58] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 2 ms to minimize.
[2024-06-01 19:50:58] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 2 ms to minimize.
[2024-06-01 19:50:58] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:50:58] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:50:58] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 1 ms to minimize.
[2024-06-01 19:50:58] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:50:58] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:50:58] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:50:58] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
[2024-06-01 19:50:59] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-06-01 19:50:59] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 2 ms to minimize.
[2024-06-01 19:50:59] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-06-01 19:50:59] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:50:59] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 2 ms to minimize.
[2024-06-01 19:50:59] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 2 ms to minimize.
[2024-06-01 19:50:59] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:50:59] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/514 variables, 18/550 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 19:51:00] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
[2024-06-01 19:51:00] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:51:00] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:51:00] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/514 variables, 4/554 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/514 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 0/514 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 514/514 variables, and 554 constraints, problems are : Problem set: 0 solved, 9 unsolved in 6029 ms.
Refiners :[Domain max(s): 182/182 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 182/182 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 46/46 constraints]
After SMT, in 6953ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 5 properties in 2075 ms.
Support contains 7 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 392/392 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 182 transition count 389
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 179 transition count 389
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 6 place count 179 transition count 382
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 20 place count 172 transition count 382
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 32 place count 166 transition count 376
Applied a total of 32 rules in 38 ms. Remains 166 /182 variables (removed 16) and now considering 376/392 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 166/182 places, 376/392 transitions.
RANDOM walk for 40000 steps (8 resets) in 160 ms. (248 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 628584 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :0 out of 4
Probabilistic random walk after 628584 steps, saw 105200 distinct states, run finished after 3001 ms. (steps per millisecond=209 ) properties seen :0
[2024-06-01 19:51:06] [INFO ] Flow matrix only has 316 transitions (discarded 60 similar events)
// Phase 1: matrix 316 rows 166 cols
[2024-06-01 19:51:06] [INFO ] Computed 19 invariants in 3 ms
[2024-06-01 19:51:06] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 79/86 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 79/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/88 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/90 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/90 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:51:07] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/90 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/90 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 192/282 variables, 90/190 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/282 variables, 48/238 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/282 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 52/334 variables, 20/258 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/334 variables, 20/278 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/334 variables, 4/282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/334 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 80/414 variables, 16/298 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/414 variables, 16/314 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/414 variables, 68/382 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/414 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 36/450 variables, 2/384 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/450 variables, 36/420 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/450 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 2/452 variables, 2/422 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/452 variables, 2/424 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/452 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 2/454 variables, 2/426 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/454 variables, 2/428 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/454 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (OVERLAPS) 28/482 variables, 40/468 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/482 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (OVERLAPS) 0/482 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 468 constraints, problems are : Problem set: 0 solved, 4 unsolved in 639 ms.
Refiners :[Domain max(s): 166/166 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 166/166 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 79/86 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 79/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/88 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/90 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/90 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/90 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/90 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 192/282 variables, 90/190 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/282 variables, 48/238 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/282 variables, 4/242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/282 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 52/334 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/334 variables, 20/282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/334 variables, 4/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:51:07] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
[2024-06-01 19:51:07] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
[2024-06-01 19:51:08] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-06-01 19:51:08] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/334 variables, 4/290 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/334 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 80/414 variables, 16/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/414 variables, 16/322 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/414 variables, 68/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:51:08] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/414 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/414 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 36/450 variables, 2/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/450 variables, 36/429 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:51:08] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 2 ms to minimize.
[2024-06-01 19:51:08] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 1 ms to minimize.
[2024-06-01 19:51:08] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2024-06-01 19:51:08] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
[2024-06-01 19:51:08] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
[2024-06-01 19:51:08] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:51:09] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:51:09] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 2 ms to minimize.
[2024-06-01 19:51:09] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
[2024-06-01 19:51:09] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 2 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/450 variables, 10/439 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:51:09] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:51:09] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 1 ms to minimize.
[2024-06-01 19:51:09] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 2 ms to minimize.
[2024-06-01 19:51:09] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 2 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/450 variables, 4/443 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/450 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 2/452 variables, 2/445 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/452 variables, 2/447 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:51:09] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 2 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/452 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/452 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 2/454 variables, 2/450 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/454 variables, 2/452 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:51:10] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 2 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/454 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/454 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (OVERLAPS) 28/482 variables, 40/493 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:51:10] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:51:10] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 2 ms to minimize.
[2024-06-01 19:51:10] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
[2024-06-01 19:51:10] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/482 variables, 4/497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/482 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (OVERLAPS) 0/482 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 497 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3224 ms.
Refiners :[Domain max(s): 166/166 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 166/166 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 26/26 constraints]
After SMT, in 3882ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 559 ms.
Support contains 7 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 376/376 transitions.
Applied a total of 0 rules in 14 ms. Remains 166 /166 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 166/166 places, 376/376 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 376/376 transitions.
Applied a total of 0 rules in 13 ms. Remains 166 /166 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2024-06-01 19:51:11] [INFO ] Flow matrix only has 316 transitions (discarded 60 similar events)
[2024-06-01 19:51:11] [INFO ] Invariant cache hit.
[2024-06-01 19:51:11] [INFO ] Implicit Places using invariants in 263 ms returned [157, 158, 159, 160]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 266 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 162/166 places, 376/376 transitions.
Applied a total of 0 rules in 16 ms. Remains 162 /162 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 295 ms. Remains : 162/166 places, 376/376 transitions.
RANDOM walk for 40000 steps (8 resets) in 151 ms. (263 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 584130 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :0 out of 4
Probabilistic random walk after 584130 steps, saw 97769 distinct states, run finished after 3001 ms. (steps per millisecond=194 ) properties seen :0
[2024-06-01 19:51:14] [INFO ] Flow matrix only has 316 transitions (discarded 60 similar events)
// Phase 1: matrix 316 rows 162 cols
[2024-06-01 19:51:14] [INFO ] Computed 15 invariants in 3 ms
[2024-06-01 19:51:14] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 79/86 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 79/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:51:15] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/88 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 192/280 variables, 88/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/280 variables, 48/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/280 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 52/332 variables, 20/252 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/332 variables, 20/272 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/332 variables, 4/276 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/332 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 80/412 variables, 16/292 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/412 variables, 16/308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/412 variables, 68/376 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/412 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 36/448 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/448 variables, 36/414 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/448 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 2/450 variables, 2/416 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/450 variables, 2/418 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/450 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 28/478 variables, 38/456 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/478 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 0/478 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 478/478 variables, and 456 constraints, problems are : Problem set: 0 solved, 4 unsolved in 582 ms.
Refiners :[Domain max(s): 162/162 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 79/86 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 79/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/88 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 192/280 variables, 88/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/280 variables, 48/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/280 variables, 4/236 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/280 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 52/332 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/332 variables, 20/276 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/332 variables, 4/280 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:51:15] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:51:15] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 2 ms to minimize.
[2024-06-01 19:51:15] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/332 variables, 3/283 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/332 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 80/412 variables, 16/299 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/412 variables, 16/315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/412 variables, 68/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/412 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 36/448 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/448 variables, 36/421 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:51:16] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:51:16] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 2 ms to minimize.
[2024-06-01 19:51:16] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:51:16] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-06-01 19:51:16] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:51:16] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:51:16] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:51:16] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 1 ms to minimize.
[2024-06-01 19:51:16] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 2 ms to minimize.
[2024-06-01 19:51:16] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 2 ms to minimize.
[2024-06-01 19:51:17] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:51:17] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 2 ms to minimize.
[2024-06-01 19:51:17] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:51:17] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-06-01 19:51:17] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:51:17] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2024-06-01 19:51:17] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 2 ms to minimize.
[2024-06-01 19:51:17] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/448 variables, 18/439 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:51:17] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-06-01 19:51:17] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/448 variables, 2/441 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/448 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 2/450 variables, 2/443 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/450 variables, 2/445 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/450 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 28/478 variables, 38/483 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/478 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (OVERLAPS) 0/478 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 478/478 variables, and 483 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2778 ms.
Refiners :[Domain max(s): 162/162 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 24/24 constraints]
After SMT, in 3380ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 502 ms.
Support contains 7 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 376/376 transitions.
Applied a total of 0 rules in 20 ms. Remains 162 /162 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 162/162 places, 376/376 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 376/376 transitions.
Applied a total of 0 rules in 11 ms. Remains 162 /162 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2024-06-01 19:51:18] [INFO ] Flow matrix only has 316 transitions (discarded 60 similar events)
[2024-06-01 19:51:18] [INFO ] Invariant cache hit.
[2024-06-01 19:51:18] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-06-01 19:51:18] [INFO ] Flow matrix only has 316 transitions (discarded 60 similar events)
[2024-06-01 19:51:18] [INFO ] Invariant cache hit.
[2024-06-01 19:51:19] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 19:51:19] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
[2024-06-01 19:51:19] [INFO ] Redundant transitions in 25 ms returned []
Running 371 sub problems to find dead transitions.
[2024-06-01 19:51:19] [INFO ] Flow matrix only has 316 transitions (discarded 60 similar events)
[2024-06-01 19:51:19] [INFO ] Invariant cache hit.
[2024-06-01 19:51:19] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 161/161 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 12/173 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-01 19:51:21] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 2 ms to minimize.
[2024-06-01 19:51:21] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:51:21] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 2 ms to minimize.
[2024-06-01 19:51:21] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:51:21] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 2 ms to minimize.
[2024-06-01 19:51:21] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:51:21] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:51:21] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 2 ms to minimize.
[2024-06-01 19:51:22] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 2 ms to minimize.
[2024-06-01 19:51:22] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-06-01 19:51:22] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:51:22] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 2 ms to minimize.
[2024-06-01 19:51:22] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:51:22] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:51:22] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:51:22] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 2 ms to minimize.
[2024-06-01 19:51:22] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:51:22] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:51:22] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:51:23] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 20/193 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-01 19:51:23] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:51:23] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 0 ms to minimize.
[2024-06-01 19:51:23] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:51:23] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:51:23] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:51:23] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:51:23] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:51:23] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-06-01 19:51:23] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:51:24] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:51:24] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:51:24] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:51:24] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 2 ms to minimize.
[2024-06-01 19:51:24] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 2 ms to minimize.
[2024-06-01 19:51:24] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 19:51:24] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:51:24] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:51:24] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:51:24] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:51:25] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 20/213 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-01 19:51:27] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:51:27] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 2 ms to minimize.
[2024-06-01 19:51:27] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:51:27] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:51:27] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:51:27] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:51:28] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:51:28] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:51:28] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 2 ms to minimize.
[2024-06-01 19:51:28] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 2 ms to minimize.
[2024-06-01 19:51:28] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:51:28] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:51:28] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 13/226 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-01 19:51:30] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 2 ms to minimize.
[2024-06-01 19:51:30] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-01 19:51:31] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 19:51:31] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 19:51:32] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:51:32] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 2 ms to minimize.
[2024-06-01 19:51:32] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:51:32] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:51:32] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 2 ms to minimize.
[2024-06-01 19:51:33] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 1 ms to minimize.
[2024-06-01 19:51:33] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 9/237 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-01 19:51:35] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:51:35] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:51:36] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 3/240 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-01 19:51:37] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-06-01 19:51:37] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 10 (OVERLAPS) 1/162 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-01 19:51:44] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-06-01 19:51:44] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-06-01 19:51:44] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:51:44] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:51:44] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-06-01 19:51:44] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2024-06-01 19:51:45] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:51:45] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 2 ms to minimize.
[2024-06-01 19:51:45] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 2 ms to minimize.
[2024-06-01 19:51:45] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
[2024-06-01 19:51:45] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:51:45] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:51:45] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:51:45] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:51:45] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:51:45] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:51:46] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:51:46] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:51:46] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:51:46] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 20/266 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-01 19:51:46] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:51:47] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:51:47] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:51:47] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 2 ms to minimize.
[2024-06-01 19:51:47] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 2 ms to minimize.
[2024-06-01 19:51:48] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 2 ms to minimize.
[2024-06-01 19:51:48] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:51:48] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:51:48] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:51:48] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 2 ms to minimize.
[2024-06-01 19:51:48] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 19:51:48] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:51:48] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 2 ms to minimize.
[2024-06-01 19:51:48] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
[2024-06-01 19:51:49] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 2 ms to minimize.
[2024-06-01 19:51:49] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-06-01 19:51:49] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 2 ms to minimize.
[2024-06-01 19:51:49] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 162/478 variables, and 284 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30015 ms.
Refiners :[Domain max(s): 162/162 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/162 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 107/107 constraints]
Escalating to Integer solving :Problem set: 0 solved, 371 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 161/161 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 12/173 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 104/277 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-01 19:51:51] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (OVERLAPS) 1/162 variables, 2/280 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 3/285 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-01 19:51:58] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:51:58] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:51:58] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 2 ms to minimize.
[2024-06-01 19:51:59] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 2 ms to minimize.
[2024-06-01 19:51:59] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 2 ms to minimize.
[2024-06-01 19:51:59] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 2 ms to minimize.
[2024-06-01 19:52:00] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 2 ms to minimize.
[2024-06-01 19:52:00] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 8/293 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-01 19:52:03] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:52:03] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 2 ms to minimize.
[2024-06-01 19:52:04] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:52:04] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 4/297 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-01 19:52:05] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2024-06-01 19:52:07] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-01 19:52:09] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-06-01 19:52:11] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:52:11] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-06-01 19:52:11] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 4/303 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-01 19:52:13] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-06-01 19:52:14] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:52:14] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 1 ms to minimize.
[2024-06-01 19:52:15] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 4/307 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 162/478 variables, and 307 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30012 ms.
Refiners :[Domain max(s): 162/162 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/162 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/371 constraints, Known Traps: 130/130 constraints]
After SMT, in 60152ms problems are : Problem set: 0 solved, 371 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60878 ms. Remains : 162/162 places, 376/376 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 277 edges and 162 vertex of which 96 / 162 are part of one of the 20 SCC in 7 ms
Free SCC test removed 76 places
Drop transitions (Empty/Sink Transition effects.) removed 152 transitions
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 229 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 1 place count 86 transition count 130
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 35 place count 69 transition count 130
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 39 place count 67 transition count 127
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 57 place count 56 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 29 edges and 56 vertex of which 20 / 56 are part of one of the 4 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 60 place count 40 transition count 133
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (trivial) has 41 edges and 38 vertex of which 8 / 38 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 1 with 23 rules applied. Total rules applied 83 place count 34 transition count 113
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 118 place count 34 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 130 place count 34 transition count 66
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 132 place count 34 transition count 64
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 134 place count 32 transition count 64
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 32 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 136 place count 31 transition count 63
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 137 place count 31 transition count 63
Applied a total of 137 rules in 39 ms. Remains 31 /162 variables (removed 131) and now considering 63/376 (removed 313) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 63 rows 31 cols
[2024-06-01 19:52:19] [INFO ] Computed 9 invariants in 0 ms
[2024-06-01 19:52:19] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-01 19:52:19] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 19:52:19] [INFO ] After 31ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-01 19:52:19] [INFO ] After 60ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-01 19:52:19] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-01 19:52:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 26 ms returned sat
[2024-06-01 19:52:19] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 12 ms returned sat
[2024-06-01 19:52:19] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-01 19:52:20] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-01 19:52:20] [INFO ] After 203ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 368 ms.
FORMULA Peterson-PT-4-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA Peterson-PT-4-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 85 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2024-06-01 19:52:20] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2024-06-01 19:52:20] [INFO ] Computed 19 invariants in 4 ms
[2024-06-01 19:52:20] [INFO ] Implicit Places using invariants in 249 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 251 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 9 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 267 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 247 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-4-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 637 ms.
Product exploration explored 100000 steps with 50000 reset in 599 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 22 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-4-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-4-LTLFireability-01 finished in 1868 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U X(X((p1 U (F(p3)||p2)))))))'
Support contains 140 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2024-06-01 19:52:22] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-06-01 19:52:22] [INFO ] Invariant cache hit.
[2024-06-01 19:52:22] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-06-01 19:52:22] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-06-01 19:52:22] [INFO ] Invariant cache hit.
[2024-06-01 19:52:22] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 19:52:23] [INFO ] Implicit Places using invariants and state equation in 1012 ms returned []
Implicit Place search using SMT with State Equation took 1337 ms to find 0 implicit places.
Running 685 sub problems to find dead transitions.
[2024-06-01 19:52:23] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-06-01 19:52:23] [INFO ] Invariant cache hit.
[2024-06-01 19:52:23] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 475/475 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 4/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 3 (OVERLAPS) 5/480 variables, 10/489 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 5/494 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 5/499 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:52:43] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 4 ms to minimize.
[2024-06-01 19:52:44] [INFO ] Deduced a trap composed of 35 places in 240 ms of which 4 ms to minimize.
[2024-06-01 19:52:44] [INFO ] Deduced a trap composed of 27 places in 239 ms of which 3 ms to minimize.
[2024-06-01 19:52:44] [INFO ] Deduced a trap composed of 36 places in 197 ms of which 4 ms to minimize.
[2024-06-01 19:52:44] [INFO ] Deduced a trap composed of 36 places in 243 ms of which 4 ms to minimize.
[2024-06-01 19:52:45] [INFO ] Deduced a trap composed of 45 places in 270 ms of which 5 ms to minimize.
[2024-06-01 19:52:45] [INFO ] Deduced a trap composed of 54 places in 272 ms of which 4 ms to minimize.
[2024-06-01 19:52:45] [INFO ] Deduced a trap composed of 32 places in 265 ms of which 4 ms to minimize.
[2024-06-01 19:52:45] [INFO ] Deduced a trap composed of 58 places in 207 ms of which 3 ms to minimize.
[2024-06-01 19:52:46] [INFO ] Deduced a trap composed of 14 places in 284 ms of which 5 ms to minimize.
[2024-06-01 19:52:46] [INFO ] Deduced a trap composed of 17 places in 274 ms of which 4 ms to minimize.
[2024-06-01 19:52:46] [INFO ] Deduced a trap composed of 13 places in 268 ms of which 4 ms to minimize.
[2024-06-01 19:52:46] [INFO ] Deduced a trap composed of 18 places in 270 ms of which 4 ms to minimize.
[2024-06-01 19:52:47] [INFO ] Deduced a trap composed of 10 places in 287 ms of which 4 ms to minimize.
[2024-06-01 19:52:47] [INFO ] Deduced a trap composed of 54 places in 195 ms of which 3 ms to minimize.
[2024-06-01 19:52:47] [INFO ] Deduced a trap composed of 60 places in 156 ms of which 3 ms to minimize.
[2024-06-01 19:52:47] [INFO ] Deduced a trap composed of 64 places in 136 ms of which 3 ms to minimize.
[2024-06-01 19:52:48] [INFO ] Deduced a trap composed of 39 places in 254 ms of which 4 ms to minimize.
[2024-06-01 19:52:48] [INFO ] Deduced a trap composed of 40 places in 282 ms of which 5 ms to minimize.
[2024-06-01 19:52:48] [INFO ] Deduced a trap composed of 18 places in 261 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 20/519 constraints. Problems are: Problem set: 0 solved, 685 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 480/1110 variables, and 519 constraints, problems are : Problem set: 0 solved, 685 unsolved in 30020 ms.
Refiners :[Domain max(s): 480/480 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/480 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 685/685 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 685 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 475/475 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 4/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 20/499 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 4 (OVERLAPS) 5/480 variables, 10/509 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 5/514 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 5/519 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:53:02] [INFO ] Deduced a trap composed of 14 places in 254 ms of which 4 ms to minimize.
[2024-06-01 19:53:03] [INFO ] Deduced a trap composed of 57 places in 236 ms of which 4 ms to minimize.
[2024-06-01 19:53:03] [INFO ] Deduced a trap composed of 86 places in 232 ms of which 3 ms to minimize.
[2024-06-01 19:53:03] [INFO ] Deduced a trap composed of 83 places in 222 ms of which 3 ms to minimize.
[2024-06-01 19:53:03] [INFO ] Deduced a trap composed of 84 places in 214 ms of which 3 ms to minimize.
[2024-06-01 19:53:03] [INFO ] Deduced a trap composed of 65 places in 193 ms of which 3 ms to minimize.
[2024-06-01 19:53:04] [INFO ] Deduced a trap composed of 62 places in 194 ms of which 3 ms to minimize.
[2024-06-01 19:53:04] [INFO ] Deduced a trap composed of 62 places in 192 ms of which 4 ms to minimize.
[2024-06-01 19:53:04] [INFO ] Deduced a trap composed of 96 places in 142 ms of which 3 ms to minimize.
[2024-06-01 19:53:04] [INFO ] Deduced a trap composed of 39 places in 227 ms of which 4 ms to minimize.
[2024-06-01 19:53:04] [INFO ] Deduced a trap composed of 61 places in 177 ms of which 3 ms to minimize.
[2024-06-01 19:53:05] [INFO ] Deduced a trap composed of 61 places in 177 ms of which 3 ms to minimize.
[2024-06-01 19:53:05] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 3 ms to minimize.
[2024-06-01 19:53:05] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 3 ms to minimize.
[2024-06-01 19:53:05] [INFO ] Deduced a trap composed of 21 places in 259 ms of which 4 ms to minimize.
[2024-06-01 19:53:06] [INFO ] Deduced a trap composed of 40 places in 185 ms of which 4 ms to minimize.
[2024-06-01 19:53:06] [INFO ] Deduced a trap composed of 25 places in 202 ms of which 3 ms to minimize.
[2024-06-01 19:53:06] [INFO ] Deduced a trap composed of 65 places in 201 ms of which 3 ms to minimize.
[2024-06-01 19:53:06] [INFO ] Deduced a trap composed of 65 places in 197 ms of which 3 ms to minimize.
[2024-06-01 19:53:06] [INFO ] Deduced a trap composed of 65 places in 205 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 20/539 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:53:08] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 4 ms to minimize.
[2024-06-01 19:53:08] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 4 ms to minimize.
[2024-06-01 19:53:08] [INFO ] Deduced a trap composed of 102 places in 300 ms of which 4 ms to minimize.
[2024-06-01 19:53:09] [INFO ] Deduced a trap composed of 62 places in 248 ms of which 4 ms to minimize.
[2024-06-01 19:53:09] [INFO ] Deduced a trap composed of 48 places in 202 ms of which 3 ms to minimize.
[2024-06-01 19:53:09] [INFO ] Deduced a trap composed of 62 places in 253 ms of which 3 ms to minimize.
[2024-06-01 19:53:09] [INFO ] Deduced a trap composed of 62 places in 239 ms of which 4 ms to minimize.
[2024-06-01 19:53:10] [INFO ] Deduced a trap composed of 43 places in 207 ms of which 3 ms to minimize.
[2024-06-01 19:53:10] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 2 ms to minimize.
[2024-06-01 19:53:10] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 2 ms to minimize.
[2024-06-01 19:53:10] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-06-01 19:53:10] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 2 ms to minimize.
[2024-06-01 19:53:10] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 2 ms to minimize.
[2024-06-01 19:53:10] [INFO ] Deduced a trap composed of 58 places in 142 ms of which 3 ms to minimize.
[2024-06-01 19:53:11] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 3 ms to minimize.
[2024-06-01 19:53:11] [INFO ] Deduced a trap composed of 54 places in 179 ms of which 2 ms to minimize.
[2024-06-01 19:53:11] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:53:11] [INFO ] Deduced a trap composed of 43 places in 157 ms of which 4 ms to minimize.
[2024-06-01 19:53:11] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 3 ms to minimize.
[2024-06-01 19:53:11] [INFO ] Deduced a trap composed of 50 places in 132 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 20/559 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:53:14] [INFO ] Deduced a trap composed of 88 places in 161 ms of which 3 ms to minimize.
[2024-06-01 19:53:14] [INFO ] Deduced a trap composed of 87 places in 178 ms of which 3 ms to minimize.
[2024-06-01 19:53:14] [INFO ] Deduced a trap composed of 87 places in 162 ms of which 3 ms to minimize.
[2024-06-01 19:53:15] [INFO ] Deduced a trap composed of 112 places in 190 ms of which 3 ms to minimize.
[2024-06-01 19:53:15] [INFO ] Deduced a trap composed of 128 places in 156 ms of which 3 ms to minimize.
[2024-06-01 19:53:15] [INFO ] Deduced a trap composed of 36 places in 318 ms of which 6 ms to minimize.
[2024-06-01 19:53:15] [INFO ] Deduced a trap composed of 83 places in 124 ms of which 2 ms to minimize.
[2024-06-01 19:53:16] [INFO ] Deduced a trap composed of 35 places in 252 ms of which 3 ms to minimize.
[2024-06-01 19:53:16] [INFO ] Deduced a trap composed of 76 places in 133 ms of which 3 ms to minimize.
[2024-06-01 19:53:16] [INFO ] Deduced a trap composed of 76 places in 151 ms of which 3 ms to minimize.
[2024-06-01 19:53:16] [INFO ] Deduced a trap composed of 47 places in 145 ms of which 3 ms to minimize.
[2024-06-01 19:53:16] [INFO ] Deduced a trap composed of 58 places in 144 ms of which 3 ms to minimize.
[2024-06-01 19:53:17] [INFO ] Deduced a trap composed of 76 places in 138 ms of which 3 ms to minimize.
[2024-06-01 19:53:17] [INFO ] Deduced a trap composed of 76 places in 171 ms of which 3 ms to minimize.
[2024-06-01 19:53:17] [INFO ] Deduced a trap composed of 92 places in 135 ms of which 3 ms to minimize.
[2024-06-01 19:53:17] [INFO ] Deduced a trap composed of 92 places in 175 ms of which 3 ms to minimize.
[2024-06-01 19:53:18] [INFO ] Deduced a trap composed of 92 places in 191 ms of which 3 ms to minimize.
[2024-06-01 19:53:18] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:53:18] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 2 ms to minimize.
[2024-06-01 19:53:18] [INFO ] Deduced a trap composed of 69 places in 92 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/480 variables, 20/579 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:53:22] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 2 ms to minimize.
[2024-06-01 19:53:22] [INFO ] Deduced a trap composed of 54 places in 214 ms of which 4 ms to minimize.
[2024-06-01 19:53:22] [INFO ] Deduced a trap composed of 84 places in 186 ms of which 4 ms to minimize.
[2024-06-01 19:53:22] [INFO ] Deduced a trap composed of 84 places in 179 ms of which 3 ms to minimize.
[2024-06-01 19:53:22] [INFO ] Deduced a trap composed of 83 places in 182 ms of which 3 ms to minimize.
[2024-06-01 19:53:23] [INFO ] Deduced a trap composed of 119 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:53:23] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 2 ms to minimize.
[2024-06-01 19:53:23] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 2 ms to minimize.
SMT process timed out in 60179ms, After SMT, problems are : Problem set: 0 solved, 685 unsolved
Search for dead transitions found 0 dead transitions in 60188ms
Finished structural reductions in LTL mode , in 1 iterations and 61532 ms. Remains : 480/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 375 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : Peterson-PT-4-LTLFireability-02
Product exploration explored 100000 steps with 25000 reset in 320 ms.
Product exploration explored 100000 steps with 25000 reset in 329 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 8 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
RANDOM walk for 151 steps (0 resets) in 6 ms. (21 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p1 p2 p3))), (F p2), (F (NOT p3)), (F (NOT (OR (NOT p1) p2 p3)))]
Knowledge based reduction with 3 factoid took 210 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 184 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 130 out of 480 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 5 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2024-06-01 19:53:25] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-06-01 19:53:25] [INFO ] Invariant cache hit.
[2024-06-01 19:53:26] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-06-01 19:53:26] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-06-01 19:53:26] [INFO ] Invariant cache hit.
[2024-06-01 19:53:26] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 19:53:27] [INFO ] Implicit Places using invariants and state equation in 952 ms returned []
Implicit Place search using SMT with State Equation took 1284 ms to find 0 implicit places.
Running 685 sub problems to find dead transitions.
[2024-06-01 19:53:27] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-06-01 19:53:27] [INFO ] Invariant cache hit.
[2024-06-01 19:53:27] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 475/475 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 4/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 3 (OVERLAPS) 5/480 variables, 10/489 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 5/494 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 5/499 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:53:46] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 4 ms to minimize.
[2024-06-01 19:53:46] [INFO ] Deduced a trap composed of 35 places in 242 ms of which 4 ms to minimize.
[2024-06-01 19:53:47] [INFO ] Deduced a trap composed of 27 places in 234 ms of which 4 ms to minimize.
[2024-06-01 19:53:47] [INFO ] Deduced a trap composed of 36 places in 240 ms of which 3 ms to minimize.
[2024-06-01 19:53:47] [INFO ] Deduced a trap composed of 36 places in 231 ms of which 3 ms to minimize.
[2024-06-01 19:53:47] [INFO ] Deduced a trap composed of 45 places in 270 ms of which 4 ms to minimize.
[2024-06-01 19:53:48] [INFO ] Deduced a trap composed of 54 places in 256 ms of which 4 ms to minimize.
[2024-06-01 19:53:48] [INFO ] Deduced a trap composed of 32 places in 268 ms of which 4 ms to minimize.
[2024-06-01 19:53:48] [INFO ] Deduced a trap composed of 58 places in 203 ms of which 3 ms to minimize.
[2024-06-01 19:53:48] [INFO ] Deduced a trap composed of 14 places in 308 ms of which 5 ms to minimize.
[2024-06-01 19:53:49] [INFO ] Deduced a trap composed of 17 places in 258 ms of which 4 ms to minimize.
[2024-06-01 19:53:49] [INFO ] Deduced a trap composed of 13 places in 264 ms of which 4 ms to minimize.
[2024-06-01 19:53:49] [INFO ] Deduced a trap composed of 18 places in 262 ms of which 4 ms to minimize.
[2024-06-01 19:53:50] [INFO ] Deduced a trap composed of 10 places in 288 ms of which 5 ms to minimize.
[2024-06-01 19:53:50] [INFO ] Deduced a trap composed of 54 places in 217 ms of which 3 ms to minimize.
[2024-06-01 19:53:50] [INFO ] Deduced a trap composed of 60 places in 142 ms of which 3 ms to minimize.
[2024-06-01 19:53:50] [INFO ] Deduced a trap composed of 64 places in 147 ms of which 3 ms to minimize.
[2024-06-01 19:53:50] [INFO ] Deduced a trap composed of 39 places in 264 ms of which 4 ms to minimize.
[2024-06-01 19:53:51] [INFO ] Deduced a trap composed of 40 places in 256 ms of which 4 ms to minimize.
[2024-06-01 19:53:51] [INFO ] Deduced a trap composed of 18 places in 272 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 20/519 constraints. Problems are: Problem set: 0 solved, 685 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 480/1110 variables, and 519 constraints, problems are : Problem set: 0 solved, 685 unsolved in 30024 ms.
Refiners :[Domain max(s): 480/480 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/480 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 685/685 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 685 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 475/475 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 4/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 20/499 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 4 (OVERLAPS) 5/480 variables, 10/509 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 5/514 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 5/519 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:54:06] [INFO ] Deduced a trap composed of 14 places in 251 ms of which 4 ms to minimize.
[2024-06-01 19:54:06] [INFO ] Deduced a trap composed of 57 places in 238 ms of which 3 ms to minimize.
[2024-06-01 19:54:07] [INFO ] Deduced a trap composed of 86 places in 220 ms of which 3 ms to minimize.
[2024-06-01 19:54:07] [INFO ] Deduced a trap composed of 83 places in 220 ms of which 4 ms to minimize.
[2024-06-01 19:54:07] [INFO ] Deduced a trap composed of 84 places in 217 ms of which 4 ms to minimize.
[2024-06-01 19:54:07] [INFO ] Deduced a trap composed of 65 places in 207 ms of which 4 ms to minimize.
[2024-06-01 19:54:07] [INFO ] Deduced a trap composed of 62 places in 201 ms of which 3 ms to minimize.
[2024-06-01 19:54:08] [INFO ] Deduced a trap composed of 62 places in 208 ms of which 3 ms to minimize.
[2024-06-01 19:54:08] [INFO ] Deduced a trap composed of 96 places in 140 ms of which 3 ms to minimize.
[2024-06-01 19:54:08] [INFO ] Deduced a trap composed of 39 places in 240 ms of which 4 ms to minimize.
[2024-06-01 19:54:08] [INFO ] Deduced a trap composed of 61 places in 181 ms of which 3 ms to minimize.
[2024-06-01 19:54:08] [INFO ] Deduced a trap composed of 61 places in 205 ms of which 3 ms to minimize.
[2024-06-01 19:54:09] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 3 ms to minimize.
[2024-06-01 19:54:09] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 4 ms to minimize.
[2024-06-01 19:54:09] [INFO ] Deduced a trap composed of 21 places in 280 ms of which 4 ms to minimize.
[2024-06-01 19:54:09] [INFO ] Deduced a trap composed of 40 places in 225 ms of which 4 ms to minimize.
[2024-06-01 19:54:10] [INFO ] Deduced a trap composed of 25 places in 230 ms of which 3 ms to minimize.
[2024-06-01 19:54:10] [INFO ] Deduced a trap composed of 65 places in 200 ms of which 3 ms to minimize.
[2024-06-01 19:54:10] [INFO ] Deduced a trap composed of 65 places in 181 ms of which 4 ms to minimize.
[2024-06-01 19:54:10] [INFO ] Deduced a trap composed of 65 places in 206 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 20/539 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:54:11] [INFO ] Deduced a trap composed of 32 places in 198 ms of which 3 ms to minimize.
[2024-06-01 19:54:12] [INFO ] Deduced a trap composed of 32 places in 260 ms of which 4 ms to minimize.
[2024-06-01 19:54:12] [INFO ] Deduced a trap composed of 102 places in 247 ms of which 4 ms to minimize.
[2024-06-01 19:54:12] [INFO ] Deduced a trap composed of 62 places in 256 ms of which 4 ms to minimize.
[2024-06-01 19:54:13] [INFO ] Deduced a trap composed of 48 places in 215 ms of which 4 ms to minimize.
[2024-06-01 19:54:13] [INFO ] Deduced a trap composed of 62 places in 259 ms of which 5 ms to minimize.
[2024-06-01 19:54:13] [INFO ] Deduced a trap composed of 62 places in 221 ms of which 3 ms to minimize.
[2024-06-01 19:54:13] [INFO ] Deduced a trap composed of 43 places in 187 ms of which 4 ms to minimize.
[2024-06-01 19:54:13] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 3 ms to minimize.
[2024-06-01 19:54:14] [INFO ] Deduced a trap composed of 79 places in 124 ms of which 3 ms to minimize.
[2024-06-01 19:54:14] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:54:14] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 2 ms to minimize.
[2024-06-01 19:54:14] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 3 ms to minimize.
[2024-06-01 19:54:14] [INFO ] Deduced a trap composed of 58 places in 172 ms of which 3 ms to minimize.
[2024-06-01 19:54:15] [INFO ] Deduced a trap composed of 42 places in 198 ms of which 3 ms to minimize.
[2024-06-01 19:54:15] [INFO ] Deduced a trap composed of 54 places in 169 ms of which 2 ms to minimize.
[2024-06-01 19:54:15] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 3 ms to minimize.
[2024-06-01 19:54:15] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 3 ms to minimize.
[2024-06-01 19:54:15] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 2 ms to minimize.
[2024-06-01 19:54:15] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 20/559 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:54:18] [INFO ] Deduced a trap composed of 88 places in 148 ms of which 2 ms to minimize.
[2024-06-01 19:54:18] [INFO ] Deduced a trap composed of 87 places in 153 ms of which 3 ms to minimize.
[2024-06-01 19:54:18] [INFO ] Deduced a trap composed of 87 places in 188 ms of which 3 ms to minimize.
[2024-06-01 19:54:19] [INFO ] Deduced a trap composed of 112 places in 162 ms of which 3 ms to minimize.
[2024-06-01 19:54:19] [INFO ] Deduced a trap composed of 128 places in 157 ms of which 3 ms to minimize.
[2024-06-01 19:54:19] [INFO ] Deduced a trap composed of 36 places in 290 ms of which 5 ms to minimize.
[2024-06-01 19:54:19] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 2 ms to minimize.
[2024-06-01 19:54:20] [INFO ] Deduced a trap composed of 35 places in 244 ms of which 4 ms to minimize.
[2024-06-01 19:54:20] [INFO ] Deduced a trap composed of 76 places in 134 ms of which 3 ms to minimize.
[2024-06-01 19:54:20] [INFO ] Deduced a trap composed of 76 places in 154 ms of which 3 ms to minimize.
[2024-06-01 19:54:20] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 3 ms to minimize.
[2024-06-01 19:54:20] [INFO ] Deduced a trap composed of 58 places in 127 ms of which 3 ms to minimize.
[2024-06-01 19:54:21] [INFO ] Deduced a trap composed of 76 places in 141 ms of which 3 ms to minimize.
[2024-06-01 19:54:21] [INFO ] Deduced a trap composed of 76 places in 158 ms of which 3 ms to minimize.
[2024-06-01 19:54:21] [INFO ] Deduced a trap composed of 92 places in 162 ms of which 3 ms to minimize.
[2024-06-01 19:54:21] [INFO ] Deduced a trap composed of 92 places in 158 ms of which 3 ms to minimize.
[2024-06-01 19:54:21] [INFO ] Deduced a trap composed of 92 places in 163 ms of which 3 ms to minimize.
[2024-06-01 19:54:21] [INFO ] Deduced a trap composed of 69 places in 87 ms of which 1 ms to minimize.
[2024-06-01 19:54:22] [INFO ] Deduced a trap composed of 69 places in 87 ms of which 4 ms to minimize.
[2024-06-01 19:54:22] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/480 variables, 20/579 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:54:25] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 3 ms to minimize.
[2024-06-01 19:54:26] [INFO ] Deduced a trap composed of 54 places in 217 ms of which 3 ms to minimize.
[2024-06-01 19:54:26] [INFO ] Deduced a trap composed of 84 places in 174 ms of which 3 ms to minimize.
[2024-06-01 19:54:26] [INFO ] Deduced a trap composed of 84 places in 186 ms of which 3 ms to minimize.
[2024-06-01 19:54:26] [INFO ] Deduced a trap composed of 83 places in 191 ms of which 3 ms to minimize.
[2024-06-01 19:54:27] [INFO ] Deduced a trap composed of 119 places in 140 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/1110 variables, and 585 constraints, problems are : Problem set: 0 solved, 685 unsolved in 30018 ms.
Refiners :[Domain max(s): 480/480 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/480 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/685 constraints, Known Traps: 86/86 constraints]
After SMT, in 60189ms problems are : Problem set: 0 solved, 685 unsolved
Search for dead transitions found 0 dead transitions in 60197ms
Finished structural reductions in LTL mode , in 1 iterations and 61488 ms. Remains : 480/480 places, 690/690 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p3 (NOT p1) (NOT p2))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 89 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
RANDOM walk for 113 steps (0 resets) in 7 ms. (14 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p3 (NOT p1) (NOT p2))]
False Knowledge obtained : [(F p1), (F (NOT (OR p1 p2 p3))), (F p2), (F (NOT p3)), (F (NOT (OR (NOT p1) p2 p3)))]
Knowledge based reduction with 1 factoid took 194 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 187 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 190 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 25000 reset in 591 ms.
Product exploration explored 100000 steps with 25000 reset in 525 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 189 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 130 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 480 transition count 690
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 84 place count 480 transition count 690
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 89 place count 480 transition count 690
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 120 places in 0 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 120 place count 480 transition count 690
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 135 place count 465 transition count 675
Deduced a syphon composed of 105 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 150 place count 465 transition count 675
Deduced a syphon composed of 105 places in 1 ms
Applied a total of 150 rules in 69 ms. Remains 465 /480 variables (removed 15) and now considering 675/690 (removed 15) transitions.
[2024-06-01 19:54:29] [INFO ] Redundant transitions in 21 ms returned []
Running 670 sub problems to find dead transitions.
[2024-06-01 19:54:29] [INFO ] Flow matrix only has 615 transitions (discarded 60 similar events)
// Phase 1: matrix 615 rows 465 cols
[2024-06-01 19:54:30] [INFO ] Computed 19 invariants in 5 ms
[2024-06-01 19:54:30] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 2 (OVERLAPS) 5/465 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/465 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 670 unsolved
[2024-06-01 19:54:48] [INFO ] Deduced a trap composed of 33 places in 300 ms of which 4 ms to minimize.
[2024-06-01 19:54:48] [INFO ] Deduced a trap composed of 28 places in 280 ms of which 4 ms to minimize.
[2024-06-01 19:54:49] [INFO ] Deduced a trap composed of 88 places in 279 ms of which 4 ms to minimize.
[2024-06-01 19:54:49] [INFO ] Deduced a trap composed of 60 places in 282 ms of which 4 ms to minimize.
[2024-06-01 19:54:49] [INFO ] Deduced a trap composed of 28 places in 303 ms of which 5 ms to minimize.
[2024-06-01 19:54:50] [INFO ] Deduced a trap composed of 23 places in 315 ms of which 4 ms to minimize.
[2024-06-01 19:54:50] [INFO ] Deduced a trap composed of 25 places in 267 ms of which 3 ms to minimize.
[2024-06-01 19:54:50] [INFO ] Deduced a trap composed of 11 places in 272 ms of which 4 ms to minimize.
[2024-06-01 19:54:51] [INFO ] Deduced a trap composed of 9 places in 254 ms of which 4 ms to minimize.
[2024-06-01 19:54:51] [INFO ] Deduced a trap composed of 12 places in 261 ms of which 4 ms to minimize.
[2024-06-01 19:54:51] [INFO ] Deduced a trap composed of 9 places in 266 ms of which 4 ms to minimize.
[2024-06-01 19:54:51] [INFO ] Deduced a trap composed of 9 places in 257 ms of which 4 ms to minimize.
[2024-06-01 19:54:52] [INFO ] Deduced a trap composed of 9 places in 257 ms of which 4 ms to minimize.
[2024-06-01 19:54:52] [INFO ] Deduced a trap composed of 41 places in 253 ms of which 4 ms to minimize.
[2024-06-01 19:54:52] [INFO ] Deduced a trap composed of 25 places in 234 ms of which 4 ms to minimize.
[2024-06-01 19:54:52] [INFO ] Deduced a trap composed of 47 places in 200 ms of which 6 ms to minimize.
[2024-06-01 19:54:53] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 4 ms to minimize.
[2024-06-01 19:54:53] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-01 19:54:53] [INFO ] Deduced a trap composed of 28 places in 261 ms of which 4 ms to minimize.
[2024-06-01 19:54:53] [INFO ] Deduced a trap composed of 33 places in 250 ms of which 4 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD663 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 20/39 constraints. Problems are: Problem set: 21 solved, 649 unsolved
[2024-06-01 19:54:54] [INFO ] Deduced a trap composed of 44 places in 223 ms of which 4 ms to minimize.
[2024-06-01 19:54:54] [INFO ] Deduced a trap composed of 44 places in 228 ms of which 4 ms to minimize.
[2024-06-01 19:54:54] [INFO ] Deduced a trap composed of 36 places in 201 ms of which 4 ms to minimize.
[2024-06-01 19:54:54] [INFO ] Deduced a trap composed of 41 places in 227 ms of which 4 ms to minimize.
[2024-06-01 19:54:55] [INFO ] Deduced a trap composed of 25 places in 268 ms of which 4 ms to minimize.
[2024-06-01 19:54:55] [INFO ] Deduced a trap composed of 33 places in 221 ms of which 3 ms to minimize.
[2024-06-01 19:54:55] [INFO ] Deduced a trap composed of 48 places in 178 ms of which 3 ms to minimize.
[2024-06-01 19:54:55] [INFO ] Deduced a trap composed of 57 places in 125 ms of which 3 ms to minimize.
[2024-06-01 19:54:55] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 3 ms to minimize.
[2024-06-01 19:54:56] [INFO ] Deduced a trap composed of 60 places in 166 ms of which 3 ms to minimize.
[2024-06-01 19:54:56] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 3 ms to minimize.
[2024-06-01 19:54:56] [INFO ] Deduced a trap composed of 66 places in 57 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-06-01 19:54:56] [INFO ] Deduced a trap composed of 33 places in 199 ms of which 3 ms to minimize.
[2024-06-01 19:54:56] [INFO ] Deduced a trap composed of 44 places in 244 ms of which 3 ms to minimize.
[2024-06-01 19:54:56] [INFO ] Deduced a trap composed of 25 places in 175 ms of which 4 ms to minimize.
[2024-06-01 19:54:57] [INFO ] Deduced a trap composed of 66 places in 152 ms of which 3 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-01 19:54:57] [INFO ] Deduced a trap composed of 25 places in 223 ms of which 3 ms to minimize.
[2024-06-01 19:54:57] [INFO ] Deduced a trap composed of 66 places in 113 ms of which 3 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
[2024-06-01 19:54:57] [INFO ] Deduced a trap composed of 84 places in 152 ms of which 3 ms to minimize.
[2024-06-01 19:54:57] [INFO ] Deduced a trap composed of 66 places in 119 ms of which 3 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD669 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 20/59 constraints. Problems are: Problem set: 105 solved, 565 unsolved
[2024-06-01 19:54:58] [INFO ] Deduced a trap composed of 17 places in 233 ms of which 4 ms to minimize.
[2024-06-01 19:54:58] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 3 ms to minimize.
[2024-06-01 19:54:58] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 3 ms to minimize.
[2024-06-01 19:54:59] [INFO ] Deduced a trap composed of 63 places in 196 ms of which 4 ms to minimize.
[2024-06-01 19:54:59] [INFO ] Deduced a trap composed of 47 places in 238 ms of which 4 ms to minimize.
[2024-06-01 19:54:59] [INFO ] Deduced a trap composed of 34 places in 170 ms of which 3 ms to minimize.
[2024-06-01 19:54:59] [INFO ] Deduced a trap composed of 63 places in 208 ms of which 3 ms to minimize.
[2024-06-01 19:54:59] [INFO ] Deduced a trap composed of 63 places in 200 ms of which 3 ms to minimize.
[2024-06-01 19:55:00] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 2 ms to minimize.
[2024-06-01 19:55:00] [INFO ] Deduced a trap composed of 63 places in 144 ms of which 3 ms to minimize.
SMT process timed out in 30294ms, After SMT, problems are : Problem set: 105 solved, 565 unsolved
Search for dead transitions found 105 dead transitions in 30303ms
Found 105 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 105 transitions
Dead transitions reduction (with SMT) removed 105 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 465/480 places, 570/690 transitions.
Graph (complete) has 1210 edges and 465 vertex of which 360 are kept as prefixes of interest. Removing 105 places using SCC suffix rule.5 ms
Discarding 105 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 25 ms. Remains 360 /465 variables (removed 105) and now considering 570/570 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 360/480 places, 570/690 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30440 ms. Remains : 360/480 places, 570/690 transitions.
Support contains 130 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2024-06-01 19:55:00] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2024-06-01 19:55:00] [INFO ] Computed 19 invariants in 4 ms
[2024-06-01 19:55:00] [INFO ] Implicit Places using invariants in 360 ms returned []
[2024-06-01 19:55:00] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-06-01 19:55:00] [INFO ] Invariant cache hit.
[2024-06-01 19:55:01] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 19:55:01] [INFO ] Implicit Places using invariants and state equation in 1115 ms returned []
Implicit Place search using SMT with State Equation took 1478 ms to find 0 implicit places.
Running 685 sub problems to find dead transitions.
[2024-06-01 19:55:01] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-06-01 19:55:01] [INFO ] Invariant cache hit.
[2024-06-01 19:55:01] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 475/475 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 4/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 3 (OVERLAPS) 5/480 variables, 10/489 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 5/494 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 5/499 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:55:22] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 3 ms to minimize.
[2024-06-01 19:55:22] [INFO ] Deduced a trap composed of 35 places in 268 ms of which 3 ms to minimize.
[2024-06-01 19:55:22] [INFO ] Deduced a trap composed of 27 places in 249 ms of which 3 ms to minimize.
[2024-06-01 19:55:23] [INFO ] Deduced a trap composed of 36 places in 243 ms of which 4 ms to minimize.
[2024-06-01 19:55:23] [INFO ] Deduced a trap composed of 36 places in 230 ms of which 3 ms to minimize.
[2024-06-01 19:55:23] [INFO ] Deduced a trap composed of 45 places in 272 ms of which 4 ms to minimize.
[2024-06-01 19:55:23] [INFO ] Deduced a trap composed of 54 places in 261 ms of which 4 ms to minimize.
[2024-06-01 19:55:24] [INFO ] Deduced a trap composed of 32 places in 261 ms of which 4 ms to minimize.
[2024-06-01 19:55:24] [INFO ] Deduced a trap composed of 58 places in 209 ms of which 3 ms to minimize.
[2024-06-01 19:55:24] [INFO ] Deduced a trap composed of 14 places in 313 ms of which 4 ms to minimize.
[2024-06-01 19:55:25] [INFO ] Deduced a trap composed of 17 places in 274 ms of which 4 ms to minimize.
[2024-06-01 19:55:25] [INFO ] Deduced a trap composed of 13 places in 276 ms of which 4 ms to minimize.
[2024-06-01 19:55:25] [INFO ] Deduced a trap composed of 18 places in 224 ms of which 4 ms to minimize.
[2024-06-01 19:55:25] [INFO ] Deduced a trap composed of 10 places in 292 ms of which 4 ms to minimize.
[2024-06-01 19:55:26] [INFO ] Deduced a trap composed of 54 places in 200 ms of which 3 ms to minimize.
[2024-06-01 19:55:26] [INFO ] Deduced a trap composed of 60 places in 145 ms of which 3 ms to minimize.
[2024-06-01 19:55:26] [INFO ] Deduced a trap composed of 64 places in 146 ms of which 7 ms to minimize.
[2024-06-01 19:55:26] [INFO ] Deduced a trap composed of 39 places in 256 ms of which 5 ms to minimize.
[2024-06-01 19:55:26] [INFO ] Deduced a trap composed of 40 places in 263 ms of which 4 ms to minimize.
[2024-06-01 19:55:27] [INFO ] Deduced a trap composed of 18 places in 278 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 20/519 constraints. Problems are: Problem set: 0 solved, 685 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 480/1110 variables, and 519 constraints, problems are : Problem set: 0 solved, 685 unsolved in 30018 ms.
Refiners :[Domain max(s): 480/480 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/480 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 685/685 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 685 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 475/475 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 4/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 20/499 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 4 (OVERLAPS) 5/480 variables, 10/509 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 5/514 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 5/519 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:55:41] [INFO ] Deduced a trap composed of 14 places in 246 ms of which 4 ms to minimize.
[2024-06-01 19:55:41] [INFO ] Deduced a trap composed of 57 places in 237 ms of which 3 ms to minimize.
[2024-06-01 19:55:41] [INFO ] Deduced a trap composed of 86 places in 229 ms of which 3 ms to minimize.
[2024-06-01 19:55:41] [INFO ] Deduced a trap composed of 83 places in 206 ms of which 3 ms to minimize.
[2024-06-01 19:55:42] [INFO ] Deduced a trap composed of 84 places in 224 ms of which 4 ms to minimize.
[2024-06-01 19:55:42] [INFO ] Deduced a trap composed of 65 places in 201 ms of which 3 ms to minimize.
[2024-06-01 19:55:42] [INFO ] Deduced a trap composed of 62 places in 197 ms of which 3 ms to minimize.
[2024-06-01 19:55:42] [INFO ] Deduced a trap composed of 62 places in 198 ms of which 3 ms to minimize.
[2024-06-01 19:55:42] [INFO ] Deduced a trap composed of 96 places in 148 ms of which 3 ms to minimize.
[2024-06-01 19:55:43] [INFO ] Deduced a trap composed of 39 places in 248 ms of which 4 ms to minimize.
[2024-06-01 19:55:43] [INFO ] Deduced a trap composed of 61 places in 200 ms of which 4 ms to minimize.
[2024-06-01 19:55:43] [INFO ] Deduced a trap composed of 61 places in 183 ms of which 3 ms to minimize.
[2024-06-01 19:55:43] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 3 ms to minimize.
[2024-06-01 19:55:44] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 3 ms to minimize.
[2024-06-01 19:55:44] [INFO ] Deduced a trap composed of 21 places in 258 ms of which 4 ms to minimize.
[2024-06-01 19:55:44] [INFO ] Deduced a trap composed of 40 places in 243 ms of which 4 ms to minimize.
[2024-06-01 19:55:44] [INFO ] Deduced a trap composed of 25 places in 229 ms of which 3 ms to minimize.
[2024-06-01 19:55:45] [INFO ] Deduced a trap composed of 65 places in 204 ms of which 3 ms to minimize.
[2024-06-01 19:55:45] [INFO ] Deduced a trap composed of 65 places in 190 ms of which 3 ms to minimize.
[2024-06-01 19:55:45] [INFO ] Deduced a trap composed of 65 places in 193 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 20/539 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:55:46] [INFO ] Deduced a trap composed of 32 places in 215 ms of which 4 ms to minimize.
[2024-06-01 19:55:47] [INFO ] Deduced a trap composed of 32 places in 243 ms of which 3 ms to minimize.
[2024-06-01 19:55:47] [INFO ] Deduced a trap composed of 102 places in 262 ms of which 4 ms to minimize.
[2024-06-01 19:55:47] [INFO ] Deduced a trap composed of 62 places in 266 ms of which 4 ms to minimize.
[2024-06-01 19:55:47] [INFO ] Deduced a trap composed of 48 places in 225 ms of which 4 ms to minimize.
[2024-06-01 19:55:48] [INFO ] Deduced a trap composed of 62 places in 249 ms of which 4 ms to minimize.
[2024-06-01 19:55:48] [INFO ] Deduced a trap composed of 62 places in 204 ms of which 3 ms to minimize.
[2024-06-01 19:55:48] [INFO ] Deduced a trap composed of 43 places in 182 ms of which 4 ms to minimize.
[2024-06-01 19:55:48] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 3 ms to minimize.
[2024-06-01 19:55:48] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:55:49] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:55:49] [INFO ] Deduced a trap composed of 80 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:55:49] [INFO ] Deduced a trap composed of 80 places in 100 ms of which 2 ms to minimize.
[2024-06-01 19:55:49] [INFO ] Deduced a trap composed of 58 places in 134 ms of which 3 ms to minimize.
[2024-06-01 19:55:49] [INFO ] Deduced a trap composed of 42 places in 174 ms of which 3 ms to minimize.
[2024-06-01 19:55:49] [INFO ] Deduced a trap composed of 54 places in 152 ms of which 3 ms to minimize.
[2024-06-01 19:55:50] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 3 ms to minimize.
[2024-06-01 19:55:50] [INFO ] Deduced a trap composed of 43 places in 173 ms of which 3 ms to minimize.
[2024-06-01 19:55:50] [INFO ] Deduced a trap composed of 69 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:55:50] [INFO ] Deduced a trap composed of 50 places in 131 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 20/559 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:55:53] [INFO ] Deduced a trap composed of 88 places in 172 ms of which 3 ms to minimize.
[2024-06-01 19:55:53] [INFO ] Deduced a trap composed of 87 places in 171 ms of which 3 ms to minimize.
[2024-06-01 19:55:53] [INFO ] Deduced a trap composed of 87 places in 197 ms of which 3 ms to minimize.
[2024-06-01 19:55:53] [INFO ] Deduced a trap composed of 112 places in 159 ms of which 3 ms to minimize.
[2024-06-01 19:55:54] [INFO ] Deduced a trap composed of 128 places in 157 ms of which 3 ms to minimize.
[2024-06-01 19:55:54] [INFO ] Deduced a trap composed of 36 places in 280 ms of which 5 ms to minimize.
[2024-06-01 19:55:54] [INFO ] Deduced a trap composed of 83 places in 147 ms of which 3 ms to minimize.
[2024-06-01 19:55:54] [INFO ] Deduced a trap composed of 35 places in 242 ms of which 4 ms to minimize.
[2024-06-01 19:55:55] [INFO ] Deduced a trap composed of 76 places in 144 ms of which 3 ms to minimize.
[2024-06-01 19:55:55] [INFO ] Deduced a trap composed of 76 places in 169 ms of which 3 ms to minimize.
[2024-06-01 19:55:55] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 2 ms to minimize.
[2024-06-01 19:55:55] [INFO ] Deduced a trap composed of 58 places in 134 ms of which 3 ms to minimize.
[2024-06-01 19:55:55] [INFO ] Deduced a trap composed of 76 places in 129 ms of which 3 ms to minimize.
[2024-06-01 19:55:55] [INFO ] Deduced a trap composed of 76 places in 158 ms of which 3 ms to minimize.
[2024-06-01 19:55:56] [INFO ] Deduced a trap composed of 92 places in 141 ms of which 3 ms to minimize.
[2024-06-01 19:55:56] [INFO ] Deduced a trap composed of 92 places in 160 ms of which 3 ms to minimize.
[2024-06-01 19:55:56] [INFO ] Deduced a trap composed of 92 places in 162 ms of which 3 ms to minimize.
[2024-06-01 19:55:56] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 2 ms to minimize.
[2024-06-01 19:55:56] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 2 ms to minimize.
[2024-06-01 19:55:56] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/480 variables, 20/579 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:56:00] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:56:00] [INFO ] Deduced a trap composed of 54 places in 203 ms of which 3 ms to minimize.
[2024-06-01 19:56:01] [INFO ] Deduced a trap composed of 84 places in 178 ms of which 3 ms to minimize.
[2024-06-01 19:56:01] [INFO ] Deduced a trap composed of 84 places in 188 ms of which 3 ms to minimize.
[2024-06-01 19:56:01] [INFO ] Deduced a trap composed of 83 places in 183 ms of which 3 ms to minimize.
[2024-06-01 19:56:01] [INFO ] Deduced a trap composed of 119 places in 132 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/1110 variables, and 585 constraints, problems are : Problem set: 0 solved, 685 unsolved in 30022 ms.
Refiners :[Domain max(s): 480/480 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/480 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/685 constraints, Known Traps: 86/86 constraints]
After SMT, in 60184ms problems are : Problem set: 0 solved, 685 unsolved
Search for dead transitions found 0 dead transitions in 60193ms
Finished structural reductions in LTL mode , in 1 iterations and 61680 ms. Remains : 480/480 places, 690/690 transitions.
Treatment of property Peterson-PT-4-LTLFireability-02 finished in 219930 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 40 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2024-06-01 19:56:02] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-06-01 19:56:02] [INFO ] Invariant cache hit.
[2024-06-01 19:56:02] [INFO ] Implicit Places using invariants in 414 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 418 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 433 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-4-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 404 ms.
Product exploration explored 100000 steps with 50000 reset in 300 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 13 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-4-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-4-LTLFireability-03 finished in 1256 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)))'
Support contains 200 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2024-06-01 19:56:03] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-06-01 19:56:03] [INFO ] Invariant cache hit.
[2024-06-01 19:56:03] [INFO ] Implicit Places using invariants in 253 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 254 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 12 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 271 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : Peterson-PT-4-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-4-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-4-LTLFireability-04 finished in 415 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((G(p1)&&X(G(p2)))))))'
Support contains 35 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 192 rules applied. Total rules applied 192 place count 480 transition count 498
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 1 with 192 rules applied. Total rules applied 384 place count 288 transition count 498
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 384 place count 288 transition count 399
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 582 place count 189 transition count 399
Applied a total of 582 rules in 22 ms. Remains 189 /480 variables (removed 291) and now considering 399/690 (removed 291) transitions.
[2024-06-01 19:56:03] [INFO ] Flow matrix only has 339 transitions (discarded 60 similar events)
// Phase 1: matrix 339 rows 189 cols
[2024-06-01 19:56:03] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 19:56:04] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-06-01 19:56:04] [INFO ] Flow matrix only has 339 transitions (discarded 60 similar events)
[2024-06-01 19:56:04] [INFO ] Invariant cache hit.
[2024-06-01 19:56:04] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 19:56:04] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 786 ms to find 0 implicit places.
[2024-06-01 19:56:04] [INFO ] Redundant transitions in 8 ms returned []
Running 394 sub problems to find dead transitions.
[2024-06-01 19:56:04] [INFO ] Flow matrix only has 339 transitions (discarded 60 similar events)
[2024-06-01 19:56:04] [INFO ] Invariant cache hit.
[2024-06-01 19:56:04] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 184/184 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 5/189 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 4 (OVERLAPS) 5/189 variables, 9/199 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 5/204 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 4/208 constraints. Problems are: Problem set: 0 solved, 394 unsolved
[2024-06-01 19:56:12] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 2 ms to minimize.
[2024-06-01 19:56:12] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 2 ms to minimize.
[2024-06-01 19:56:12] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 2 ms to minimize.
[2024-06-01 19:56:12] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 2 ms to minimize.
[2024-06-01 19:56:12] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-06-01 19:56:12] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-06-01 19:56:12] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:56:13] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:56:13] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2024-06-01 19:56:13] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
[2024-06-01 19:56:13] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2024-06-01 19:56:13] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:56:13] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 2 ms to minimize.
[2024-06-01 19:56:13] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:56:13] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 2 ms to minimize.
[2024-06-01 19:56:13] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:56:13] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:56:13] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 2 ms to minimize.
[2024-06-01 19:56:13] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
[2024-06-01 19:56:14] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 20/228 constraints. Problems are: Problem set: 0 solved, 394 unsolved
[2024-06-01 19:56:14] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-06-01 19:56:14] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:56:14] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:56:14] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:56:14] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
[2024-06-01 19:56:14] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:56:14] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:56:14] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:56:14] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:56:14] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 2 ms to minimize.
[2024-06-01 19:56:14] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:56:15] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:56:15] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 2 ms to minimize.
[2024-06-01 19:56:15] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:56:15] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:56:15] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 2 ms to minimize.
[2024-06-01 19:56:15] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-06-01 19:56:15] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 2 ms to minimize.
[2024-06-01 19:56:15] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:56:15] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 20/248 constraints. Problems are: Problem set: 0 solved, 394 unsolved
[2024-06-01 19:56:16] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-06-01 19:56:16] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
[2024-06-01 19:56:16] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
[2024-06-01 19:56:16] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:56:16] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 2 ms to minimize.
[2024-06-01 19:56:16] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 2 ms to minimize.
[2024-06-01 19:56:16] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-06-01 19:56:16] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 2 ms to minimize.
[2024-06-01 19:56:16] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 2 ms to minimize.
[2024-06-01 19:56:17] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 2 ms to minimize.
[2024-06-01 19:56:17] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 2 ms to minimize.
[2024-06-01 19:56:17] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 2 ms to minimize.
[2024-06-01 19:56:17] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 3 ms to minimize.
[2024-06-01 19:56:17] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 3 ms to minimize.
[2024-06-01 19:56:17] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 3 ms to minimize.
[2024-06-01 19:56:17] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 2 ms to minimize.
[2024-06-01 19:56:17] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 2 ms to minimize.
[2024-06-01 19:56:18] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:56:18] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
[2024-06-01 19:56:18] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 20/268 constraints. Problems are: Problem set: 0 solved, 394 unsolved
[2024-06-01 19:56:22] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 2 ms to minimize.
[2024-06-01 19:56:22] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2024-06-01 19:56:22] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:56:22] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:56:22] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 1 ms to minimize.
[2024-06-01 19:56:22] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 2 ms to minimize.
[2024-06-01 19:56:22] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:56:23] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:56:23] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 1 ms to minimize.
[2024-06-01 19:56:23] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 1 ms to minimize.
[2024-06-01 19:56:23] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 1 ms to minimize.
[2024-06-01 19:56:23] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 2 ms to minimize.
[2024-06-01 19:56:23] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 2 ms to minimize.
[2024-06-01 19:56:23] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
[2024-06-01 19:56:23] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 3 ms to minimize.
[2024-06-01 19:56:24] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 2 ms to minimize.
[2024-06-01 19:56:24] [INFO ] Deduced a trap composed of 18 places in 183 ms of which 3 ms to minimize.
[2024-06-01 19:56:24] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-06-01 19:56:24] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:56:24] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 20/288 constraints. Problems are: Problem set: 0 solved, 394 unsolved
[2024-06-01 19:56:25] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:56:25] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:56:25] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:56:26] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 1 ms to minimize.
[2024-06-01 19:56:26] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:56:26] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 3 ms to minimize.
[2024-06-01 19:56:26] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 3 ms to minimize.
[2024-06-01 19:56:26] [INFO ] Deduced a trap composed of 36 places in 135 ms of which 3 ms to minimize.
[2024-06-01 19:56:26] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 2 ms to minimize.
[2024-06-01 19:56:26] [INFO ] Deduced a trap composed of 36 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:56:26] [INFO ] Deduced a trap composed of 54 places in 113 ms of which 2 ms to minimize.
[2024-06-01 19:56:27] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 3 ms to minimize.
[2024-06-01 19:56:27] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 3 ms to minimize.
[2024-06-01 19:56:27] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:56:27] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:56:28] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 2 ms to minimize.
[2024-06-01 19:56:28] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:56:28] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 2 ms to minimize.
[2024-06-01 19:56:28] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-06-01 19:56:28] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 20/308 constraints. Problems are: Problem set: 0 solved, 394 unsolved
[2024-06-01 19:56:30] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 2 ms to minimize.
[2024-06-01 19:56:31] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 2 ms to minimize.
[2024-06-01 19:56:31] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:56:32] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:56:32] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 2 ms to minimize.
[2024-06-01 19:56:32] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
[2024-06-01 19:56:33] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 2 ms to minimize.
[2024-06-01 19:56:33] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 3 ms to minimize.
[2024-06-01 19:56:33] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:56:34] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 2 ms to minimize.
[2024-06-01 19:56:34] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:56:34] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 2 ms to minimize.
[2024-06-01 19:56:34] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
SMT process timed out in 30220ms, After SMT, problems are : Problem set: 0 solved, 394 unsolved
Search for dead transitions found 0 dead transitions in 30226ms
Starting structural reductions in SI_LTL mode, iteration 1 : 189/480 places, 399/690 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31050 ms. Remains : 189/480 places, 399/690 transitions.
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : Peterson-PT-4-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 278 ms.
Stack based approach found an accepted trace after 25 steps with 0 reset with depth 26 and stack size 26 in 0 ms.
FORMULA Peterson-PT-4-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-4-LTLFireability-06 finished in 31599 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(p1)))))'
Support contains 120 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2024-06-01 19:56:35] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2024-06-01 19:56:35] [INFO ] Computed 19 invariants in 5 ms
[2024-06-01 19:56:36] [INFO ] Implicit Places using invariants in 557 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 561 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 575 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-4-LTLFireability-07
Entered a terminal (fully accepting) state of product in 58 steps with 0 reset in 1 ms.
FORMULA Peterson-PT-4-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-4-LTLFireability-07 finished in 768 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p0) U (p0 U X((p1 U p2)))))&&X(p1)))'
Support contains 4 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 11 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2024-06-01 19:56:36] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-06-01 19:56:36] [INFO ] Invariant cache hit.
[2024-06-01 19:56:36] [INFO ] Implicit Places using invariants in 411 ms returned [468, 469, 470, 471]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 413 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 476/480 places, 690/690 transitions.
Applied a total of 0 rules in 11 ms. Remains 476 /476 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 435 ms. Remains : 476/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 428 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), false, (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : Peterson-PT-4-LTLFireability-08
Product exploration explored 100000 steps with 1 reset in 321 ms.
Product exploration explored 100000 steps with 0 reset in 594 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be false thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 30 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-4-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-4-LTLFireability-08 finished in 1862 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 480 transition count 493
Reduce places removed 197 places and 0 transitions.
Iterating post reduction 1 with 197 rules applied. Total rules applied 394 place count 283 transition count 493
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 394 place count 283 transition count 393
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 594 place count 183 transition count 393
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 634 place count 163 transition count 373
Applied a total of 634 rules in 33 ms. Remains 163 /480 variables (removed 317) and now considering 373/690 (removed 317) transitions.
[2024-06-01 19:56:38] [INFO ] Flow matrix only has 313 transitions (discarded 60 similar events)
// Phase 1: matrix 313 rows 163 cols
[2024-06-01 19:56:38] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 19:56:38] [INFO ] Implicit Places using invariants in 272 ms returned [153, 154, 155, 156, 157]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 274 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/480 places, 373/690 transitions.
Applied a total of 0 rules in 5 ms. Remains 158 /158 variables (removed 0) and now considering 373/373 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 314 ms. Remains : 158/480 places, 373/690 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Peterson-PT-4-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 222 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 0 ms.
FORMULA Peterson-PT-4-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-4-LTLFireability-10 finished in 707 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 480 transition count 493
Reduce places removed 197 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 198 rules applied. Total rules applied 395 place count 283 transition count 492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 396 place count 282 transition count 492
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 396 place count 282 transition count 391
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 598 place count 181 transition count 391
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 636 place count 162 transition count 372
Applied a total of 636 rules in 30 ms. Remains 162 /480 variables (removed 318) and now considering 372/690 (removed 318) transitions.
[2024-06-01 19:56:38] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
// Phase 1: matrix 312 rows 162 cols
[2024-06-01 19:56:38] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 19:56:39] [INFO ] Implicit Places using invariants in 296 ms returned [152, 153, 154, 155, 156]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 298 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 157/480 places, 372/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 157 /157 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 335 ms. Remains : 157/480 places, 372/690 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-4-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 247 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 0 ms.
FORMULA Peterson-PT-4-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-4-LTLFireability-11 finished in 724 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G((G(p2)||p1)))))'
Support contains 4 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 480 transition count 491
Reduce places removed 199 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 200 rules applied. Total rules applied 399 place count 281 transition count 490
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 400 place count 280 transition count 490
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 98 Pre rules applied. Total rules applied 400 place count 280 transition count 392
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 596 place count 182 transition count 392
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 634 place count 163 transition count 373
Applied a total of 634 rules in 46 ms. Remains 163 /480 variables (removed 317) and now considering 373/690 (removed 317) transitions.
[2024-06-01 19:56:39] [INFO ] Flow matrix only has 313 transitions (discarded 60 similar events)
// Phase 1: matrix 313 rows 163 cols
[2024-06-01 19:56:39] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 19:56:39] [INFO ] Implicit Places using invariants in 254 ms returned [154, 155, 156, 157]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 255 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 159/480 places, 373/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 159 /159 variables (removed 0) and now considering 373/373 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 311 ms. Remains : 159/480 places, 373/690 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Peterson-PT-4-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 193 ms.
Stack based approach found an accepted trace after 369 steps with 0 reset with depth 370 and stack size 281 in 6 ms.
FORMULA Peterson-PT-4-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-4-LTLFireability-12 finished in 738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 480 transition count 493
Reduce places removed 197 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 198 rules applied. Total rules applied 395 place count 283 transition count 492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 396 place count 282 transition count 492
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 396 place count 282 transition count 392
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 596 place count 182 transition count 392
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 636 place count 162 transition count 372
Applied a total of 636 rules in 26 ms. Remains 162 /480 variables (removed 318) and now considering 372/690 (removed 318) transitions.
[2024-06-01 19:56:40] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
// Phase 1: matrix 312 rows 162 cols
[2024-06-01 19:56:40] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 19:56:40] [INFO ] Implicit Places using invariants in 273 ms returned [153, 154, 155, 156]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 275 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/480 places, 372/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 158 /158 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 306 ms. Remains : 158/480 places, 372/690 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : Peterson-PT-4-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 226 ms.
Product exploration explored 100000 steps with 0 reset in 301 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 394 ms. (101 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1365588 steps, run timeout after 3001 ms. (steps per millisecond=455 ) properties seen :0 out of 1
Probabilistic random walk after 1365588 steps, saw 227665 distinct states, run finished after 3001 ms. (steps per millisecond=455 ) properties seen :0
[2024-06-01 19:56:44] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
// Phase 1: matrix 312 rows 158 cols
[2024-06-01 19:56:44] [INFO ] Computed 15 invariants in 1 ms
[2024-06-01 19:56:44] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 53/56 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 53/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/57 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 126/183 variables, 57/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 24/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 68/251 variables, 20/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/251 variables, 20/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/251 variables, 4/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/251 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 120/371 variables, 24/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/371 variables, 24/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/371 variables, 92/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/371 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 54/425 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/425 variables, 54/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/425 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 3/428 variables, 3/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/428 variables, 3/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/428 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 42/470 variables, 57/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/470 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/470 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 447 constraints, problems are : Problem set: 0 solved, 1 unsolved in 287 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 53/56 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 53/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/57 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 126/183 variables, 57/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 24/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 68/251 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/251 variables, 20/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/251 variables, 4/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/251 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 120/371 variables, 24/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/371 variables, 24/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/371 variables, 92/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/371 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 54/425 variables, 3/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/425 variables, 54/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:56:45] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 3 ms to minimize.
[2024-06-01 19:56:45] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 2 ms to minimize.
[2024-06-01 19:56:45] [INFO ] Deduced a trap composed of 25 places in 163 ms of which 3 ms to minimize.
[2024-06-01 19:56:45] [INFO ] Deduced a trap composed of 22 places in 160 ms of which 3 ms to minimize.
[2024-06-01 19:56:45] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 2 ms to minimize.
[2024-06-01 19:56:46] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 3 ms to minimize.
[2024-06-01 19:56:46] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 2 ms to minimize.
[2024-06-01 19:56:46] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/425 variables, 8/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/425 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 3/428 variables, 3/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/428 variables, 3/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/428 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 42/470 variables, 57/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/470 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/470 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 456 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1588 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 1886ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 372/372 transitions.
Applied a total of 0 rules in 8 ms. Remains 158 /158 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 158/158 places, 372/372 transitions.
RANDOM walk for 40000 steps (8 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1165470 steps, run timeout after 3001 ms. (steps per millisecond=388 ) properties seen :0 out of 1
Probabilistic random walk after 1165470 steps, saw 194379 distinct states, run finished after 3001 ms. (steps per millisecond=388 ) properties seen :0
[2024-06-01 19:56:49] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
[2024-06-01 19:56:49] [INFO ] Invariant cache hit.
[2024-06-01 19:56:49] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 53/56 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 53/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/57 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 126/183 variables, 57/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 24/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 68/251 variables, 20/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/251 variables, 20/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/251 variables, 4/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/251 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 120/371 variables, 24/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/371 variables, 24/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/371 variables, 92/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/371 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 54/425 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/425 variables, 54/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/425 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 3/428 variables, 3/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/428 variables, 3/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/428 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 42/470 variables, 57/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/470 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/470 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 447 constraints, problems are : Problem set: 0 solved, 1 unsolved in 307 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 53/56 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 53/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/57 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 126/183 variables, 57/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 24/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 68/251 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/251 variables, 20/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/251 variables, 4/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/251 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 120/371 variables, 24/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/371 variables, 24/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/371 variables, 92/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/371 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 54/425 variables, 3/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/425 variables, 54/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:56:50] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:56:50] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 2 ms to minimize.
[2024-06-01 19:56:50] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 3 ms to minimize.
[2024-06-01 19:56:50] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/425 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/425 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 3/428 variables, 3/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/428 variables, 3/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/428 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 42/470 variables, 57/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:56:50] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 2 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/470 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/470 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/470 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 453 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1134 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1450ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 372/372 transitions.
Applied a total of 0 rules in 7 ms. Remains 158 /158 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 158/158 places, 372/372 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 372/372 transitions.
Applied a total of 0 rules in 7 ms. Remains 158 /158 variables (removed 0) and now considering 372/372 (removed 0) transitions.
[2024-06-01 19:56:50] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
[2024-06-01 19:56:50] [INFO ] Invariant cache hit.
[2024-06-01 19:56:51] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-06-01 19:56:51] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
[2024-06-01 19:56:51] [INFO ] Invariant cache hit.
[2024-06-01 19:56:51] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 19:56:52] [INFO ] Implicit Places using invariants and state equation in 769 ms returned []
Implicit Place search using SMT with State Equation took 1112 ms to find 0 implicit places.
[2024-06-01 19:56:52] [INFO ] Redundant transitions in 5 ms returned []
Running 367 sub problems to find dead transitions.
[2024-06-01 19:56:52] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
[2024-06-01 19:56:52] [INFO ] Invariant cache hit.
[2024-06-01 19:56:52] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 12/169 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 19:56:55] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 2 ms to minimize.
[2024-06-01 19:56:55] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:56:55] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 2 ms to minimize.
[2024-06-01 19:56:55] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:56:55] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 2 ms to minimize.
[2024-06-01 19:56:55] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 3 ms to minimize.
[2024-06-01 19:56:55] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 1 ms to minimize.
[2024-06-01 19:56:55] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:56:55] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:56:56] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-06-01 19:56:56] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2024-06-01 19:56:56] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:56:56] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:56:56] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2024-06-01 19:56:56] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 2 ms to minimize.
[2024-06-01 19:56:56] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-06-01 19:56:56] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 2 ms to minimize.
[2024-06-01 19:56:56] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 2 ms to minimize.
[2024-06-01 19:56:57] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:56:57] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 19:56:57] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 2 ms to minimize.
[2024-06-01 19:56:57] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-06-01 19:56:57] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:56:57] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:56:57] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:56:57] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
[2024-06-01 19:56:58] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:56:58] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:56:58] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2024-06-01 19:56:58] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:56:58] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 2 ms to minimize.
[2024-06-01 19:56:59] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 2 ms to minimize.
[2024-06-01 19:56:59] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
[2024-06-01 19:56:59] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 3 ms to minimize.
[2024-06-01 19:56:59] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 2 ms to minimize.
[2024-06-01 19:56:59] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:56:59] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 2 ms to minimize.
[2024-06-01 19:57:00] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 2 ms to minimize.
[2024-06-01 19:57:00] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:57:00] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 20/209 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 19:57:02] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 2 ms to minimize.
[2024-06-01 19:57:03] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:57:04] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-06-01 19:57:04] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 1 ms to minimize.
[2024-06-01 19:57:04] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 2 ms to minimize.
[2024-06-01 19:57:04] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 2 ms to minimize.
[2024-06-01 19:57:05] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-06-01 19:57:05] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-06-01 19:57:05] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-06-01 19:57:05] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 2 ms to minimize.
[2024-06-01 19:57:05] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 2 ms to minimize.
[2024-06-01 19:57:05] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:57:05] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 2 ms to minimize.
[2024-06-01 19:57:05] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:57:06] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-06-01 19:57:06] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 19:57:06] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 17/226 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 19:57:07] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (OVERLAPS) 1/158 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 19:57:17] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 3 ms to minimize.
[2024-06-01 19:57:17] [INFO ] Deduced a trap composed of 22 places in 185 ms of which 3 ms to minimize.
[2024-06-01 19:57:17] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 2 ms to minimize.
[2024-06-01 19:57:17] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 2 ms to minimize.
[2024-06-01 19:57:18] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 2 ms to minimize.
[2024-06-01 19:57:18] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 2 ms to minimize.
[2024-06-01 19:57:18] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 2 ms to minimize.
[2024-06-01 19:57:18] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 3 ms to minimize.
[2024-06-01 19:57:18] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 2 ms to minimize.
[2024-06-01 19:57:18] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2024-06-01 19:57:18] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:57:19] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:57:19] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 2 ms to minimize.
[2024-06-01 19:57:19] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 2 ms to minimize.
[2024-06-01 19:57:19] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-06-01 19:57:19] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2024-06-01 19:57:20] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-06-01 19:57:20] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 3 ms to minimize.
[2024-06-01 19:57:20] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:57:20] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 19:57:21] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:57:21] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:57:21] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:57:22] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-06-01 19:57:22] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:57:22] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 158/470 variables, and 257 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30018 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/158 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 84/84 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 12/169 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 84/253 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 19:57:25] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:57:25] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-06-01 19:57:26] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 3/256 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 19:57:27] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (OVERLAPS) 1/158 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 19:57:33] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:57:33] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:57:33] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 3 ms to minimize.
[2024-06-01 19:57:33] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 2 ms to minimize.
[2024-06-01 19:57:33] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:57:34] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:57:34] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 2 ms to minimize.
[2024-06-01 19:57:34] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 2 ms to minimize.
[2024-06-01 19:57:35] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 2 ms to minimize.
[2024-06-01 19:57:35] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 2 ms to minimize.
[2024-06-01 19:57:35] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
[2024-06-01 19:57:35] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-06-01 19:57:35] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 2 ms to minimize.
[2024-06-01 19:57:35] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
[2024-06-01 19:57:35] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 2 ms to minimize.
[2024-06-01 19:57:36] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 3 ms to minimize.
[2024-06-01 19:57:36] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:57:36] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:57:36] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 3 ms to minimize.
[2024-06-01 19:57:37] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 19:57:40] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:57:40] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:57:40] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2024-06-01 19:57:40] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:57:41] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 5/286 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 12 (OVERLAPS) 312/470 variables, 158/444 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/470 variables, 116/560 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/470 variables, and 927 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30050 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 113/113 constraints]
After SMT, in 60223ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60231ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61368 ms. Remains : 158/158 places, 372/372 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 280 edges and 158 vertex of which 98 / 158 are part of one of the 20 SCC in 1 ms
Free SCC test removed 78 places
Drop transitions (Empty/Sink Transition effects.) removed 156 transitions
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 235 transitions.
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 19 Pre rules applied. Total rules applied 1 place count 80 transition count 118
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 39 place count 61 transition count 118
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 43 place count 59 transition count 115
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 57 place count 50 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 25 edges and 50 vertex of which 20 / 50 are part of one of the 4 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 59 place count 34 transition count 114
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (trivial) has 53 edges and 31 vertex of which 12 / 31 are part of one of the 4 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 24 rules applied. Total rules applied 83 place count 23 transition count 94
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 58 transitions.
Iterating post reduction 2 with 58 rules applied. Total rules applied 141 place count 23 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 144 place count 23 transition count 33
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 145 place count 23 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 146 place count 22 transition count 32
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 147 place count 22 transition count 32
Applied a total of 147 rules in 14 ms. Remains 22 /158 variables (removed 136) and now considering 32/372 (removed 340) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 32 rows 22 cols
[2024-06-01 19:57:52] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 19:57:52] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 19:57:52] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 19:57:52] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 19:57:52] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 19:57:52] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 19:57:52] [INFO ] After 49ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 95 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 372/372 transitions.
Applied a total of 0 rules in 21 ms. Remains 158 /158 variables (removed 0) and now considering 372/372 (removed 0) transitions.
[2024-06-01 19:57:52] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
// Phase 1: matrix 312 rows 158 cols
[2024-06-01 19:57:52] [INFO ] Computed 15 invariants in 2 ms
[2024-06-01 19:57:52] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-06-01 19:57:52] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
[2024-06-01 19:57:53] [INFO ] Invariant cache hit.
[2024-06-01 19:57:53] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 19:57:53] [INFO ] Implicit Places using invariants and state equation in 746 ms returned []
Implicit Place search using SMT with State Equation took 1098 ms to find 0 implicit places.
[2024-06-01 19:57:53] [INFO ] Redundant transitions in 3 ms returned []
Running 367 sub problems to find dead transitions.
[2024-06-01 19:57:53] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
[2024-06-01 19:57:53] [INFO ] Invariant cache hit.
[2024-06-01 19:57:53] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 12/169 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 19:57:56] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 3 ms to minimize.
[2024-06-01 19:57:56] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:57:56] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-06-01 19:57:57] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 2 ms to minimize.
[2024-06-01 19:57:57] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:57:57] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:57:57] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-06-01 19:57:57] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 2 ms to minimize.
[2024-06-01 19:57:57] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:57:57] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 2 ms to minimize.
[2024-06-01 19:57:57] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
[2024-06-01 19:57:57] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:57:58] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:57:58] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-06-01 19:57:58] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:57:58] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2024-06-01 19:57:58] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 2 ms to minimize.
[2024-06-01 19:57:58] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-06-01 19:57:58] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2024-06-01 19:57:59] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 19:57:59] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:57:59] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:57:59] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2024-06-01 19:57:59] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 2 ms to minimize.
[2024-06-01 19:57:59] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:58:00] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 2 ms to minimize.
[2024-06-01 19:58:00] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:58:00] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:58:00] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 2 ms to minimize.
[2024-06-01 19:58:00] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-06-01 19:58:00] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 3 ms to minimize.
[2024-06-01 19:58:01] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 3 ms to minimize.
[2024-06-01 19:58:01] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 2 ms to minimize.
[2024-06-01 19:58:01] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2024-06-01 19:58:01] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 2 ms to minimize.
[2024-06-01 19:58:01] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:58:01] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:58:02] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 2 ms to minimize.
[2024-06-01 19:58:02] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 2 ms to minimize.
[2024-06-01 19:58:02] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 20/209 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 19:58:04] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:58:05] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:58:06] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-06-01 19:58:07] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 1 ms to minimize.
[2024-06-01 19:58:07] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 2 ms to minimize.
[2024-06-01 19:58:07] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2024-06-01 19:58:07] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 2 ms to minimize.
[2024-06-01 19:58:07] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-06-01 19:58:07] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2024-06-01 19:58:07] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 2 ms to minimize.
[2024-06-01 19:58:07] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 2 ms to minimize.
[2024-06-01 19:58:07] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:58:08] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 2 ms to minimize.
[2024-06-01 19:58:08] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:58:08] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:58:08] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-01 19:58:08] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 17/226 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 19:58:09] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (OVERLAPS) 1/158 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 19:58:19] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 3 ms to minimize.
[2024-06-01 19:58:19] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 3 ms to minimize.
[2024-06-01 19:58:20] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 2 ms to minimize.
[2024-06-01 19:58:20] [INFO ] Deduced a trap composed of 20 places in 173 ms of which 3 ms to minimize.
[2024-06-01 19:58:20] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 3 ms to minimize.
[2024-06-01 19:58:20] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 2 ms to minimize.
[2024-06-01 19:58:20] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 2 ms to minimize.
[2024-06-01 19:58:20] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 2 ms to minimize.
[2024-06-01 19:58:20] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:58:21] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-06-01 19:58:21] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:58:21] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:58:21] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 1 ms to minimize.
[2024-06-01 19:58:21] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 2 ms to minimize.
[2024-06-01 19:58:21] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-06-01 19:58:22] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:58:22] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:58:22] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
[2024-06-01 19:58:22] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:58:22] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 19:58:23] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 158/470 variables, and 252 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30019 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/158 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 79/79 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 12/169 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 79/248 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 19:58:27] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
[2024-06-01 19:58:27] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 2/250 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (OVERLAPS) 1/158 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 19:58:32] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 2 ms to minimize.
[2024-06-01 19:58:32] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 2 ms to minimize.
[2024-06-01 19:58:32] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-06-01 19:58:33] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:58:33] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-06-01 19:58:33] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 2 ms to minimize.
[2024-06-01 19:58:33] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2024-06-01 19:58:34] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 1 ms to minimize.
[2024-06-01 19:58:34] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 1 ms to minimize.
[2024-06-01 19:58:34] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:58:35] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
[2024-06-01 19:58:35] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 2 ms to minimize.
[2024-06-01 19:58:35] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 2 ms to minimize.
[2024-06-01 19:58:35] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 2 ms to minimize.
[2024-06-01 19:58:35] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 3 ms to minimize.
[2024-06-01 19:58:35] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:58:35] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:58:36] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:58:36] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 1 ms to minimize.
[2024-06-01 19:58:36] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 20/274 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 19:58:37] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:58:38] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 1 ms to minimize.
[2024-06-01 19:58:39] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 2 ms to minimize.
[2024-06-01 19:58:39] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 3 ms to minimize.
[2024-06-01 19:58:39] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:58:39] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 2 ms to minimize.
[2024-06-01 19:58:40] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 1 ms to minimize.
[2024-06-01 19:58:40] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 3 ms to minimize.
[2024-06-01 19:58:40] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 ms to minimize.
[2024-06-01 19:58:40] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 2 ms to minimize.
[2024-06-01 19:58:40] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:58:42] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 2 ms to minimize.
[2024-06-01 19:58:42] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:58:42] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 2 ms to minimize.
[2024-06-01 19:58:42] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 15/289 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 19:58:44] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 3 ms to minimize.
[2024-06-01 19:58:46] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:58:47] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 3 ms to minimize.
[2024-06-01 19:58:47] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 4/293 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 19:58:51] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 2 ms to minimize.
[2024-06-01 19:58:52] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:58:52] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 3 ms to minimize.
[2024-06-01 19:58:52] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-06-01 19:58:53] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 158/470 variables, and 298 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30016 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/158 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/367 constraints, Known Traps: 125/125 constraints]
After SMT, in 60189ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60197ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61330 ms. Remains : 158/158 places, 372/372 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1234788 steps, run timeout after 3001 ms. (steps per millisecond=411 ) properties seen :0 out of 1
Probabilistic random walk after 1234788 steps, saw 205925 distinct states, run finished after 3001 ms. (steps per millisecond=411 ) properties seen :0
[2024-06-01 19:58:57] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
[2024-06-01 19:58:57] [INFO ] Invariant cache hit.
[2024-06-01 19:58:57] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 53/56 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 53/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/57 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 126/183 variables, 57/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 24/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 68/251 variables, 20/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/251 variables, 20/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/251 variables, 4/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/251 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 120/371 variables, 24/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/371 variables, 24/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/371 variables, 92/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/371 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 54/425 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/425 variables, 54/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/425 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 3/428 variables, 3/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/428 variables, 3/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/428 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 42/470 variables, 57/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/470 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/470 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 447 constraints, problems are : Problem set: 0 solved, 1 unsolved in 256 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 53/56 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 53/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/57 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 126/183 variables, 57/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 24/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 68/251 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/251 variables, 20/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/251 variables, 4/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/251 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 120/371 variables, 24/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/371 variables, 24/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/371 variables, 92/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/371 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 54/425 variables, 3/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/425 variables, 54/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:58:57] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 3 ms to minimize.
[2024-06-01 19:58:58] [INFO ] Deduced a trap composed of 21 places in 179 ms of which 2 ms to minimize.
[2024-06-01 19:58:58] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 4 ms to minimize.
[2024-06-01 19:58:58] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/425 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/425 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 3/428 variables, 3/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/428 variables, 3/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/428 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 42/470 variables, 57/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:58:58] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 2 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/470 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/470 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/470 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 453 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1201 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1484ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 372/372 transitions.
Applied a total of 0 rules in 8 ms. Remains 158 /158 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 158/158 places, 372/372 transitions.
RANDOM walk for 40000 steps (8 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1246734 steps, run timeout after 3001 ms. (steps per millisecond=415 ) properties seen :0 out of 1
Probabilistic random walk after 1246734 steps, saw 207856 distinct states, run finished after 3002 ms. (steps per millisecond=415 ) properties seen :0
[2024-06-01 19:59:01] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
[2024-06-01 19:59:01] [INFO ] Invariant cache hit.
[2024-06-01 19:59:01] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 53/56 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 53/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/57 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 126/183 variables, 57/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 24/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 68/251 variables, 20/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/251 variables, 20/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/251 variables, 4/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/251 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 120/371 variables, 24/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/371 variables, 24/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/371 variables, 92/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/371 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 54/425 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/425 variables, 54/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/425 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 3/428 variables, 3/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/428 variables, 3/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/428 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 42/470 variables, 57/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/470 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/470 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 447 constraints, problems are : Problem set: 0 solved, 1 unsolved in 281 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 53/56 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 53/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/57 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 126/183 variables, 57/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 24/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 68/251 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/251 variables, 20/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/251 variables, 4/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/251 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 120/371 variables, 24/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/371 variables, 24/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/371 variables, 92/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/371 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 54/425 variables, 3/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/425 variables, 54/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:59:02] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:59:02] [INFO ] Deduced a trap composed of 21 places in 187 ms of which 2 ms to minimize.
[2024-06-01 19:59:02] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:59:02] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/425 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/425 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 3/428 variables, 3/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/428 variables, 3/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/428 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 42/470 variables, 57/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:59:03] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/470 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/470 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/470 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 453 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1041 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1342ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 372/372 transitions.
Applied a total of 0 rules in 7 ms. Remains 158 /158 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 158/158 places, 372/372 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 372/372 transitions.
Applied a total of 0 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 372/372 (removed 0) transitions.
[2024-06-01 19:59:03] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
[2024-06-01 19:59:03] [INFO ] Invariant cache hit.
[2024-06-01 19:59:03] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-06-01 19:59:03] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
[2024-06-01 19:59:03] [INFO ] Invariant cache hit.
[2024-06-01 19:59:03] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 19:59:04] [INFO ] Implicit Places using invariants and state equation in 728 ms returned []
Implicit Place search using SMT with State Equation took 1092 ms to find 0 implicit places.
[2024-06-01 19:59:04] [INFO ] Redundant transitions in 4 ms returned []
Running 367 sub problems to find dead transitions.
[2024-06-01 19:59:04] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
[2024-06-01 19:59:04] [INFO ] Invariant cache hit.
[2024-06-01 19:59:04] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 12/169 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 19:59:07] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 3 ms to minimize.
[2024-06-01 19:59:07] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 2 ms to minimize.
[2024-06-01 19:59:07] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 1 ms to minimize.
[2024-06-01 19:59:07] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:59:07] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-06-01 19:59:07] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 3 ms to minimize.
[2024-06-01 19:59:07] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 2 ms to minimize.
[2024-06-01 19:59:08] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 2 ms to minimize.
[2024-06-01 19:59:08] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:59:08] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:59:08] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:59:08] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:59:08] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:59:08] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:59:08] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 2 ms to minimize.
[2024-06-01 19:59:08] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:59:09] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 2 ms to minimize.
[2024-06-01 19:59:09] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-06-01 19:59:09] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-06-01 19:59:09] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 19:59:09] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 3 ms to minimize.
[2024-06-01 19:59:09] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:59:10] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-06-01 19:59:10] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 2 ms to minimize.
[2024-06-01 19:59:10] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:59:10] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 2 ms to minimize.
[2024-06-01 19:59:10] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 2 ms to minimize.
[2024-06-01 19:59:10] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 2 ms to minimize.
[2024-06-01 19:59:11] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2024-06-01 19:59:11] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:59:11] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 2 ms to minimize.
[2024-06-01 19:59:11] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 2 ms to minimize.
[2024-06-01 19:59:11] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 2 ms to minimize.
[2024-06-01 19:59:12] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 2 ms to minimize.
[2024-06-01 19:59:12] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 2 ms to minimize.
[2024-06-01 19:59:12] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 2 ms to minimize.
[2024-06-01 19:59:12] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
[2024-06-01 19:59:12] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 2 ms to minimize.
[2024-06-01 19:59:13] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 2 ms to minimize.
[2024-06-01 19:59:13] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 20/209 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 19:59:15] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 2 ms to minimize.
[2024-06-01 19:59:16] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:59:17] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2024-06-01 19:59:17] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
[2024-06-01 19:59:17] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 2 ms to minimize.
[2024-06-01 19:59:17] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
[2024-06-01 19:59:18] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 1 ms to minimize.
[2024-06-01 19:59:18] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
[2024-06-01 19:59:18] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 1 ms to minimize.
[2024-06-01 19:59:18] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-06-01 19:59:18] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 1 ms to minimize.
[2024-06-01 19:59:18] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 2 ms to minimize.
[2024-06-01 19:59:18] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 2 ms to minimize.
[2024-06-01 19:59:18] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:59:19] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 2 ms to minimize.
[2024-06-01 19:59:19] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:59:19] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 17/226 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 19:59:20] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (OVERLAPS) 1/158 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 19:59:30] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 2 ms to minimize.
[2024-06-01 19:59:30] [INFO ] Deduced a trap composed of 22 places in 170 ms of which 2 ms to minimize.
[2024-06-01 19:59:30] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 2 ms to minimize.
[2024-06-01 19:59:30] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 3 ms to minimize.
[2024-06-01 19:59:30] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 3 ms to minimize.
[2024-06-01 19:59:31] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:59:31] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 2 ms to minimize.
[2024-06-01 19:59:31] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:59:31] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:59:31] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 2 ms to minimize.
[2024-06-01 19:59:31] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:59:31] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:59:32] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 2 ms to minimize.
[2024-06-01 19:59:32] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 1 ms to minimize.
[2024-06-01 19:59:32] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-06-01 19:59:32] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 1 ms to minimize.
[2024-06-01 19:59:33] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
[2024-06-01 19:59:33] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 2 ms to minimize.
[2024-06-01 19:59:33] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 1 ms to minimize.
[2024-06-01 19:59:33] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 19:59:34] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 158/470 variables, and 252 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30012 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/158 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 79/79 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 12/169 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 79/248 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 19:59:36] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:59:37] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 2/250 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (OVERLAPS) 1/158 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 19:59:42] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:59:42] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 2 ms to minimize.
[2024-06-01 19:59:42] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-06-01 19:59:42] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:59:43] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:59:43] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-06-01 19:59:43] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2024-06-01 19:59:43] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 2 ms to minimize.
[2024-06-01 19:59:43] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:59:43] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:59:44] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:59:44] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2024-06-01 19:59:44] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 2 ms to minimize.
[2024-06-01 19:59:44] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:59:44] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2024-06-01 19:59:44] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:59:44] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:59:45] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2024-06-01 19:59:45] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2024-06-01 19:59:45] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 20/274 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 19:59:46] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 4 ms to minimize.
[2024-06-01 19:59:47] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:59:48] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:59:48] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 2 ms to minimize.
[2024-06-01 19:59:49] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:59:49] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-06-01 19:59:49] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
[2024-06-01 19:59:49] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:59:49] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-06-01 19:59:49] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:59:50] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 3 ms to minimize.
[2024-06-01 19:59:51] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:59:51] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:59:51] [INFO ] Deduced a trap composed of 48 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:59:51] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 15/289 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 19:59:53] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 3 ms to minimize.
[2024-06-01 19:59:56] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 2 ms to minimize.
[2024-06-01 19:59:56] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:59:56] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 4/293 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 20:00:00] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2024-06-01 20:00:01] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-06-01 20:00:01] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
[2024-06-01 20:00:01] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-06-01 20:00:02] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 5/298 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 158/470 variables, and 298 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30013 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/158 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/367 constraints, Known Traps: 125/125 constraints]
After SMT, in 60170ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60177ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61289 ms. Remains : 158/158 places, 372/372 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 280 edges and 158 vertex of which 98 / 158 are part of one of the 20 SCC in 0 ms
Free SCC test removed 78 places
Drop transitions (Empty/Sink Transition effects.) removed 156 transitions
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 235 transitions.
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 19 Pre rules applied. Total rules applied 1 place count 80 transition count 118
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 39 place count 61 transition count 118
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 43 place count 59 transition count 115
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 57 place count 50 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 25 edges and 50 vertex of which 20 / 50 are part of one of the 4 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 59 place count 34 transition count 114
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (trivial) has 53 edges and 31 vertex of which 12 / 31 are part of one of the 4 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 24 rules applied. Total rules applied 83 place count 23 transition count 94
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 58 transitions.
Iterating post reduction 2 with 58 rules applied. Total rules applied 141 place count 23 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 144 place count 23 transition count 33
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 145 place count 23 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 146 place count 22 transition count 32
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 147 place count 22 transition count 32
Applied a total of 147 rules in 14 ms. Remains 22 /158 variables (removed 136) and now considering 32/372 (removed 340) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 32 rows 22 cols
[2024-06-01 20:00:04] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 20:00:04] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 20:00:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 20:00:04] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 20:00:04] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 20:00:04] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 20:00:04] [INFO ] After 66ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 110 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 160 ms.
Product exploration explored 100000 steps with 0 reset in 184 ms.
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 372/372 transitions.
Applied a total of 0 rules in 4 ms. Remains 158 /158 variables (removed 0) and now considering 372/372 (removed 0) transitions.
[2024-06-01 20:00:05] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
// Phase 1: matrix 312 rows 158 cols
[2024-06-01 20:00:05] [INFO ] Computed 15 invariants in 1 ms
[2024-06-01 20:00:05] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-06-01 20:00:05] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
[2024-06-01 20:00:05] [INFO ] Invariant cache hit.
[2024-06-01 20:00:05] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 20:00:06] [INFO ] Implicit Places using invariants and state equation in 670 ms returned []
Implicit Place search using SMT with State Equation took 954 ms to find 0 implicit places.
[2024-06-01 20:00:06] [INFO ] Redundant transitions in 3 ms returned []
Running 367 sub problems to find dead transitions.
[2024-06-01 20:00:06] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
[2024-06-01 20:00:06] [INFO ] Invariant cache hit.
[2024-06-01 20:00:06] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 12/169 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 20:00:08] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-06-01 20:00:08] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 2 ms to minimize.
[2024-06-01 20:00:08] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-06-01 20:00:08] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 2 ms to minimize.
[2024-06-01 20:00:08] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-06-01 20:00:08] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 2 ms to minimize.
[2024-06-01 20:00:08] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2024-06-01 20:00:09] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 2 ms to minimize.
[2024-06-01 20:00:09] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 2 ms to minimize.
[2024-06-01 20:00:09] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-06-01 20:00:09] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-01 20:00:09] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-06-01 20:00:09] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 20:00:09] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-06-01 20:00:09] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-06-01 20:00:09] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-06-01 20:00:09] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-06-01 20:00:09] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-06-01 20:00:10] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 2 ms to minimize.
[2024-06-01 20:00:10] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 20:00:10] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 2 ms to minimize.
[2024-06-01 20:00:10] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2024-06-01 20:00:10] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-06-01 20:00:10] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-06-01 20:00:10] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-01 20:00:11] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
[2024-06-01 20:00:11] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 2 ms to minimize.
[2024-06-01 20:00:11] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-06-01 20:00:11] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 2 ms to minimize.
[2024-06-01 20:00:11] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-01 20:00:12] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 2 ms to minimize.
[2024-06-01 20:00:12] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2024-06-01 20:00:12] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 2 ms to minimize.
[2024-06-01 20:00:12] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-06-01 20:00:12] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 2 ms to minimize.
[2024-06-01 20:00:13] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-06-01 20:00:13] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-06-01 20:00:13] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2024-06-01 20:00:13] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 2 ms to minimize.
[2024-06-01 20:00:13] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 20/209 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 20:00:15] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-06-01 20:00:16] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-06-01 20:00:17] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-06-01 20:00:17] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 2 ms to minimize.
[2024-06-01 20:00:17] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 2 ms to minimize.
[2024-06-01 20:00:17] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2024-06-01 20:00:17] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-06-01 20:00:18] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-06-01 20:00:18] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-06-01 20:00:18] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-06-01 20:00:18] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-06-01 20:00:18] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:00:18] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
[2024-06-01 20:00:18] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-01 20:00:18] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 20:00:18] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-06-01 20:00:19] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 17/226 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 20:00:19] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (OVERLAPS) 1/158 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 20:00:29] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 2 ms to minimize.
[2024-06-01 20:00:29] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 2 ms to minimize.
[2024-06-01 20:00:29] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 2 ms to minimize.
[2024-06-01 20:00:29] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 1 ms to minimize.
[2024-06-01 20:00:29] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
[2024-06-01 20:00:29] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 2 ms to minimize.
[2024-06-01 20:00:29] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 2 ms to minimize.
[2024-06-01 20:00:30] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 3 ms to minimize.
[2024-06-01 20:00:30] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 3 ms to minimize.
[2024-06-01 20:00:30] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2024-06-01 20:00:30] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 2 ms to minimize.
[2024-06-01 20:00:30] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 3 ms to minimize.
[2024-06-01 20:00:30] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 2 ms to minimize.
[2024-06-01 20:00:30] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 3 ms to minimize.
[2024-06-01 20:00:30] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-06-01 20:00:31] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
[2024-06-01 20:00:31] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 2 ms to minimize.
[2024-06-01 20:00:31] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 2 ms to minimize.
[2024-06-01 20:00:31] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 2 ms to minimize.
[2024-06-01 20:00:32] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 20:00:32] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 2 ms to minimize.
[2024-06-01 20:00:33] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-06-01 20:00:33] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:00:33] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 2 ms to minimize.
[2024-06-01 20:00:34] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-01 20:00:34] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-06-01 20:00:34] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 2 ms to minimize.
[2024-06-01 20:00:34] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 2 ms to minimize.
[2024-06-01 20:00:34] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 2 ms to minimize.
[2024-06-01 20:00:35] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 2 ms to minimize.
[2024-06-01 20:00:35] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
[2024-06-01 20:00:35] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 2 ms to minimize.
[2024-06-01 20:00:35] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 2 ms to minimize.
[2024-06-01 20:00:35] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 1 ms to minimize.
[2024-06-01 20:00:35] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
[2024-06-01 20:00:36] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
[2024-06-01 20:00:36] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
SMT process timed out in 30133ms, After SMT, problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 30138ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31107 ms. Remains : 158/158 places, 372/372 transitions.
Treatment of property Peterson-PT-4-LTLFireability-13 finished in 236054 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F((X(p0) U p1))||G(p2)))&&X(F(p3))))'
Support contains 3 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 9 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2024-06-01 20:00:36] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2024-06-01 20:00:36] [INFO ] Computed 19 invariants in 4 ms
[2024-06-01 20:00:36] [INFO ] Implicit Places using invariants in 540 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 546 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 8 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 564 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (NOT p3), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Peterson-PT-4-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 249 ms.
Stack based approach found an accepted trace after 82 steps with 0 reset with depth 83 and stack size 83 in 0 ms.
FORMULA Peterson-PT-4-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-4-LTLFireability-15 finished in 1133 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U X(X((p1 U (F(p3)||p2)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-06-01 20:00:37] [INFO ] Flatten gal took : 40 ms
[2024-06-01 20:00:37] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-06-01 20:00:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 480 places, 690 transitions and 2120 arcs took 10 ms.
Total runtime 661802 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : Peterson-PT-4-LTLFireability-02
FORMULA Peterson-PT-4-LTLFireability-13 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
BK_STOP 1717272768096
--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name Peterson-PT-4-LTLFireability-02
ltl formula formula --ltl=/tmp/5115/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 480 places, 690 transitions and 2120 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.050 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5115/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5115/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5115/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5115/ltl_0_
terminate called after throwing an instance of 'std::runtime_error'
what(): too many children for formula
ltl formula name Peterson-PT-4-LTLFireability-13
ltl formula formula --ltl=/tmp/5115/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 480 places, 690 transitions and 2120 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.010 user 0.040 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5115/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5115/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5115/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5115/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 481 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 481, there are 704 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~2494 levels ~10000 states ~148564 transitions
pnml2lts-mc( 3/ 4): ~4961 levels ~20000 states ~298204 transitions
pnml2lts-mc( 3/ 4): ~9858 levels ~40000 states ~597684 transitions
pnml2lts-mc( 3/ 4): ~13242 levels ~80000 states ~1197084 transitions
pnml2lts-mc( 3/ 4): ~13458 levels ~160000 states ~2380724 transitions
pnml2lts-mc( 3/ 4): ~13458 levels ~320000 states ~4780724 transitions
pnml2lts-mc( 3/ 4): ~15540 levels ~640000 states ~9562804 transitions
pnml2lts-mc( 3/ 4): ~15540 levels ~1280000 states ~19161164 transitions
pnml2lts-mc( 3/ 4): ~17474 levels ~2560000 states ~38309044 transitions
pnml2lts-mc( 0/ 4): ~27977 levels ~5120000 states ~76704364 transitions
pnml2lts-mc( 1/ 4): ~26450 levels ~10240000 states ~150099844 transitions
pnml2lts-mc( 1/ 4): ~26450 levels ~20480000 states ~303457324 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2217591
pnml2lts-mc( 0/ 4): unique states count: 33553637
pnml2lts-mc( 0/ 4): unique transitions count: 498209255
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 252693390
pnml2lts-mc( 0/ 4): - claim found count: 212116346
pnml2lts-mc( 0/ 4): - claim success count: 33575136
pnml2lts-mc( 0/ 4): - cum. max stack depth: 93512
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33585523 states 498678436 transitions, fanout: 14.848
pnml2lts-mc( 0/ 4): Total exploration time 727.300 sec (727.220 sec minimum, 727.247 sec on average)
pnml2lts-mc( 0/ 4): States per second: 46178, Transitions per second: 685657
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 297.1MB, 9.3 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/64.0%
pnml2lts-mc( 0/ 4): Stored 702 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 297.1MB (~256.0MB paged-in)
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="Peterson-PT-4"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Peterson-PT-4, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r512-smll-171654407300268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-4.tgz
mv Peterson-PT-4 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;