About the Execution of GreatSPN+red for DES-PT-50a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3753.243 | 1406964.00 | 1617937.00 | 3440.30 | F?TFFFTTFFFTFTTT | 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.r091-tall-171624188300731.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is DES-PT-50a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624188300731
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 08:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 97K May 18 16:42 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 DES-PT-50a-LTLCardinality-00
FORMULA_NAME DES-PT-50a-LTLCardinality-01
FORMULA_NAME DES-PT-50a-LTLCardinality-02
FORMULA_NAME DES-PT-50a-LTLCardinality-03
FORMULA_NAME DES-PT-50a-LTLCardinality-04
FORMULA_NAME DES-PT-50a-LTLCardinality-05
FORMULA_NAME DES-PT-50a-LTLCardinality-06
FORMULA_NAME DES-PT-50a-LTLCardinality-07
FORMULA_NAME DES-PT-50a-LTLCardinality-08
FORMULA_NAME DES-PT-50a-LTLCardinality-09
FORMULA_NAME DES-PT-50a-LTLCardinality-10
FORMULA_NAME DES-PT-50a-LTLCardinality-11
FORMULA_NAME DES-PT-50a-LTLCardinality-12
FORMULA_NAME DES-PT-50a-LTLCardinality-13
FORMULA_NAME DES-PT-50a-LTLCardinality-14
FORMULA_NAME DES-PT-50a-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716325135030
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-50a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 20:58:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 20:58:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:58:56] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2024-05-21 20:58:56] [INFO ] Transformed 314 places.
[2024-05-21 20:58:56] [INFO ] Transformed 271 transitions.
[2024-05-21 20:58:56] [INFO ] Found NUPN structural information;
[2024-05-21 20:58:56] [INFO ] Parsed PT model containing 314 places and 271 transitions and 1306 arcs in 233 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-50a-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Applied a total of 0 rules in 56 ms. Remains 314 /314 variables (removed 0) and now considering 257/257 (removed 0) transitions.
// Phase 1: matrix 257 rows 314 cols
[2024-05-21 20:58:56] [INFO ] Computed 59 invariants in 40 ms
[2024-05-21 20:58:57] [INFO ] Implicit Places using invariants in 509 ms returned [211]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 541 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 313/314 places, 257/257 transitions.
Applied a total of 0 rules in 18 ms. Remains 313 /313 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 639 ms. Remains : 313/314 places, 257/257 transitions.
Support contains 29 out of 313 places after structural reductions.
[2024-05-21 20:58:57] [INFO ] Flatten gal took : 56 ms
[2024-05-21 20:58:57] [INFO ] Flatten gal took : 27 ms
[2024-05-21 20:58:57] [INFO ] Input system was already deterministic with 257 transitions.
Reduction of identical properties reduced properties to check from 18 to 17
RANDOM walk for 40000 steps (875 resets) in 1594 ms. (25 steps per ms) remains 11/17 properties
BEST_FIRST walk for 40003 steps (184 resets) in 220 ms. (181 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (179 resets) in 226 ms. (176 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (180 resets) in 115 ms. (344 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (178 resets) in 145 ms. (273 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (167 resets) in 117 ms. (339 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (187 resets) in 218 ms. (182 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (181 resets) in 215 ms. (185 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (186 resets) in 110 ms. (360 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (198 resets) in 137 ms. (289 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (176 resets) in 79 ms. (500 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (196 resets) in 140 ms. (283 steps per ms) remains 11/11 properties
// Phase 1: matrix 257 rows 313 cols
[2024-05-21 20:58:59] [INFO ] Computed 58 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 14/33 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 14/36 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 62/95 variables, 30/66 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 62/128 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 163/258 variables, 23/151 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 163/314 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 6/264 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/264 variables, 6/322 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/264 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 256/520 variables, 264/586 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-21 20:59:00] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 14 ms to minimize.
[2024-05-21 20:59:00] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/520 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/520 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 50/570 variables, 49/637 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/570 variables, 49/686 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-21 20:59:02] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/570 variables, 1/687 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-21 20:59:03] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/570 variables, 1/688 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/570 variables, and 688 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5016 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 14/33 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 14/36 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 62/95 variables, 30/66 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 62/128 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 163/258 variables, 23/151 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 163/314 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 4/318 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 6/264 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/264 variables, 6/326 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/264 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 256/520 variables, 264/590 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/520 variables, 5/595 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/520 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (OVERLAPS) 50/570 variables, 49/644 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/570 variables, 49/693 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/570 variables, and 699 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5013 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 4/4 constraints]
After SMT, in 10075ms problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 19 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 257/257 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 313 transition count 255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 312 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 312 transition count 254
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 312 transition count 254
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 311 transition count 253
Applied a total of 11 rules in 72 ms. Remains 311 /313 variables (removed 2) and now considering 253/257 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 311/313 places, 253/257 transitions.
RANDOM walk for 40000 steps (545 resets) in 588 ms. (67 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (98 resets) in 102 ms. (388 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (102 resets) in 105 ms. (377 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (85 resets) in 171 ms. (232 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (89 resets) in 101 ms. (392 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (74 resets) in 61 ms. (645 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (86 resets) in 58 ms. (678 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (94 resets) in 56 ms. (701 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (86 resets) in 83 ms. (476 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (92 resets) in 82 ms. (481 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (82 resets) in 111 ms. (357 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (85 resets) in 63 ms. (625 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 754673 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :0 out of 11
Probabilistic random walk after 754673 steps, saw 108321 distinct states, run finished after 3004 ms. (steps per millisecond=251 ) properties seen :0
// Phase 1: matrix 253 rows 311 cols
[2024-05-21 20:59:12] [INFO ] Computed 60 invariants in 7 ms
[2024-05-21 20:59:12] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 12/31 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 14/45 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 185/230 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 22/252 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 2/254 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 208/462 variables, 254/309 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 63/525 variables, 18/329 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/525 variables, 4/333 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/525 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 1/526 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/526 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/526 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (OVERLAPS) 38/564 variables, 38/373 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-21 20:59:14] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/564 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/564 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (OVERLAPS) 0/564 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 374 constraints, problems are : Problem set: 0 solved, 11 unsolved in 2618 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 12/31 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 14/45 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 185/230 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 22/252 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 2/254 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 208/462 variables, 254/309 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 5/316 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-21 20:59:16] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/462 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/462 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 63/525 variables, 18/335 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/525 variables, 4/339 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/525 variables, 6/345 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/525 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/525 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (OVERLAPS) 1/526 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/526 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/526 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (OVERLAPS) 38/564 variables, 38/386 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/564 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-21 20:59:19] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-21 20:59:19] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-21 20:59:19] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
At refinement iteration 26 (OVERLAPS) 0/564 variables, 3/389 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/564 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 28 (OVERLAPS) 0/564 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 389 constraints, problems are : Problem set: 0 solved, 11 unsolved in 6146 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 5/5 constraints]
After SMT, in 8784ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 21413 ms.
Support contains 19 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 16 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 13 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2024-05-21 20:59:42] [INFO ] Invariant cache hit.
[2024-05-21 20:59:43] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-21 20:59:43] [INFO ] Invariant cache hit.
[2024-05-21 20:59:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 20:59:43] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
[2024-05-21 20:59:43] [INFO ] Redundant transitions in 16 ms returned []
Running 250 sub problems to find dead transitions.
[2024-05-21 20:59:43] [INFO ] Invariant cache hit.
[2024-05-21 20:59:43] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/310 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (OVERLAPS) 253/563 variables, 310/370 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-21 20:59:49] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-21 20:59:53] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2024-05-21 20:59:53] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-05-21 20:59:53] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-21 20:59:54] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-21 20:59:54] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-21 20:59:54] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-21 20:59:54] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-05-21 20:59:55] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 8/381 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 10 (OVERLAPS) 1/564 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-21 21:00:00] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-21 21:00:03] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-21 21:00:07] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/564 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/564 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 564/564 variables, and 385 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 2/310 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 253/563 variables, 310/381 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 250/633 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-21 21:00:39] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-21 21:00:43] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 563/564 variables, and 635 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 310/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 13/14 constraints]
After SMT, in 60292ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 60297ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60945 ms. Remains : 311/311 places, 253/253 transitions.
Computed a total of 216 stabilizing places and 211 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(X((X(G((p1||G(p2))))&&p0))))'
Support contains 3 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 7 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
// Phase 1: matrix 256 rows 312 cols
[2024-05-21 21:00:44] [INFO ] Computed 58 invariants in 7 ms
[2024-05-21 21:00:44] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-21 21:00:44] [INFO ] Invariant cache hit.
[2024-05-21 21:00:44] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-21 21:00:44] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:00:47] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:00:52] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:00:52] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:00:55] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:00:57] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:00:58] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 376 constraints, problems are : Problem set: 0 solved, 255 unsolved in 21221 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:01:09] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 256/568 variables, 312/377 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 255/632 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:01:34] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-05-21 21:01:35] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 634 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 9/9 constraints]
After SMT, in 51439ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 51443ms
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52011 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 311 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DES-PT-50a-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DES-PT-50a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLCardinality-00 finished in 52501 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 7 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2024-05-21 21:01:36] [INFO ] Invariant cache hit.
[2024-05-21 21:01:36] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-21 21:01:36] [INFO ] Invariant cache hit.
[2024-05-21 21:01:37] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-21 21:01:37] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:01:39] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:01:44] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:01:44] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:01:47] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:01:49] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:01:50] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 376 constraints, problems are : Problem set: 0 solved, 255 unsolved in 20393 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:02:00] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 256/568 variables, 312/377 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 255/632 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:02:26] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 3 ms to minimize.
[2024-05-21 21:02:26] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 634 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 9/9 constraints]
After SMT, in 50596ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 50598ms
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51084 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50a-LTLCardinality-01
Product exploration explored 100000 steps with 20000 reset in 405 ms.
Product exploration explored 100000 steps with 20000 reset in 312 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 113 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (893 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (187 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1675114 steps, run timeout after 3001 ms. (steps per millisecond=558 ) properties seen :0 out of 1
Probabilistic random walk after 1675114 steps, saw 229633 distinct states, run finished after 3001 ms. (steps per millisecond=558 ) properties seen :0
[2024-05-21 21:02:31] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 73/81 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 173/254 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/260 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 255/515 variables, 260/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/515 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 53/568 variables, 52/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/568 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/568 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 370 constraints, problems are : Problem set: 0 solved, 1 unsolved in 258 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 73/81 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 173/254 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/260 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 255/515 variables, 260/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/515 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 53/568 variables, 52/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/568 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/568 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 21:02:32] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/568 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/568 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/568 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 568/568 variables, and 372 constraints, problems are : Problem set: 0 solved, 1 unsolved in 551 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 815ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 416 ms.
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 256/256 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 312 transition count 254
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 312 transition count 254
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 311 transition count 253
Applied a total of 9 rules in 31 ms. Remains 311 /312 variables (removed 1) and now considering 253/256 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 311/312 places, 253/256 transitions.
RANDOM walk for 40000 steps (543 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (100 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1615599 steps, run timeout after 3001 ms. (steps per millisecond=538 ) properties seen :0 out of 1
Probabilistic random walk after 1615599 steps, saw 226560 distinct states, run finished after 3001 ms. (steps per millisecond=538 ) properties seen :0
// Phase 1: matrix 253 rows 311 cols
[2024-05-21 21:02:36] [INFO ] Computed 60 invariants in 9 ms
[2024-05-21 21:02:36] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/21 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 202/223 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/248 variables, 22/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/251 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 202/453 variables, 251/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/453 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 63/516 variables, 12/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/516 variables, 4/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/516 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/517 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/517 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/517 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 47/564 variables, 47/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/564 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/564 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 373 constraints, problems are : Problem set: 0 solved, 1 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/21 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 202/223 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/248 variables, 22/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/251 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 202/453 variables, 251/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/453 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 63/516 variables, 12/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/516 variables, 4/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/516 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 21:02:36] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/516 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/516 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/517 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/517 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/517 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 47/564 variables, 47/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/564 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/564 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 375 constraints, problems are : Problem set: 0 solved, 1 unsolved in 444 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 737ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1294 steps, including 1 resets, run visited all 1 properties in 9 ms. (steps per millisecond=143 )
Parikh walk visited 1 properties in 15 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 82 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 3 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2024-05-21 21:02:37] [INFO ] Computed 58 invariants in 6 ms
[2024-05-21 21:02:37] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-21 21:02:37] [INFO ] Invariant cache hit.
[2024-05-21 21:02:37] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-21 21:02:37] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:02:40] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:02:45] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:02:45] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:02:48] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:02:50] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:02:51] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 376 constraints, problems are : Problem set: 0 solved, 255 unsolved in 21050 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:03:02] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 256/568 variables, 312/377 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 255/632 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:03:27] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2024-05-21 21:03:27] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 634 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 9/9 constraints]
After SMT, in 51274ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 51278ms
Finished structural reductions in LTL mode , in 1 iterations and 51792 ms. Remains : 312/312 places, 256/256 transitions.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 77 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (861 resets) in 187 ms. (212 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (187 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1691818 steps, run timeout after 3001 ms. (steps per millisecond=563 ) properties seen :0 out of 1
Probabilistic random walk after 1691818 steps, saw 231318 distinct states, run finished after 3001 ms. (steps per millisecond=563 ) properties seen :0
[2024-05-21 21:03:32] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 73/81 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 173/254 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/260 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 255/515 variables, 260/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/515 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 53/568 variables, 52/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/568 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/568 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 370 constraints, problems are : Problem set: 0 solved, 1 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 73/81 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 173/254 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/260 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 255/515 variables, 260/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/515 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 53/568 variables, 52/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/568 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/568 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 21:03:33] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/568 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/568 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/568 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 568/568 variables, and 372 constraints, problems are : Problem set: 0 solved, 1 unsolved in 563 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 853ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 433 ms.
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 256/256 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 312 transition count 254
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 312 transition count 254
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 311 transition count 253
Applied a total of 9 rules in 33 ms. Remains 311 /312 variables (removed 1) and now considering 253/256 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 311/312 places, 253/256 transitions.
RANDOM walk for 40000 steps (544 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (96 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1594018 steps, run timeout after 3001 ms. (steps per millisecond=531 ) properties seen :0 out of 1
Probabilistic random walk after 1594018 steps, saw 223166 distinct states, run finished after 3001 ms. (steps per millisecond=531 ) properties seen :0
// Phase 1: matrix 253 rows 311 cols
[2024-05-21 21:03:36] [INFO ] Computed 60 invariants in 6 ms
[2024-05-21 21:03:36] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/21 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 202/223 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/248 variables, 22/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/251 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 202/453 variables, 251/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/453 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 63/516 variables, 12/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/516 variables, 4/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/516 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/517 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/517 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/517 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 47/564 variables, 47/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/564 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/564 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 373 constraints, problems are : Problem set: 0 solved, 1 unsolved in 296 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/21 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 202/223 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/248 variables, 22/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/251 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 202/453 variables, 251/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/453 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 63/516 variables, 12/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/516 variables, 4/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/516 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 21:03:37] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/516 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/516 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/517 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/517 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/517 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 47/564 variables, 47/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/564 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/564 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 375 constraints, problems are : Problem set: 0 solved, 1 unsolved in 449 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 762ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1330 steps, including 1 resets, run visited all 1 properties in 6 ms. (steps per millisecond=221 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 109 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 244 ms.
Product exploration explored 100000 steps with 20000 reset in 256 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 21 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-05-21 21:03:39] [INFO ] Redundant transitions in 13 ms returned []
Running 255 sub problems to find dead transitions.
// Phase 1: matrix 256 rows 312 cols
[2024-05-21 21:03:39] [INFO ] Computed 58 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:03:42] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:03:50] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:03:50] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 5 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:03:53] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:03:58] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/568 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:04:01] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/568 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 14 (OVERLAPS) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 376 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 255/631 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:04:24] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 632 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 7/7 constraints]
After SMT, in 60227ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 60230ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60270 ms. Remains : 312/312 places, 256/256 transitions.
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 10 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-05-21 21:04:39] [INFO ] Invariant cache hit.
[2024-05-21 21:04:39] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-21 21:04:39] [INFO ] Invariant cache hit.
[2024-05-21 21:04:40] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-21 21:04:40] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:04:43] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:04:47] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:04:47] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:04:50] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:04:52] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:04:54] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 376 constraints, problems are : Problem set: 0 solved, 255 unsolved in 20743 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:05:03] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 256/568 variables, 312/377 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 255/632 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:05:29] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-21 21:05:29] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 634 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 9/9 constraints]
After SMT, in 50936ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 50939ms
Finished structural reductions in LTL mode , in 1 iterations and 51464 ms. Remains : 312/312 places, 256/256 transitions.
Treatment of property DES-PT-50a-LTLCardinality-01 finished in 234623 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)&&(F(p1)||G(p2))))'
Support contains 5 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 311 transition count 255
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 311 transition count 255
Applied a total of 2 rules in 19 ms. Remains 311 /313 variables (removed 2) and now considering 255/257 (removed 2) transitions.
// Phase 1: matrix 255 rows 311 cols
[2024-05-21 21:05:31] [INFO ] Computed 58 invariants in 3 ms
[2024-05-21 21:05:31] [INFO ] Implicit Places using invariants in 339 ms returned []
[2024-05-21 21:05:31] [INFO ] Invariant cache hit.
[2024-05-21 21:05:31] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
[2024-05-21 21:05:31] [INFO ] Redundant transitions in 4 ms returned []
Running 252 sub problems to find dead transitions.
[2024-05-21 21:05:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 252 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/310 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 255/565 variables, 310/368 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-21 21:05:37] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-21 21:05:37] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:05:37] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:05:38] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 4/372 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (OVERLAPS) 1/566 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 10 (OVERLAPS) 0/566 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 373 constraints, problems are : Problem set: 0 solved, 252 unsolved in 16881 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 2/310 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 255/565 variables, 310/372 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 252/624 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-21 21:06:11] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/566 variables, and 625 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 310/311 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 5/5 constraints]
After SMT, in 47051ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 47054ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 255/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47748 ms. Remains : 311/313 places, 255/257 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-50a-LTLCardinality-03
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 3 ms.
FORMULA DES-PT-50a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLCardinality-03 finished in 47928 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U X(G(p1)))&&F(p0))))'
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 6 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
// Phase 1: matrix 256 rows 312 cols
[2024-05-21 21:06:19] [INFO ] Computed 58 invariants in 6 ms
[2024-05-21 21:06:19] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-21 21:06:19] [INFO ] Invariant cache hit.
[2024-05-21 21:06:19] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-21 21:06:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:06:22] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:06:27] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:06:27] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:06:30] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:06:32] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:06:33] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 376 constraints, problems are : Problem set: 0 solved, 255 unsolved in 20746 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:06:43] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 256/568 variables, 312/377 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 255/632 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:07:08] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-05-21 21:07:08] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 634 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 9/9 constraints]
After SMT, in 50934ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 50937ms
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51423 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (NOT p1), true]
Running random walk in product with property : DES-PT-50a-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DES-PT-50a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLCardinality-04 finished in 51600 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 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 311 transition count 255
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 311 transition count 255
Applied a total of 2 rules in 15 ms. Remains 311 /313 variables (removed 2) and now considering 255/257 (removed 2) transitions.
// Phase 1: matrix 255 rows 311 cols
[2024-05-21 21:07:10] [INFO ] Computed 58 invariants in 3 ms
[2024-05-21 21:07:10] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-21 21:07:10] [INFO ] Invariant cache hit.
[2024-05-21 21:07:11] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
[2024-05-21 21:07:11] [INFO ] Redundant transitions in 1 ms returned []
Running 252 sub problems to find dead transitions.
[2024-05-21 21:07:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 252 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/310 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 255/565 variables, 310/368 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-21 21:07:17] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:07:17] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-21 21:07:17] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:07:18] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 4/372 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (OVERLAPS) 1/566 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 10 (OVERLAPS) 0/566 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 373 constraints, problems are : Problem set: 0 solved, 252 unsolved in 16590 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 2/310 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 255/565 variables, 310/372 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 252/624 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-21 21:07:50] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/566 variables, and 625 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 310/311 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 5/5 constraints]
After SMT, in 46789ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 46792ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 255/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47289 ms. Remains : 311/313 places, 255/257 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-50a-LTLCardinality-08
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 0 ms.
FORMULA DES-PT-50a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLCardinality-08 finished in 47346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 6 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
// Phase 1: matrix 256 rows 312 cols
[2024-05-21 21:07:58] [INFO ] Computed 58 invariants in 6 ms
[2024-05-21 21:07:58] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-21 21:07:58] [INFO ] Invariant cache hit.
[2024-05-21 21:07:58] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-21 21:07:58] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:08:01] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:08:05] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:08:06] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:08:09] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:08:10] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:08:12] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 376 constraints, problems are : Problem set: 0 solved, 255 unsolved in 20710 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:08:22] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 256/568 variables, 312/377 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 255/632 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:08:47] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2024-05-21 21:08:47] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 634 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 9/9 constraints]
After SMT, in 50914ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 50918ms
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51422 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50a-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA DES-PT-50a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLCardinality-09 finished in 51543 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)))'
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 10 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2024-05-21 21:08:49] [INFO ] Invariant cache hit.
[2024-05-21 21:08:49] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-21 21:08:49] [INFO ] Invariant cache hit.
[2024-05-21 21:08:50] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-21 21:08:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:08:52] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:08:57] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:08:57] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:09:00] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:09:02] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:09:03] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 376 constraints, problems are : Problem set: 0 solved, 255 unsolved in 20845 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:09:13] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 256/568 variables, 312/377 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 255/632 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:09:39] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2024-05-21 21:09:39] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 634 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 9/9 constraints]
After SMT, in 51034ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 51037ms
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51533 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50a-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA DES-PT-50a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLCardinality-10 finished in 51629 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 3 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 8 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2024-05-21 21:09:41] [INFO ] Invariant cache hit.
[2024-05-21 21:09:41] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-21 21:09:41] [INFO ] Invariant cache hit.
[2024-05-21 21:09:41] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-21 21:09:41] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:09:44] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:09:49] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:09:49] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:09:52] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:09:54] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:09:55] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 376 constraints, problems are : Problem set: 0 solved, 255 unsolved in 20808 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:10:05] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 256/568 variables, 312/377 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 255/632 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:10:31] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-21 21:10:31] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 634 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 9/9 constraints]
After SMT, in 50996ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 50999ms
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51488 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DES-PT-50a-LTLCardinality-12
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 0 ms.
FORMULA DES-PT-50a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLCardinality-12 finished in 51618 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 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 9 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2024-05-21 21:10:32] [INFO ] Invariant cache hit.
[2024-05-21 21:10:32] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-21 21:10:32] [INFO ] Invariant cache hit.
[2024-05-21 21:10:33] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-21 21:10:33] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:10:36] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:10:40] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:10:40] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:10:43] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:10:45] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:10:47] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 376 constraints, problems are : Problem set: 0 solved, 255 unsolved in 20658 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:10:57] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 256/568 variables, 312/377 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 255/632 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:11:22] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-21 21:11:22] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 634 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 9/9 constraints]
After SMT, in 50855ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 50859ms
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51356 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50a-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 363 ms.
Product exploration explored 100000 steps with 50000 reset in 386 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 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 16 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-50a-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-50a-LTLCardinality-13 finished in 52234 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((!p1&&X(!p1)))||(!p1&&X(!p1)&&F(!p2))||p0)))'
Support contains 7 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Applied a total of 0 rules in 4 ms. Remains 313 /313 variables (removed 0) and now considering 257/257 (removed 0) transitions.
// Phase 1: matrix 257 rows 313 cols
[2024-05-21 21:11:25] [INFO ] Computed 58 invariants in 4 ms
[2024-05-21 21:11:25] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-05-21 21:11:25] [INFO ] Invariant cache hit.
[2024-05-21 21:11:25] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 775 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-05-21 21:11:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 12/324 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 256 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/313 variables, 33/357 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 13/371 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 257/570 variables, 313/684 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-21 21:11:34] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
[2024-05-21 21:11:34] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
[2024-05-21 21:11:34] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-21 21:11:35] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 4/688 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/570 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 10 (OVERLAPS) 0/570 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 688 constraints, problems are : Problem set: 0 solved, 256 unsolved in 20849 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 12/324 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 1/313 variables, 33/357 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 13/371 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 4/375 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-21 21:11:50] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-21 21:11:50] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (OVERLAPS) 257/570 variables, 313/690 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/570 variables, 256/946 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/570 variables, and 946 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30011 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 6/6 constraints]
After SMT, in 51040ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 51044ms
Finished structural reductions in LTL mode , in 1 iterations and 51825 ms. Remains : 313/313 places, 257/257 transitions.
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), true, p1, (AND p2 p1), p2]
Running random walk in product with property : DES-PT-50a-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 429 ms.
Product exploration explored 100000 steps with 50000 reset in 407 ms.
Computed a total of 216 stabilizing places and 211 stable transitions
Computed a total of 216 stabilizing places and 211 stable transitions
Detected a total of 216/313 stabilizing places and 211/257 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 21 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-50a-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-50a-LTLCardinality-15 finished in 52937 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Found a Shortening insensitive property : DES-PT-50a-LTLCardinality-01
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 311 transition count 255
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 311 transition count 255
Applied a total of 2 rules in 19 ms. Remains 311 /313 variables (removed 2) and now considering 255/257 (removed 2) transitions.
// Phase 1: matrix 255 rows 311 cols
[2024-05-21 21:12:18] [INFO ] Computed 58 invariants in 8 ms
[2024-05-21 21:12:18] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-21 21:12:18] [INFO ] Invariant cache hit.
[2024-05-21 21:12:18] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2024-05-21 21:12:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 252 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/310 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 255/565 variables, 310/368 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-21 21:12:24] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:12:24] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:12:25] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:12:26] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 4/372 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (OVERLAPS) 1/566 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 10 (OVERLAPS) 0/566 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 373 constraints, problems are : Problem set: 0 solved, 252 unsolved in 16488 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 2/310 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 255/565 variables, 310/372 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 252/624 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-21 21:12:57] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/566 variables, and 625 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 310/311 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 5/5 constraints]
After SMT, in 46685ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 46689ms
Starting structural reductions in LI_LTL mode, iteration 1 : 311/313 places, 255/257 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 47204 ms. Remains : 311/313 places, 255/257 transitions.
Running random walk in product with property : DES-PT-50a-LTLCardinality-01
Product exploration explored 100000 steps with 20000 reset in 235 ms.
Product exploration explored 100000 steps with 20000 reset in 213 ms.
Computed a total of 214 stabilizing places and 209 stable transitions
Computed a total of 214 stabilizing places and 209 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 66 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (918 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (182 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1574236 steps, run timeout after 3001 ms. (steps per millisecond=524 ) properties seen :0 out of 1
Probabilistic random walk after 1574236 steps, saw 218109 distinct states, run finished after 3001 ms. (steps per millisecond=524 ) properties seen :0
[2024-05-21 21:13:09] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/21 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 200/221 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 23/244 variables, 21/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/251 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 201/452 variables, 251/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/452 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 66/518 variables, 12/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/518 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/518 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 48/566 variables, 48/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/566 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/566 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 369 constraints, problems are : Problem set: 0 solved, 1 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/21 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 200/221 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 23/244 variables, 21/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 21:13:09] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/251 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 201/452 variables, 251/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/452 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 66/518 variables, 12/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/518 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/518 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/518 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 48/566 variables, 48/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/566 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/566 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 371 constraints, problems are : Problem set: 0 solved, 1 unsolved in 383 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 664ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 434 ms.
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 255/255 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 311 transition count 253
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 311 transition count 253
Applied a total of 4 rules in 14 ms. Remains 311 /311 variables (removed 0) and now considering 253/255 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 311/311 places, 253/255 transitions.
RANDOM walk for 40000 steps (660 resets) in 117 ms. (338 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (123 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1554566 steps, run timeout after 3001 ms. (steps per millisecond=518 ) properties seen :0 out of 1
Probabilistic random walk after 1554566 steps, saw 218472 distinct states, run finished after 3001 ms. (steps per millisecond=518 ) properties seen :0
// Phase 1: matrix 253 rows 311 cols
[2024-05-21 21:13:13] [INFO ] Computed 60 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/21 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 203/224 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/249 variables, 22/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/251 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 200/451 variables, 251/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 65/516 variables, 12/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/516 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/516 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/517 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/517 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/517 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 47/564 variables, 47/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/564 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/564 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 371 constraints, problems are : Problem set: 0 solved, 1 unsolved in 324 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/21 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 203/224 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/249 variables, 22/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 21:13:13] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/251 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 200/451 variables, 251/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 21:13:14] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/451 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/451 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 65/516 variables, 12/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/516 variables, 4/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/516 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/516 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/517 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/517 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/517 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 47/564 variables, 47/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/564 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/564 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 374 constraints, problems are : Problem set: 0 solved, 1 unsolved in 521 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 859ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 473 ms.
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 6 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 6 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2024-05-21 21:13:14] [INFO ] Invariant cache hit.
[2024-05-21 21:13:14] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-21 21:13:14] [INFO ] Invariant cache hit.
[2024-05-21 21:13:15] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
[2024-05-21 21:13:15] [INFO ] Redundant transitions in 1 ms returned []
Running 250 sub problems to find dead transitions.
[2024-05-21 21:13:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/310 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (OVERLAPS) 253/563 variables, 310/370 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-21 21:13:22] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:13:22] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:13:22] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 3/373 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-21 21:13:22] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 2 ms to minimize.
[2024-05-21 21:13:24] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 2/375 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (OVERLAPS) 1/564 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-21 21:13:29] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 2 ms to minimize.
[2024-05-21 21:13:31] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/564 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-21 21:13:33] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-21 21:13:38] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 1 ms to minimize.
[2024-05-21 21:13:38] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 2 ms to minimize.
[2024-05-21 21:13:39] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:13:39] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-21 21:13:39] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:13:39] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/564 variables, 6/385 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/564 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 564/564 variables, and 385 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 2/310 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 253/563 variables, 310/384 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 250/634 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 563/564 variables, and 634 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 310/311 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 14/14 constraints]
After SMT, in 60200ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 60204ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60671 ms. Remains : 311/311 places, 253/253 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 311 transition count 253
Applied a total of 1 rules in 38 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 253 rows 311 cols
[2024-05-21 21:14:15] [INFO ] Computed 60 invariants in 3 ms
[2024-05-21 21:14:15] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 21:14:15] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 21:14:15] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-21 21:14:15] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 21:14:15] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2024-05-21 21:14:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
TRAPS : Iteration 1
[2024-05-21 21:14:15] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:14:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
TRAPS : Iteration 2
[2024-05-21 21:14:15] [INFO ] After 346ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 21:14:15] [INFO ] After 437ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 540 ms.
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 66 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 255/255 transitions.
Applied a total of 0 rules in 5 ms. Remains 311 /311 variables (removed 0) and now considering 255/255 (removed 0) transitions.
// Phase 1: matrix 255 rows 311 cols
[2024-05-21 21:14:16] [INFO ] Computed 58 invariants in 6 ms
[2024-05-21 21:14:16] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-21 21:14:16] [INFO ] Invariant cache hit.
[2024-05-21 21:14:16] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2024-05-21 21:14:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 252 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/310 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 255/565 variables, 310/368 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-21 21:14:22] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-21 21:14:23] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:14:23] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:14:24] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 4/372 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (OVERLAPS) 1/566 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 10 (OVERLAPS) 0/566 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 373 constraints, problems are : Problem set: 0 solved, 252 unsolved in 16364 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 2/310 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 255/565 variables, 310/372 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 252/624 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-21 21:14:55] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/566 variables, and 625 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 310/311 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 5/5 constraints]
After SMT, in 46559ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 46564ms
Finished structural reductions in LTL mode , in 1 iterations and 47047 ms. Remains : 311/311 places, 255/255 transitions.
Computed a total of 214 stabilizing places and 209 stable transitions
Computed a total of 214 stabilizing places and 209 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 57 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (899 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (178 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1553922 steps, run timeout after 3001 ms. (steps per millisecond=517 ) properties seen :0 out of 1
Probabilistic random walk after 1553922 steps, saw 215618 distinct states, run finished after 3002 ms. (steps per millisecond=517 ) properties seen :0
[2024-05-21 21:15:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/21 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 200/221 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 23/244 variables, 21/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/251 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 201/452 variables, 251/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/452 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 66/518 variables, 12/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/518 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/518 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 48/566 variables, 48/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/566 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/566 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 369 constraints, problems are : Problem set: 0 solved, 1 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/21 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 200/221 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 23/244 variables, 21/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 21:15:07] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/251 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 201/452 variables, 251/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/452 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 66/518 variables, 12/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/518 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/518 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/518 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 48/566 variables, 48/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/566 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/566 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 371 constraints, problems are : Problem set: 0 solved, 1 unsolved in 365 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 674ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 436 ms.
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 255/255 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 311 transition count 253
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 311 transition count 253
Applied a total of 4 rules in 12 ms. Remains 311 /311 variables (removed 0) and now considering 253/255 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 311/311 places, 253/255 transitions.
RANDOM walk for 40000 steps (662 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (120 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1554467 steps, run timeout after 3001 ms. (steps per millisecond=517 ) properties seen :0 out of 1
Probabilistic random walk after 1554467 steps, saw 218455 distinct states, run finished after 3002 ms. (steps per millisecond=517 ) properties seen :0
// Phase 1: matrix 253 rows 311 cols
[2024-05-21 21:15:10] [INFO ] Computed 60 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/21 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 203/224 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/249 variables, 22/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/251 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 200/451 variables, 251/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 65/516 variables, 12/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/516 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/516 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/517 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/517 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/517 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 47/564 variables, 47/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/564 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/564 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 371 constraints, problems are : Problem set: 0 solved, 1 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/21 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 203/224 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/249 variables, 22/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 21:15:11] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/251 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 200/451 variables, 251/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 21:15:11] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/451 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/451 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 65/516 variables, 12/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/516 variables, 4/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/516 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/516 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/517 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/517 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/517 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 47/564 variables, 47/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/564 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/564 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 374 constraints, problems are : Problem set: 0 solved, 1 unsolved in 466 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 793ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 468 ms.
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 6 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 5 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2024-05-21 21:15:12] [INFO ] Invariant cache hit.
[2024-05-21 21:15:12] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-21 21:15:12] [INFO ] Invariant cache hit.
[2024-05-21 21:15:12] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2024-05-21 21:15:12] [INFO ] Redundant transitions in 1 ms returned []
Running 250 sub problems to find dead transitions.
[2024-05-21 21:15:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/310 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (OVERLAPS) 253/563 variables, 310/370 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-21 21:15:19] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:15:19] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:15:19] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 3/373 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-21 21:15:20] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-21 21:15:22] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 2/375 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (OVERLAPS) 1/564 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-21 21:15:26] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 1 ms to minimize.
[2024-05-21 21:15:28] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/564 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-21 21:15:30] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-21 21:15:36] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
[2024-05-21 21:15:36] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:15:36] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:15:36] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:15:36] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-21 21:15:36] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/564 variables, 6/385 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/564 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 564/564 variables, and 385 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 2/310 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 253/563 variables, 310/384 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 250/634 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 563/564 variables, and 634 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 310/311 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 14/14 constraints]
After SMT, in 60194ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 60197ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60643 ms. Remains : 311/311 places, 253/253 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 311 transition count 253
Applied a total of 1 rules in 23 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 253 rows 311 cols
[2024-05-21 21:16:12] [INFO ] Computed 60 invariants in 7 ms
[2024-05-21 21:16:12] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 21:16:12] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 21:16:12] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-21 21:16:13] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 21:16:13] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-21 21:16:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
TRAPS : Iteration 1
[2024-05-21 21:16:13] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:16:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
TRAPS : Iteration 2
[2024-05-21 21:16:13] [INFO ] After 367ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 21:16:13] [INFO ] After 465ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 559 ms.
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 86 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 153 ms.
Product exploration explored 100000 steps with 20000 reset in 168 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 255/255 transitions.
Applied a total of 0 rules in 12 ms. Remains 311 /311 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-21 21:16:14] [INFO ] Redundant transitions in 1 ms returned []
Running 252 sub problems to find dead transitions.
// Phase 1: matrix 255 rows 311 cols
[2024-05-21 21:16:14] [INFO ] Computed 58 invariants in 6 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 2/310 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 255/565 variables, 310/368 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-21 21:16:19] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 2 ms to minimize.
[2024-05-21 21:16:21] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:16:21] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:16:21] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:16:21] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 5/373 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-21 21:16:27] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:16:27] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 2/375 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-21 21:16:27] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 10 (OVERLAPS) 1/566 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/566 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 12 (OVERLAPS) 0/566 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 377 constraints, problems are : Problem set: 0 solved, 252 unsolved in 28830 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 2/310 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 255/565 variables, 310/376 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 252/628 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-21 21:16:58] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2024-05-21 21:17:04] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:17:04] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-21 21:17:04] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 4/632 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/566 variables, and 632 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 310/311 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 12/12 constraints]
After SMT, in 59022ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 59026ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 59051 ms. Remains : 311/311 places, 255/255 transitions.
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 255/255 transitions.
Applied a total of 0 rules in 3 ms. Remains 311 /311 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-21 21:17:13] [INFO ] Invariant cache hit.
[2024-05-21 21:17:13] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-21 21:17:13] [INFO ] Invariant cache hit.
[2024-05-21 21:17:14] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2024-05-21 21:17:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 252 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/310 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 255/565 variables, 310/368 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-21 21:17:20] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:17:20] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:17:20] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:17:21] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 4/372 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (OVERLAPS) 1/566 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 10 (OVERLAPS) 0/566 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 373 constraints, problems are : Problem set: 0 solved, 252 unsolved in 16350 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 2/310 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 255/565 variables, 310/372 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 252/624 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-21 21:17:53] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/566 variables, and 625 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 310/311 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 5/5 constraints]
After SMT, in 46523ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 46526ms
Finished structural reductions in LTL mode , in 1 iterations and 46982 ms. Remains : 311/311 places, 255/255 transitions.
Treatment of property DES-PT-50a-LTLCardinality-01 finished in 342737 ms.
[2024-05-21 21:18:00] [INFO ] Flatten gal took : 21 ms
[2024-05-21 21:18:00] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-05-21 21:18:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 313 places, 257 transitions and 1239 arcs took 7 ms.
Total runtime 1144479 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running DES-PT-50a
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/402/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 313
TRANSITIONS: 257
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.008s, Sys 0.000s]
SAVING FILE /home/mcc/execution/402/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 2094
MODEL NAME: /home/mcc/execution/402/model
313 places, 257 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DES-PT-50a-LTLCardinality-01 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716326541994
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-50a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is DES-PT-50a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r091-tall-171624188300731"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-50a.tgz
mv DES-PT-50a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;