About the Execution of GreatSPN+red for GlobalResAllocation-PT-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5428.136 | 1965153.00 | 2568438.00 | 5706.70 | FTFFFTFTFFFFFFFT | 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.r179-tall-171640602100691.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 GlobalResAllocation-PT-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640602100691
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 194M
-rw-r--r-- 1 mcc users 30K Apr 12 14:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 12 14:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6M Apr 12 14:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 24M Apr 12 14:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 16K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5M Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 14M Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 78K Apr 12 22:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 403K Apr 12 22:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19M Apr 12 21:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74M Apr 12 21:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.2K Apr 22 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 55M 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 GlobalResAllocation-PT-05-LTLCardinality-00
FORMULA_NAME GlobalResAllocation-PT-05-LTLCardinality-01
FORMULA_NAME GlobalResAllocation-PT-05-LTLCardinality-02
FORMULA_NAME GlobalResAllocation-PT-05-LTLCardinality-03
FORMULA_NAME GlobalResAllocation-PT-05-LTLCardinality-04
FORMULA_NAME GlobalResAllocation-PT-05-LTLCardinality-05
FORMULA_NAME GlobalResAllocation-PT-05-LTLCardinality-06
FORMULA_NAME GlobalResAllocation-PT-05-LTLCardinality-07
FORMULA_NAME GlobalResAllocation-PT-05-LTLCardinality-08
FORMULA_NAME GlobalResAllocation-PT-05-LTLCardinality-09
FORMULA_NAME GlobalResAllocation-PT-05-LTLCardinality-10
FORMULA_NAME GlobalResAllocation-PT-05-LTLCardinality-11
FORMULA_NAME GlobalResAllocation-PT-05-LTLCardinality-12
FORMULA_NAME GlobalResAllocation-PT-05-LTLCardinality-13
FORMULA_NAME GlobalResAllocation-PT-05-LTLCardinality-14
FORMULA_NAME GlobalResAllocation-PT-05-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716489269217
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GlobalResAllocation-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 18:34:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 18:34:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 18:34:32] [INFO ] Load time of PNML (sax parser for PT used): 1511 ms
[2024-05-23 18:34:32] [INFO ] Transformed 75 places.
[2024-05-23 18:34:32] [INFO ] Transformed 56105 transitions.
[2024-05-23 18:34:32] [INFO ] Parsed PT model containing 75 places and 56105 transitions and 492760 arcs in 1950 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 50775 transitions
Reduce redundant transitions removed 50775 transitions.
FORMULA GlobalResAllocation-PT-05-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-PT-05-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-PT-05-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 68 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 5330/5330 transitions.
Reduce isomorphic (modulo) transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 75 transition count 5280
Applied a total of 100 rules in 175 ms. Remains 75 /75 variables (removed 0) and now considering 5280/5330 (removed 50) transitions.
Running 3355 sub problems to find dead transitions.
// Phase 1: matrix 5280 rows 75 cols
[2024-05-23 18:34:33] [INFO ] Computed 20 invariants in 143 ms
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1484 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1505 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1508 is UNSAT
Problem TDEAD1509 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1520 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1523 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1525 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1528 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1530 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1532 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1538 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1541 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1543 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1546 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1548 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1553 is UNSAT
Problem TDEAD1554 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1556 is UNSAT
Problem TDEAD1557 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1559 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1576 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1585 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1604 is UNSAT
Problem TDEAD1605 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1615 is UNSAT
Problem TDEAD1616 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1646 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1648 is UNSAT
Problem TDEAD1649 is UNSAT
Problem TDEAD1650 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1652 is UNSAT
Problem TDEAD1653 is UNSAT
Problem TDEAD1654 is UNSAT
Problem TDEAD1655 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1658 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1663 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1666 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1669 is UNSAT
Problem TDEAD1670 is UNSAT
Problem TDEAD1671 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1673 is UNSAT
Problem TDEAD1674 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1681 is UNSAT
Problem TDEAD1682 is UNSAT
Problem TDEAD1683 is UNSAT
Problem TDEAD1684 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1690 is UNSAT
Problem TDEAD1692 is UNSAT
Problem TDEAD1693 is UNSAT
Problem TDEAD1694 is UNSAT
Problem TDEAD1695 is UNSAT
Problem TDEAD1696 is UNSAT
Problem TDEAD1697 is UNSAT
Problem TDEAD1698 is UNSAT
Problem TDEAD1699 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1721 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1723 is UNSAT
Problem TDEAD1742 is UNSAT
Problem TDEAD1743 is UNSAT
Problem TDEAD1744 is UNSAT
Problem TDEAD1745 is UNSAT
Problem TDEAD1746 is UNSAT
Problem TDEAD1747 is UNSAT
Problem TDEAD1748 is UNSAT
Problem TDEAD1749 is UNSAT
Problem TDEAD1750 is UNSAT
Problem TDEAD1751 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1753 is UNSAT
Problem TDEAD1754 is UNSAT
Problem TDEAD1755 is UNSAT
Problem TDEAD1756 is UNSAT
Problem TDEAD1757 is UNSAT
Problem TDEAD1758 is UNSAT
Problem TDEAD1759 is UNSAT
Problem TDEAD1760 is UNSAT
Problem TDEAD1761 is UNSAT
Problem TDEAD1762 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1765 is UNSAT
Problem TDEAD1766 is UNSAT
Problem TDEAD1767 is UNSAT
Problem TDEAD1768 is UNSAT
Problem TDEAD1769 is UNSAT
Problem TDEAD1770 is UNSAT
Problem TDEAD1771 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1775 is UNSAT
Problem TDEAD1776 is UNSAT
Problem TDEAD1777 is UNSAT
Problem TDEAD1778 is UNSAT
Problem TDEAD1779 is UNSAT
Problem TDEAD1780 is UNSAT
Problem TDEAD1781 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1783 is UNSAT
Problem TDEAD1784 is UNSAT
Problem TDEAD1785 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD1787 is UNSAT
Problem TDEAD1788 is UNSAT
Problem TDEAD1789 is UNSAT
Problem TDEAD1790 is UNSAT
Problem TDEAD1791 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1795 is UNSAT
Problem TDEAD1796 is UNSAT
Problem TDEAD1797 is UNSAT
Problem TDEAD1798 is UNSAT
Problem TDEAD1799 is UNSAT
Problem TDEAD1800 is UNSAT
Problem TDEAD1801 is UNSAT
Problem TDEAD1802 is UNSAT
Problem TDEAD1803 is UNSAT
Problem TDEAD1804 is UNSAT
Problem TDEAD1805 is UNSAT
Problem TDEAD1806 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1808 is UNSAT
Problem TDEAD1809 is UNSAT
Problem TDEAD1810 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1822 is UNSAT
Problem TDEAD1823 is UNSAT
Problem TDEAD1824 is UNSAT
Problem TDEAD1825 is UNSAT
Problem TDEAD1826 is UNSAT
Problem TDEAD1827 is UNSAT
Problem TDEAD1828 is UNSAT
Problem TDEAD1829 is UNSAT
Problem TDEAD1830 is UNSAT
Problem TDEAD1831 is UNSAT
Problem TDEAD1832 is UNSAT
Problem TDEAD1833 is UNSAT
Problem TDEAD1834 is UNSAT
Problem TDEAD1835 is UNSAT
Problem TDEAD1836 is UNSAT
Problem TDEAD1837 is UNSAT
Problem TDEAD1838 is UNSAT
Problem TDEAD1839 is UNSAT
Problem TDEAD1840 is UNSAT
Problem TDEAD1841 is UNSAT
Problem TDEAD1842 is UNSAT
Problem TDEAD1853 is UNSAT
Problem TDEAD1854 is UNSAT
Problem TDEAD1855 is UNSAT
Problem TDEAD1856 is UNSAT
Problem TDEAD1857 is UNSAT
Problem TDEAD1872 is UNSAT
Problem TDEAD1873 is UNSAT
Problem TDEAD1874 is UNSAT
Problem TDEAD1875 is UNSAT
Problem TDEAD1876 is UNSAT
Problem TDEAD1883 is UNSAT
Problem TDEAD1884 is UNSAT
Problem TDEAD1885 is UNSAT
Problem TDEAD1886 is UNSAT
Problem TDEAD1887 is UNSAT
Problem TDEAD1888 is UNSAT
Problem TDEAD1889 is UNSAT
Problem TDEAD1890 is UNSAT
Problem TDEAD1891 is UNSAT
Problem TDEAD1892 is UNSAT
Problem TDEAD1898 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1900 is UNSAT
Problem TDEAD1901 is UNSAT
Problem TDEAD1902 is UNSAT
Problem TDEAD1904 is UNSAT
Problem TDEAD1909 is UNSAT
Problem TDEAD1910 is UNSAT
Problem TDEAD1911 is UNSAT
Problem TDEAD1912 is UNSAT
Problem TDEAD1913 is UNSAT
Problem TDEAD1914 is UNSAT
Problem TDEAD1915 is UNSAT
Problem TDEAD1916 is UNSAT
Problem TDEAD1922 is UNSAT
Problem TDEAD1923 is UNSAT
Problem TDEAD1929 is UNSAT
Problem TDEAD1930 is UNSAT
Problem TDEAD1931 is UNSAT
Problem TDEAD1932 is UNSAT
Problem TDEAD1933 is UNSAT
Problem TDEAD1935 is UNSAT
Problem TDEAD1938 is UNSAT
Problem TDEAD1939 is UNSAT
Problem TDEAD1940 is UNSAT
Problem TDEAD1941 is UNSAT
Problem TDEAD1942 is UNSAT
Problem TDEAD1943 is UNSAT
Problem TDEAD1944 is UNSAT
Problem TDEAD1945 is UNSAT
Problem TDEAD1946 is UNSAT
Problem TDEAD1947 is UNSAT
Problem TDEAD1948 is UNSAT
Problem TDEAD1949 is UNSAT
Problem TDEAD1950 is UNSAT
Problem TDEAD1951 is UNSAT
Problem TDEAD1952 is UNSAT
Problem TDEAD1953 is UNSAT
Problem TDEAD1954 is UNSAT
Problem TDEAD1955 is UNSAT
Problem TDEAD1956 is UNSAT
Problem TDEAD1957 is UNSAT
Problem TDEAD1958 is UNSAT
Problem TDEAD1959 is UNSAT
Problem TDEAD1960 is UNSAT
Problem TDEAD1961 is UNSAT
Problem TDEAD1962 is UNSAT
Problem TDEAD1963 is UNSAT
Problem TDEAD1964 is UNSAT
Problem TDEAD1965 is UNSAT
Problem TDEAD1966 is UNSAT
Problem TDEAD1967 is UNSAT
Problem TDEAD1978 is UNSAT
Problem TDEAD1979 is UNSAT
Problem TDEAD1980 is UNSAT
Problem TDEAD1981 is UNSAT
Problem TDEAD1982 is UNSAT
Problem TDEAD1983 is UNSAT
Problem TDEAD1984 is UNSAT
Problem TDEAD1985 is UNSAT
Problem TDEAD1986 is UNSAT
Problem TDEAD1987 is UNSAT
Problem TDEAD1988 is UNSAT
Problem TDEAD1989 is UNSAT
Problem TDEAD1990 is UNSAT
Problem TDEAD1991 is UNSAT
Problem TDEAD1992 is UNSAT
Problem TDEAD1993 is UNSAT
Problem TDEAD1994 is UNSAT
Problem TDEAD1995 is UNSAT
Problem TDEAD1996 is UNSAT
Problem TDEAD1997 is UNSAT
Problem TDEAD1998 is UNSAT
Problem TDEAD1999 is UNSAT
Problem TDEAD2000 is UNSAT
Problem TDEAD2001 is UNSAT
Problem TDEAD2002 is UNSAT
Problem TDEAD2003 is UNSAT
Problem TDEAD2004 is UNSAT
Problem TDEAD2008 is UNSAT
Problem TDEAD2019 is UNSAT
Problem TDEAD2020 is UNSAT
Problem TDEAD2023 is UNSAT
Problem TDEAD2024 is UNSAT
Problem TDEAD2025 is UNSAT
Problem TDEAD2036 is UNSAT
Problem TDEAD2037 is UNSAT
Problem TDEAD2038 is UNSAT
Problem TDEAD2039 is UNSAT
Problem TDEAD2040 is UNSAT
Problem TDEAD2057 is UNSAT
Problem TDEAD2058 is UNSAT
Problem TDEAD2059 is UNSAT
Problem TDEAD2060 is UNSAT
Problem TDEAD2061 is UNSAT
Problem TDEAD2077 is UNSAT
Problem TDEAD2078 is UNSAT
Problem TDEAD2079 is UNSAT
Problem TDEAD2080 is UNSAT
Problem TDEAD2081 is UNSAT
Problem TDEAD2082 is UNSAT
Problem TDEAD2083 is UNSAT
Problem TDEAD2084 is UNSAT
Problem TDEAD2085 is UNSAT
Problem TDEAD2086 is UNSAT
Problem TDEAD2090 is UNSAT
Problem TDEAD2091 is UNSAT
Problem TDEAD2092 is UNSAT
Problem TDEAD2093 is UNSAT
Problem TDEAD2094 is UNSAT
Problem TDEAD2106 is UNSAT
Problem TDEAD2107 is UNSAT
Problem TDEAD2108 is UNSAT
Problem TDEAD2109 is UNSAT
Problem TDEAD2110 is UNSAT
Problem TDEAD2126 is UNSAT
Problem TDEAD2127 is UNSAT
Problem TDEAD2128 is UNSAT
Problem TDEAD2129 is UNSAT
Problem TDEAD2130 is UNSAT
Problem TDEAD2131 is UNSAT
Problem TDEAD2132 is UNSAT
Problem TDEAD2133 is UNSAT
Problem TDEAD2134 is UNSAT
Problem TDEAD2135 is UNSAT
Problem TDEAD2136 is UNSAT
Problem TDEAD2137 is UNSAT
Problem TDEAD2138 is UNSAT
Problem TDEAD2139 is UNSAT
Problem TDEAD2157 is UNSAT
Problem TDEAD2184 is UNSAT
Problem TDEAD2185 is UNSAT
Problem TDEAD2186 is UNSAT
Problem TDEAD2187 is UNSAT
Problem TDEAD2188 is UNSAT
Problem TDEAD2189 is UNSAT
Problem TDEAD2190 is UNSAT
Problem TDEAD2193 is UNSAT
Problem TDEAD2197 is UNSAT
Problem TDEAD2198 is UNSAT
Problem TDEAD2199 is UNSAT
Problem TDEAD2200 is UNSAT
Problem TDEAD2204 is UNSAT
Problem TDEAD2209 is UNSAT
Problem TDEAD2210 is UNSAT
Problem TDEAD2221 is UNSAT
Problem TDEAD2222 is UNSAT
Problem TDEAD2223 is UNSAT
Problem TDEAD2224 is UNSAT
Problem TDEAD2225 is UNSAT
Problem TDEAD2226 is UNSAT
Problem TDEAD2227 is UNSAT
Problem TDEAD2228 is UNSAT
Problem TDEAD2229 is UNSAT
Problem TDEAD2230 is UNSAT
Problem TDEAD2231 is UNSAT
Problem TDEAD2232 is UNSAT
Problem TDEAD2233 is UNSAT
Problem TDEAD2234 is UNSAT
Problem TDEAD2235 is UNSAT
Problem TDEAD2236 is UNSAT
Problem TDEAD2237 is UNSAT
Problem TDEAD2238 is UNSAT
Problem TDEAD2239 is UNSAT
Problem TDEAD2240 is UNSAT
Problem TDEAD2246 is UNSAT
Problem TDEAD2248 is UNSAT
Problem TDEAD2249 is UNSAT
Problem TDEAD2250 is UNSAT
Problem TDEAD2251 is UNSAT
Problem TDEAD2261 is UNSAT
Problem TDEAD2262 is UNSAT
Problem TDEAD2263 is UNSAT
Problem TDEAD2264 is UNSAT
Problem TDEAD2265 is UNSAT
Problem TDEAD2266 is UNSAT
Problem TDEAD2267 is UNSAT
Problem TDEAD2268 is UNSAT
Problem TDEAD2269 is UNSAT
Problem TDEAD2270 is UNSAT
Problem TDEAD2271 is UNSAT
Problem TDEAD2272 is UNSAT
Problem TDEAD2279 is UNSAT
Problem TDEAD2280 is UNSAT
Problem TDEAD2281 is UNSAT
Problem TDEAD2289 is UNSAT
Problem TDEAD2294 is UNSAT
Problem TDEAD2298 is UNSAT
Problem TDEAD2299 is UNSAT
Problem TDEAD2300 is UNSAT
Problem TDEAD2301 is UNSAT
Problem TDEAD2307 is UNSAT
Problem TDEAD2308 is UNSAT
Problem TDEAD2309 is UNSAT
Problem TDEAD2310 is UNSAT
Problem TDEAD2311 is UNSAT
Problem TDEAD2312 is UNSAT
Problem TDEAD2313 is UNSAT
Problem TDEAD2314 is UNSAT
Problem TDEAD2315 is UNSAT
Problem TDEAD2316 is UNSAT
Problem TDEAD2317 is UNSAT
Problem TDEAD2318 is UNSAT
Problem TDEAD2319 is UNSAT
Problem TDEAD2320 is UNSAT
Problem TDEAD2321 is UNSAT
Problem TDEAD2322 is UNSAT
Problem TDEAD2323 is UNSAT
Problem TDEAD2324 is UNSAT
Problem TDEAD2325 is UNSAT
Problem TDEAD2326 is UNSAT
Problem TDEAD2327 is UNSAT
Problem TDEAD2328 is UNSAT
Problem TDEAD2329 is UNSAT
Problem TDEAD2330 is UNSAT
Problem TDEAD2331 is UNSAT
Problem TDEAD2332 is UNSAT
Problem TDEAD2333 is UNSAT
Problem TDEAD2334 is UNSAT
Problem TDEAD2335 is UNSAT
Problem TDEAD2336 is UNSAT
Problem TDEAD2337 is UNSAT
Problem TDEAD2338 is UNSAT
Problem TDEAD2339 is UNSAT
Problem TDEAD2340 is UNSAT
Problem TDEAD2341 is UNSAT
Problem TDEAD2342 is UNSAT
Problem TDEAD2343 is UNSAT
Problem TDEAD2344 is UNSAT
Problem TDEAD2345 is UNSAT
Problem TDEAD2346 is UNSAT
Problem TDEAD2347 is UNSAT
Problem TDEAD2348 is UNSAT
Problem TDEAD2349 is UNSAT
Problem TDEAD2350 is UNSAT
Problem TDEAD2351 is UNSAT
Problem TDEAD2352 is UNSAT
Problem TDEAD2353 is UNSAT
Problem TDEAD2354 is UNSAT
Problem TDEAD2355 is UNSAT
Problem TDEAD2356 is UNSAT
Problem TDEAD2357 is UNSAT
Problem TDEAD2358 is UNSAT
Problem TDEAD2359 is UNSAT
Problem TDEAD2360 is UNSAT
Problem TDEAD2361 is UNSAT
Problem TDEAD2363 is UNSAT
Problem TDEAD2364 is UNSAT
Problem TDEAD2365 is UNSAT
Problem TDEAD2374 is UNSAT
Problem TDEAD2375 is UNSAT
Problem TDEAD2376 is UNSAT
Problem TDEAD2381 is UNSAT
Problem TDEAD2382 is UNSAT
Problem TDEAD2396 is UNSAT
Problem TDEAD2403 is UNSAT
Problem TDEAD2404 is UNSAT
Problem TDEAD2405 is UNSAT
Problem TDEAD2406 is UNSAT
Problem TDEAD2407 is UNSAT
Problem TDEAD2408 is UNSAT
Problem TDEAD2409 is UNSAT
Problem TDEAD2410 is UNSAT
Problem TDEAD2411 is UNSAT
Problem TDEAD2420 is UNSAT
Problem TDEAD2421 is UNSAT
Problem TDEAD2422 is UNSAT
Problem TDEAD2423 is UNSAT
Problem TDEAD2438 is UNSAT
Problem TDEAD2440 is UNSAT
Problem TDEAD2441 is UNSAT
Problem TDEAD2442 is UNSAT
Problem TDEAD2443 is UNSAT
Problem TDEAD2447 is UNSAT
Problem TDEAD2448 is UNSAT
Problem TDEAD2449 is UNSAT
Problem TDEAD2450 is UNSAT
Problem TDEAD2453 is UNSAT
Problem TDEAD2454 is UNSAT
Problem TDEAD2485 is UNSAT
Problem TDEAD2486 is UNSAT
Problem TDEAD2487 is UNSAT
Problem TDEAD2488 is UNSAT
Problem TDEAD2489 is UNSAT
Problem TDEAD2490 is UNSAT
Problem TDEAD2491 is UNSAT
Problem TDEAD2492 is UNSAT
Problem TDEAD2493 is UNSAT
Problem TDEAD2494 is UNSAT
Problem TDEAD2495 is UNSAT
Problem TDEAD2496 is UNSAT
Problem TDEAD2497 is UNSAT
Problem TDEAD2498 is UNSAT
Problem TDEAD2499 is UNSAT
Problem TDEAD2510 is UNSAT
Problem TDEAD2511 is UNSAT
Problem TDEAD2512 is UNSAT
Problem TDEAD2513 is UNSAT
Problem TDEAD2514 is UNSAT
Problem TDEAD2515 is UNSAT
Problem TDEAD2516 is UNSAT
Problem TDEAD2517 is UNSAT
Problem TDEAD2518 is UNSAT
Problem TDEAD2519 is UNSAT
Problem TDEAD2520 is UNSAT
Problem TDEAD2521 is UNSAT
Problem TDEAD2522 is UNSAT
Problem TDEAD2523 is UNSAT
Problem TDEAD2524 is UNSAT
Problem TDEAD2525 is UNSAT
Problem TDEAD2526 is UNSAT
Problem TDEAD2527 is UNSAT
Problem TDEAD2528 is UNSAT
Problem TDEAD2529 is UNSAT
Problem TDEAD2565 is UNSAT
Problem TDEAD2571 is UNSAT
Problem TDEAD2572 is UNSAT
Problem TDEAD2573 is UNSAT
Problem TDEAD2574 is UNSAT
Problem TDEAD2585 is UNSAT
Problem TDEAD2586 is UNSAT
Problem TDEAD2587 is UNSAT
Problem TDEAD2588 is UNSAT
Problem TDEAD2589 is UNSAT
Problem TDEAD2643 is UNSAT
Problem TDEAD2644 is UNSAT
Problem TDEAD2645 is UNSAT
Problem TDEAD2646 is UNSAT
Problem TDEAD2650 is UNSAT
Problem TDEAD2660 is UNSAT
Problem TDEAD2661 is UNSAT
Problem TDEAD2662 is UNSAT
Problem TDEAD2663 is UNSAT
Problem TDEAD2664 is UNSAT
Problem TDEAD2665 is UNSAT
Problem TDEAD2666 is UNSAT
Problem TDEAD2667 is UNSAT
Problem TDEAD2668 is UNSAT
Problem TDEAD2669 is UNSAT
Problem TDEAD2670 is UNSAT
Problem TDEAD2671 is UNSAT
Problem TDEAD2676 is UNSAT
Problem TDEAD2678 is UNSAT
Problem TDEAD2679 is UNSAT
Problem TDEAD2680 is UNSAT
Problem TDEAD2681 is UNSAT
Problem TDEAD2695 is UNSAT
Problem TDEAD2696 is UNSAT
Problem TDEAD2698 is UNSAT
Problem TDEAD2699 is UNSAT
Problem TDEAD2700 is UNSAT
Problem TDEAD2717 is UNSAT
Problem TDEAD2718 is UNSAT
Problem TDEAD2719 is UNSAT
Problem TDEAD2720 is UNSAT
Problem TDEAD2721 is UNSAT
Problem TDEAD2726 is UNSAT
Problem TDEAD2727 is UNSAT
Problem TDEAD2728 is UNSAT
Problem TDEAD2730 is UNSAT
Problem TDEAD2731 is UNSAT
Problem TDEAD2742 is UNSAT
Problem TDEAD2744 is UNSAT
Problem TDEAD2745 is UNSAT
Problem TDEAD2746 is UNSAT
Problem TDEAD2747 is UNSAT
Problem TDEAD2761 is UNSAT
Problem TDEAD2762 is UNSAT
Problem TDEAD2763 is UNSAT
Problem TDEAD2764 is UNSAT
Problem TDEAD2765 is UNSAT
Problem TDEAD2766 is UNSAT
Problem TDEAD2767 is UNSAT
Problem TDEAD2768 is UNSAT
Problem TDEAD2769 is UNSAT
Problem TDEAD2770 is UNSAT
Problem TDEAD2771 is UNSAT
Problem TDEAD2772 is UNSAT
Problem TDEAD2773 is UNSAT
Problem TDEAD2774 is UNSAT
Problem TDEAD2775 is UNSAT
Problem TDEAD2777 is UNSAT
Problem TDEAD2778 is UNSAT
Problem TDEAD2779 is UNSAT
Problem TDEAD2780 is UNSAT
Problem TDEAD2781 is UNSAT
Problem TDEAD2782 is UNSAT
Problem TDEAD2783 is UNSAT
Problem TDEAD2788 is UNSAT
Problem TDEAD2789 is UNSAT
Problem TDEAD2790 is UNSAT
Problem TDEAD2795 is UNSAT
Problem TDEAD2796 is UNSAT
Problem TDEAD2797 is UNSAT
Problem TDEAD2798 is UNSAT
Problem TDEAD2799 is UNSAT
Problem TDEAD2824 is UNSAT
Problem TDEAD2825 is UNSAT
Problem TDEAD2842 is UNSAT
Problem TDEAD2843 is UNSAT
Problem TDEAD2844 is UNSAT
Problem TDEAD2855 is UNSAT
Problem TDEAD2858 is UNSAT
Problem TDEAD2861 is UNSAT
Problem TDEAD2862 is UNSAT
Problem TDEAD2863 is UNSAT
Problem TDEAD2864 is UNSAT
Problem TDEAD2865 is UNSAT
Problem TDEAD2866 is UNSAT
Problem TDEAD2867 is UNSAT
Problem TDEAD2868 is UNSAT
Problem TDEAD2881 is UNSAT
Problem TDEAD2882 is UNSAT
Problem TDEAD2886 is UNSAT
Problem TDEAD2887 is UNSAT
Problem TDEAD2888 is UNSAT
Problem TDEAD2892 is UNSAT
Problem TDEAD2894 is UNSAT
Problem TDEAD2895 is UNSAT
Problem TDEAD2900 is UNSAT
Problem TDEAD2901 is UNSAT
Problem TDEAD2908 is UNSAT
Problem TDEAD2909 is UNSAT
Problem TDEAD2910 is UNSAT
Problem TDEAD2915 is UNSAT
Problem TDEAD2916 is UNSAT
Problem TDEAD2917 is UNSAT
Problem TDEAD2918 is UNSAT
Problem TDEAD2919 is UNSAT
Problem TDEAD2920 is UNSAT
Problem TDEAD2921 is UNSAT
Problem TDEAD2922 is UNSAT
Problem TDEAD2923 is UNSAT
Problem TDEAD2924 is UNSAT
Problem TDEAD2925 is UNSAT
Problem TDEAD2926 is UNSAT
Problem TDEAD2927 is UNSAT
Problem TDEAD2928 is UNSAT
Problem TDEAD2929 is UNSAT
Problem TDEAD2930 is UNSAT
Problem TDEAD2931 is UNSAT
Problem TDEAD2932 is UNSAT
Problem TDEAD2933 is UNSAT
Problem TDEAD2934 is UNSAT
Problem TDEAD2935 is UNSAT
Problem TDEAD2936 is UNSAT
Problem TDEAD2937 is UNSAT
Problem TDEAD2942 is UNSAT
Problem TDEAD2943 is UNSAT
Problem TDEAD2964 is UNSAT
Problem TDEAD2965 is UNSAT
Problem TDEAD2966 is UNSAT
Problem TDEAD2967 is UNSAT
Problem TDEAD2968 is UNSAT
Problem TDEAD2974 is UNSAT
Problem TDEAD2975 is UNSAT
Problem TDEAD2976 is UNSAT
Problem TDEAD2977 is UNSAT
Problem TDEAD2978 is UNSAT
Problem TDEAD2983 is UNSAT
Problem TDEAD2984 is UNSAT
Problem TDEAD2985 is UNSAT
Problem TDEAD2986 is UNSAT
Problem TDEAD2989 is UNSAT
Problem TDEAD3009 is UNSAT
Problem TDEAD3010 is UNSAT
Problem TDEAD3011 is UNSAT
Problem TDEAD3012 is UNSAT
Problem TDEAD3014 is UNSAT
Problem TDEAD3031 is UNSAT
Problem TDEAD3034 is UNSAT
Problem TDEAD3035 is UNSAT
Problem TDEAD3047 is UNSAT
Problem TDEAD3048 is UNSAT
Problem TDEAD3049 is UNSAT
Problem TDEAD3072 is UNSAT
Problem TDEAD3073 is UNSAT
Problem TDEAD3074 is UNSAT
Problem TDEAD3075 is UNSAT
Problem TDEAD3085 is UNSAT
Problem TDEAD3086 is UNSAT
Problem TDEAD3087 is UNSAT
Problem TDEAD3088 is UNSAT
Problem TDEAD3089 is UNSAT
Problem TDEAD3090 is UNSAT
Problem TDEAD3091 is UNSAT
Problem TDEAD3092 is UNSAT
Problem TDEAD3093 is UNSAT
Problem TDEAD3094 is UNSAT
Problem TDEAD3104 is UNSAT
Problem TDEAD3105 is UNSAT
Problem TDEAD3106 is UNSAT
Problem TDEAD3108 is UNSAT
Problem TDEAD3109 is UNSAT
Problem TDEAD3115 is UNSAT
Problem TDEAD3116 is UNSAT
Problem TDEAD3117 is UNSAT
Problem TDEAD3118 is UNSAT
Problem TDEAD3119 is UNSAT
Problem TDEAD3120 is UNSAT
Problem TDEAD3121 is UNSAT
Problem TDEAD3122 is UNSAT
Problem TDEAD3123 is UNSAT
Problem TDEAD3124 is UNSAT
Problem TDEAD3125 is UNSAT
Problem TDEAD3126 is UNSAT
Problem TDEAD3127 is UNSAT
Problem TDEAD3132 is UNSAT
Problem TDEAD3133 is UNSAT
Problem TDEAD3135 is UNSAT
Problem TDEAD3136 is UNSAT
Problem TDEAD3137 is UNSAT
Problem TDEAD3138 is UNSAT
Problem TDEAD3139 is UNSAT
Problem TDEAD3140 is UNSAT
Problem TDEAD3141 is UNSAT
Problem TDEAD3142 is UNSAT
Problem TDEAD3143 is UNSAT
Problem TDEAD3144 is UNSAT
Problem TDEAD3145 is UNSAT
Problem TDEAD3146 is UNSAT
Problem TDEAD3147 is UNSAT
Problem TDEAD3150 is UNSAT
Problem TDEAD3151 is UNSAT
Problem TDEAD3152 is UNSAT
Problem TDEAD3153 is UNSAT
Problem TDEAD3154 is UNSAT
Problem TDEAD3155 is UNSAT
Problem TDEAD3156 is UNSAT
Problem TDEAD3157 is UNSAT
Problem TDEAD3159 is UNSAT
Problem TDEAD3160 is UNSAT
Problem TDEAD3169 is UNSAT
Problem TDEAD3170 is UNSAT
Problem TDEAD3172 is UNSAT
Problem TDEAD3173 is UNSAT
Problem TDEAD3174 is UNSAT
Problem TDEAD3179 is UNSAT
Problem TDEAD3181 is UNSAT
Problem TDEAD3182 is UNSAT
Problem TDEAD3183 is UNSAT
Problem TDEAD3184 is UNSAT
Problem TDEAD3207 is UNSAT
Problem TDEAD3208 is UNSAT
Problem TDEAD3209 is UNSAT
Problem TDEAD3210 is UNSAT
Problem TDEAD3211 is UNSAT
Problem TDEAD3225 is UNSAT
Problem TDEAD3226 is UNSAT
Problem TDEAD3230 is UNSAT
Problem TDEAD3231 is UNSAT
Problem TDEAD3232 is UNSAT
Problem TDEAD3233 is UNSAT
Problem TDEAD3234 is UNSAT
Problem TDEAD3235 is UNSAT
Problem TDEAD3236 is UNSAT
Problem TDEAD3237 is UNSAT
Problem TDEAD3238 is UNSAT
Problem TDEAD3239 is UNSAT
Problem TDEAD3240 is UNSAT
Problem TDEAD3241 is UNSAT
Problem TDEAD3242 is UNSAT
Problem TDEAD3243 is UNSAT
Problem TDEAD3244 is UNSAT
Problem TDEAD3267 is UNSAT
Problem TDEAD3268 is UNSAT
Problem TDEAD3269 is UNSAT
Problem TDEAD3270 is UNSAT
Problem TDEAD3273 is UNSAT
Problem TDEAD3294 is UNSAT
Problem TDEAD3295 is UNSAT
Problem TDEAD3301 is UNSAT
Problem TDEAD3302 is UNSAT
Problem TDEAD3303 is UNSAT
Problem TDEAD3321 is UNSAT
Problem TDEAD3322 is UNSAT
Problem TDEAD3323 is UNSAT
Problem TDEAD3324 is UNSAT
Problem TDEAD3325 is UNSAT
Problem TDEAD3330 is UNSAT
Problem TDEAD3331 is UNSAT
Problem TDEAD3332 is UNSAT
Problem TDEAD3333 is UNSAT
Problem TDEAD3334 is UNSAT
Problem TDEAD3355 is UNSAT
Problem TDEAD3356 is UNSAT
Problem TDEAD3357 is UNSAT
Problem TDEAD3358 is UNSAT
Problem TDEAD3359 is UNSAT
Problem TDEAD3360 is UNSAT
Problem TDEAD3361 is UNSAT
Problem TDEAD3362 is UNSAT
Problem TDEAD3363 is UNSAT
Problem TDEAD3364 is UNSAT
Problem TDEAD3365 is UNSAT
Problem TDEAD3366 is UNSAT
Problem TDEAD3367 is UNSAT
Problem TDEAD3368 is UNSAT
Problem TDEAD3369 is UNSAT
Problem TDEAD3380 is UNSAT
Problem TDEAD3381 is UNSAT
Problem TDEAD3382 is UNSAT
Problem TDEAD3383 is UNSAT
Problem TDEAD3386 is UNSAT
Problem TDEAD3390 is UNSAT
Problem TDEAD3391 is UNSAT
Problem TDEAD3392 is UNSAT
Problem TDEAD3393 is UNSAT
Problem TDEAD3394 is UNSAT
Problem TDEAD3395 is UNSAT
Problem TDEAD3396 is UNSAT
Problem TDEAD3397 is UNSAT
Problem TDEAD3398 is UNSAT
Problem TDEAD3399 is UNSAT
Problem TDEAD3400 is UNSAT
Problem TDEAD3401 is UNSAT
Problem TDEAD3402 is UNSAT
Problem TDEAD3403 is UNSAT
Problem TDEAD3404 is UNSAT
Problem TDEAD3405 is UNSAT
Problem TDEAD3406 is UNSAT
Problem TDEAD3407 is UNSAT
Problem TDEAD3408 is UNSAT
Problem TDEAD3409 is UNSAT
Problem TDEAD3417 is UNSAT
Problem TDEAD3418 is UNSAT
Problem TDEAD3419 is UNSAT
Problem TDEAD3420 is UNSAT
Problem TDEAD3421 is UNSAT
Problem TDEAD3422 is UNSAT
Problem TDEAD3423 is UNSAT
Problem TDEAD3429 is UNSAT
Problem TDEAD3430 is UNSAT
Problem TDEAD3431 is UNSAT
Problem TDEAD3452 is UNSAT
Problem TDEAD3453 is UNSAT
Problem TDEAD3454 is UNSAT
Problem TDEAD3455 is UNSAT
Problem TDEAD3456 is UNSAT
Problem TDEAD3494 is UNSAT
Problem TDEAD3495 is UNSAT
Problem TDEAD3496 is UNSAT
Problem TDEAD3497 is UNSAT
Problem TDEAD3498 is UNSAT
Problem TDEAD3501 is UNSAT
Problem TDEAD3502 is UNSAT
Problem TDEAD3503 is UNSAT
Problem TDEAD3504 is UNSAT
Problem TDEAD3505 is UNSAT
Problem TDEAD3532 is UNSAT
Problem TDEAD3533 is UNSAT
Problem TDEAD3534 is UNSAT
Problem TDEAD3535 is UNSAT
Problem TDEAD3536 is UNSAT
Problem TDEAD3539 is UNSAT
Problem TDEAD3541 is UNSAT
Problem TDEAD3542 is UNSAT
Problem TDEAD3543 is UNSAT
Problem TDEAD3544 is UNSAT
Problem TDEAD3569 is UNSAT
Problem TDEAD3576 is UNSAT
Problem TDEAD3577 is UNSAT
Problem TDEAD3578 is UNSAT
Problem TDEAD3579 is UNSAT
Problem TDEAD3580 is UNSAT
Problem TDEAD3581 is UNSAT
Problem TDEAD3582 is UNSAT
Problem TDEAD3583 is UNSAT
Problem TDEAD3584 is UNSAT
Problem TDEAD3585 is UNSAT
Problem TDEAD3586 is UNSAT
Problem TDEAD3587 is UNSAT
Problem TDEAD3588 is UNSAT
Problem TDEAD3589 is UNSAT
Problem TDEAD3590 is UNSAT
Problem TDEAD3591 is UNSAT
Problem TDEAD3592 is UNSAT
Problem TDEAD3593 is UNSAT
Problem TDEAD3594 is UNSAT
Problem TDEAD3595 is UNSAT
Problem TDEAD3596 is UNSAT
Problem TDEAD3597 is UNSAT
Problem TDEAD3598 is UNSAT
Problem TDEAD3599 is UNSAT
Problem TDEAD3600 is UNSAT
Problem TDEAD3601 is UNSAT
Problem TDEAD3602 is UNSAT
Problem TDEAD3603 is UNSAT
Problem TDEAD3604 is UNSAT
Problem TDEAD3605 is UNSAT
Problem TDEAD3606 is UNSAT
Problem TDEAD3607 is UNSAT
Problem TDEAD3608 is UNSAT
Problem TDEAD3609 is UNSAT
Problem TDEAD3610 is UNSAT
Problem TDEAD3611 is UNSAT
Problem TDEAD3612 is UNSAT
Problem TDEAD3613 is UNSAT
Problem TDEAD3635 is UNSAT
Problem TDEAD3637 is UNSAT
Problem TDEAD3638 is UNSAT
Problem TDEAD3639 is UNSAT
Problem TDEAD3640 is UNSAT
Problem TDEAD3649 is UNSAT
Problem TDEAD3650 is UNSAT
Problem TDEAD3651 is UNSAT
Problem TDEAD3652 is UNSAT
Problem TDEAD3653 is UNSAT
Problem TDEAD3654 is UNSAT
Problem TDEAD3655 is UNSAT
Problem TDEAD3656 is UNSAT
Problem TDEAD3657 is UNSAT
Problem TDEAD3658 is UNSAT
Problem TDEAD3659 is UNSAT
Problem TDEAD3660 is UNSAT
Problem TDEAD3661 is UNSAT
Problem TDEAD3662 is UNSAT
Problem TDEAD3663 is UNSAT
Problem TDEAD3664 is UNSAT
Problem TDEAD3665 is UNSAT
Problem TDEAD3666 is UNSAT
Problem TDEAD3667 is UNSAT
Problem TDEAD3668 is UNSAT
Problem TDEAD3669 is UNSAT
Problem TDEAD3670 is UNSAT
Problem TDEAD3671 is UNSAT
Problem TDEAD3672 is UNSAT
Problem TDEAD3673 is UNSAT
Problem TDEAD3674 is UNSAT
Problem TDEAD3675 is UNSAT
Problem TDEAD3676 is UNSAT
Problem TDEAD3677 is UNSAT
Problem TDEAD3678 is UNSAT
Problem TDEAD3679 is UNSAT
Problem TDEAD3680 is UNSAT
Problem TDEAD3681 is UNSAT
Problem TDEAD3682 is UNSAT
Problem TDEAD3683 is UNSAT
Problem TDEAD3684 is UNSAT
Problem TDEAD3685 is UNSAT
Problem TDEAD3686 is UNSAT
Problem TDEAD3687 is UNSAT
Problem TDEAD3688 is UNSAT
Problem TDEAD3689 is UNSAT
Problem TDEAD3690 is UNSAT
Problem TDEAD3691 is UNSAT
Problem TDEAD3692 is UNSAT
Problem TDEAD3693 is UNSAT
Problem TDEAD3694 is UNSAT
Problem TDEAD3695 is UNSAT
Problem TDEAD3696 is UNSAT
Problem TDEAD3697 is UNSAT
Problem TDEAD3698 is UNSAT
Problem TDEAD3699 is UNSAT
Problem TDEAD3700 is UNSAT
Problem TDEAD3701 is UNSAT
Problem TDEAD3702 is UNSAT
Problem TDEAD3703 is UNSAT
Problem TDEAD3704 is UNSAT
Problem TDEAD3705 is UNSAT
Problem TDEAD3706 is UNSAT
Problem TDEAD3707 is UNSAT
Problem TDEAD3708 is UNSAT
Problem TDEAD3709 is UNSAT
Problem TDEAD3710 is UNSAT
Problem TDEAD3711 is UNSAT
Problem TDEAD3712 is UNSAT
Problem TDEAD3713 is UNSAT
Problem TDEAD3714 is UNSAT
Problem TDEAD3715 is UNSAT
Problem TDEAD3716 is UNSAT
Problem TDEAD3717 is UNSAT
Problem TDEAD3718 is UNSAT
Problem TDEAD3719 is UNSAT
Problem TDEAD3720 is UNSAT
Problem TDEAD3721 is UNSAT
Problem TDEAD3722 is UNSAT
Problem TDEAD3723 is UNSAT
Problem TDEAD3724 is UNSAT
Problem TDEAD3725 is UNSAT
Problem TDEAD3726 is UNSAT
Problem TDEAD3727 is UNSAT
Problem TDEAD3728 is UNSAT
Problem TDEAD3729 is UNSAT
Problem TDEAD3730 is UNSAT
Problem TDEAD3731 is UNSAT
Problem TDEAD3732 is UNSAT
Problem TDEAD3733 is UNSAT
Problem TDEAD3734 is UNSAT
Problem TDEAD3735 is UNSAT
Problem TDEAD3736 is UNSAT
Problem TDEAD3737 is UNSAT
Problem TDEAD3738 is UNSAT
Problem TDEAD3739 is UNSAT
Problem TDEAD3740 is UNSAT
Problem TDEAD3741 is UNSAT
Problem TDEAD3742 is UNSAT
Problem TDEAD3743 is UNSAT
Problem TDEAD3744 is UNSAT
Problem TDEAD3745 is UNSAT
Problem TDEAD3746 is UNSAT
Problem TDEAD3747 is UNSAT
Problem TDEAD3748 is UNSAT
Problem TDEAD3749 is UNSAT
Problem TDEAD3750 is UNSAT
Problem TDEAD3751 is UNSAT
Problem TDEAD3752 is UNSAT
Problem TDEAD3753 is UNSAT
Problem TDEAD3754 is UNSAT
Problem TDEAD3755 is UNSAT
Problem TDEAD3756 is UNSAT
Problem TDEAD3757 is UNSAT
Problem TDEAD3758 is UNSAT
Problem TDEAD3759 is UNSAT
Problem TDEAD3760 is UNSAT
Problem TDEAD3761 is UNSAT
Problem TDEAD3762 is UNSAT
Problem TDEAD3763 is UNSAT
Problem TDEAD3764 is UNSAT
Problem TDEAD3765 is UNSAT
Problem TDEAD3766 is UNSAT
Problem TDEAD3767 is UNSAT
Problem TDEAD3768 is UNSAT
Problem TDEAD3769 is UNSAT
Problem TDEAD3770 is UNSAT
Problem TDEAD3771 is UNSAT
Problem TDEAD3772 is UNSAT
Problem TDEAD3773 is UNSAT
Problem TDEAD3774 is UNSAT
Problem TDEAD3775 is UNSAT
Problem TDEAD3776 is UNSAT
Problem TDEAD3777 is UNSAT
Problem TDEAD3778 is UNSAT
Problem TDEAD3779 is UNSAT
Problem TDEAD3780 is UNSAT
Problem TDEAD3781 is UNSAT
Problem TDEAD3782 is UNSAT
Problem TDEAD3783 is UNSAT
Problem TDEAD3784 is UNSAT
Problem TDEAD3785 is UNSAT
Problem TDEAD3786 is UNSAT
Problem TDEAD3787 is UNSAT
Problem TDEAD3788 is UNSAT
Problem TDEAD3789 is UNSAT
Problem TDEAD3790 is UNSAT
Problem TDEAD3791 is UNSAT
Problem TDEAD3792 is UNSAT
Problem TDEAD3793 is UNSAT
Problem TDEAD3794 is UNSAT
Problem TDEAD3795 is UNSAT
Problem TDEAD3796 is UNSAT
Problem TDEAD3797 is UNSAT
Problem TDEAD3798 is UNSAT
Problem TDEAD3799 is UNSAT
Problem TDEAD3800 is UNSAT
Problem TDEAD3801 is UNSAT
Problem TDEAD3802 is UNSAT
Problem TDEAD3803 is UNSAT
Problem TDEAD3804 is UNSAT
Problem TDEAD3805 is UNSAT
Problem TDEAD3806 is UNSAT
Problem TDEAD3807 is UNSAT
Problem TDEAD3808 is UNSAT
Problem TDEAD3809 is UNSAT
Problem TDEAD3810 is UNSAT
Problem TDEAD3811 is UNSAT
Problem TDEAD3812 is UNSAT
Problem TDEAD3813 is UNSAT
Problem TDEAD3814 is UNSAT
Problem TDEAD3815 is UNSAT
Problem TDEAD3816 is UNSAT
Problem TDEAD3817 is UNSAT
Problem TDEAD3818 is UNSAT
Problem TDEAD3819 is UNSAT
Problem TDEAD3820 is UNSAT
Problem TDEAD3821 is UNSAT
Problem TDEAD3822 is UNSAT
Problem TDEAD3823 is UNSAT
Problem TDEAD3824 is UNSAT
Problem TDEAD3825 is UNSAT
Problem TDEAD3826 is UNSAT
Problem TDEAD3827 is UNSAT
Problem TDEAD3828 is UNSAT
Problem TDEAD3829 is UNSAT
Problem TDEAD3830 is UNSAT
Problem TDEAD3831 is UNSAT
Problem TDEAD3832 is UNSAT
Problem TDEAD3833 is UNSAT
Problem TDEAD3834 is UNSAT
Problem TDEAD3835 is UNSAT
Problem TDEAD3836 is UNSAT
Problem TDEAD3837 is UNSAT
Problem TDEAD3838 is UNSAT
Problem TDEAD3839 is UNSAT
Problem TDEAD3840 is UNSAT
Problem TDEAD3841 is UNSAT
Problem TDEAD3842 is UNSAT
Problem TDEAD3843 is UNSAT
Problem TDEAD3844 is UNSAT
Problem TDEAD3845 is UNSAT
Problem TDEAD3846 is UNSAT
Problem TDEAD3847 is UNSAT
Problem TDEAD3848 is UNSAT
Problem TDEAD3849 is UNSAT
Problem TDEAD3850 is UNSAT
Problem TDEAD3851 is UNSAT
Problem TDEAD3852 is UNSAT
Problem TDEAD3853 is UNSAT
Problem TDEAD3854 is UNSAT
Problem TDEAD3855 is UNSAT
Problem TDEAD3856 is UNSAT
Problem TDEAD3857 is UNSAT
Problem TDEAD3858 is UNSAT
Problem TDEAD3859 is UNSAT
Problem TDEAD3860 is UNSAT
Problem TDEAD3861 is UNSAT
Problem TDEAD3862 is UNSAT
Problem TDEAD3863 is UNSAT
Problem TDEAD3864 is UNSAT
Problem TDEAD3865 is UNSAT
Problem TDEAD3866 is UNSAT
Problem TDEAD3867 is UNSAT
Problem TDEAD3868 is UNSAT
Problem TDEAD3869 is UNSAT
Problem TDEAD3870 is UNSAT
Problem TDEAD3871 is UNSAT
Problem TDEAD3872 is UNSAT
Problem TDEAD3873 is UNSAT
Problem TDEAD3874 is UNSAT
Problem TDEAD3875 is UNSAT
Problem TDEAD3876 is UNSAT
Problem TDEAD3877 is UNSAT
Problem TDEAD3878 is UNSAT
Problem TDEAD3879 is UNSAT
Problem TDEAD3880 is UNSAT
Problem TDEAD3881 is UNSAT
Problem TDEAD3882 is UNSAT
Problem TDEAD3883 is UNSAT
Problem TDEAD3884 is UNSAT
Problem TDEAD3885 is UNSAT
Problem TDEAD3886 is UNSAT
Problem TDEAD3887 is UNSAT
Problem TDEAD3888 is UNSAT
Problem TDEAD3889 is UNSAT
Problem TDEAD3890 is UNSAT
Problem TDEAD3891 is UNSAT
Problem TDEAD3892 is UNSAT
Problem TDEAD3893 is UNSAT
Problem TDEAD3894 is UNSAT
Problem TDEAD3895 is UNSAT
Problem TDEAD3896 is UNSAT
Problem TDEAD3897 is UNSAT
Problem TDEAD3898 is UNSAT
Problem TDEAD3899 is UNSAT
Problem TDEAD3900 is UNSAT
Problem TDEAD3901 is UNSAT
Problem TDEAD3902 is UNSAT
Problem TDEAD3903 is UNSAT
Problem TDEAD3904 is UNSAT
Problem TDEAD3914 is UNSAT
Problem TDEAD3915 is UNSAT
Problem TDEAD3917 is UNSAT
Problem TDEAD3918 is UNSAT
Problem TDEAD3919 is UNSAT
Problem TDEAD3936 is UNSAT
Problem TDEAD3943 is UNSAT
Problem TDEAD3944 is UNSAT
Problem TDEAD3945 is UNSAT
Problem TDEAD3946 is UNSAT
Problem TDEAD3959 is UNSAT
Problem TDEAD3960 is UNSAT
Problem TDEAD3961 is UNSAT
Problem TDEAD3976 is UNSAT
Problem TDEAD3977 is UNSAT
Problem TDEAD4038 is UNSAT
Problem TDEAD4039 is UNSAT
Problem TDEAD4040 is UNSAT
Problem TDEAD4041 is UNSAT
Problem TDEAD4043 is UNSAT
Problem TDEAD4340 is UNSAT
Problem TDEAD4341 is UNSAT
Problem TDEAD4342 is UNSAT
Problem TDEAD4343 is UNSAT
Problem TDEAD4344 is UNSAT
Problem TDEAD4345 is UNSAT
Problem TDEAD4346 is UNSAT
Problem TDEAD4347 is UNSAT
Problem TDEAD4348 is UNSAT
Problem TDEAD4349 is UNSAT
Problem TDEAD4359 is UNSAT
Problem TDEAD4360 is UNSAT
Problem TDEAD4361 is UNSAT
Problem TDEAD4362 is UNSAT
Problem TDEAD4363 is UNSAT
Problem TDEAD4364 is UNSAT
Problem TDEAD4365 is UNSAT
Problem TDEAD4366 is UNSAT
Problem TDEAD4367 is UNSAT
Problem TDEAD4369 is UNSAT
Problem TDEAD4370 is UNSAT
Problem TDEAD4371 is UNSAT
Problem TDEAD4372 is UNSAT
Problem TDEAD4373 is UNSAT
Problem TDEAD4374 is UNSAT
Problem TDEAD4375 is UNSAT
Problem TDEAD4378 is UNSAT
Problem TDEAD4382 is UNSAT
Problem TDEAD4383 is UNSAT
Problem TDEAD4384 is UNSAT
Problem TDEAD4385 is UNSAT
Problem TDEAD4413 is UNSAT
Problem TDEAD4414 is UNSAT
Problem TDEAD4415 is UNSAT
Problem TDEAD4417 is UNSAT
Problem TDEAD4418 is UNSAT
Problem TDEAD4432 is UNSAT
Problem TDEAD4433 is UNSAT
Problem TDEAD4434 is UNSAT
Problem TDEAD4435 is UNSAT
Problem TDEAD4436 is UNSAT
Problem TDEAD4437 is UNSAT
Problem TDEAD4438 is UNSAT
Problem TDEAD4439 is UNSAT
Problem TDEAD4440 is UNSAT
Problem TDEAD4441 is UNSAT
Problem TDEAD4442 is UNSAT
Problem TDEAD4443 is UNSAT
Problem TDEAD4444 is UNSAT
Problem TDEAD4445 is UNSAT
Problem TDEAD4446 is UNSAT
Problem TDEAD4447 is UNSAT
Problem TDEAD4448 is UNSAT
Problem TDEAD4473 is UNSAT
Problem TDEAD4474 is UNSAT
Problem TDEAD4475 is UNSAT
Problem TDEAD4476 is UNSAT
Problem TDEAD4477 is UNSAT
Problem TDEAD4521 is UNSAT
Problem TDEAD4522 is UNSAT
Problem TDEAD4523 is UNSAT
Problem TDEAD4524 is UNSAT
Problem TDEAD4525 is UNSAT
Problem TDEAD4546 is UNSAT
Problem TDEAD4551 is UNSAT
Problem TDEAD4552 is UNSAT
Problem TDEAD4553 is UNSAT
Problem TDEAD4554 is UNSAT
Problem TDEAD4652 is UNSAT
Problem TDEAD4653 is UNSAT
Problem TDEAD4654 is UNSAT
Problem TDEAD4655 is UNSAT
Problem TDEAD4656 is UNSAT
Problem TDEAD4657 is UNSAT
Problem TDEAD4658 is UNSAT
Problem TDEAD4659 is UNSAT
Problem TDEAD4660 is UNSAT
Problem TDEAD4661 is UNSAT
Problem TDEAD4662 is UNSAT
Problem TDEAD4663 is UNSAT
Problem TDEAD4664 is UNSAT
Problem TDEAD4665 is UNSAT
Problem TDEAD4666 is UNSAT
Problem TDEAD4667 is UNSAT
Problem TDEAD4668 is UNSAT
Problem TDEAD4669 is UNSAT
Problem TDEAD4670 is UNSAT
Problem TDEAD4671 is UNSAT
Problem TDEAD4672 is UNSAT
Problem TDEAD4673 is UNSAT
Problem TDEAD4690 is UNSAT
Problem TDEAD4691 is UNSAT
Problem TDEAD4692 is UNSAT
Problem TDEAD4693 is UNSAT
Problem TDEAD4694 is UNSAT
Problem TDEAD4695 is UNSAT
Problem TDEAD4696 is UNSAT
Problem TDEAD4697 is UNSAT
Problem TDEAD4698 is UNSAT
Problem TDEAD4699 is UNSAT
Problem TDEAD4701 is UNSAT
Problem TDEAD4743 is UNSAT
Problem TDEAD4744 is UNSAT
Problem TDEAD4745 is UNSAT
Problem TDEAD4746 is UNSAT
Problem TDEAD4747 is UNSAT
Problem TDEAD4802 is UNSAT
Problem TDEAD4803 is UNSAT
Problem TDEAD4804 is UNSAT
Problem TDEAD4805 is UNSAT
Problem TDEAD4806 is UNSAT
Problem TDEAD4817 is UNSAT
Problem TDEAD4818 is UNSAT
Problem TDEAD4819 is UNSAT
Problem TDEAD4820 is UNSAT
Problem TDEAD4829 is UNSAT
Problem TDEAD4867 is UNSAT
Problem TDEAD4868 is UNSAT
Problem TDEAD4869 is UNSAT
Problem TDEAD4870 is UNSAT
Problem TDEAD4871 is UNSAT
Problem TDEAD4895 is UNSAT
Problem TDEAD4896 is UNSAT
Problem TDEAD4897 is UNSAT
Problem TDEAD4898 is UNSAT
Problem TDEAD4900 is UNSAT
Problem TDEAD4901 is UNSAT
Problem TDEAD4902 is UNSAT
Problem TDEAD4907 is UNSAT
Problem TDEAD4908 is UNSAT
Problem TDEAD4909 is UNSAT
Problem TDEAD4923 is UNSAT
Problem TDEAD4924 is UNSAT
Problem TDEAD4925 is UNSAT
Problem TDEAD4926 is UNSAT
Problem TDEAD4927 is UNSAT
Problem TDEAD4928 is UNSAT
Problem TDEAD4929 is UNSAT
Problem TDEAD4930 is UNSAT
Problem TDEAD4931 is UNSAT
Problem TDEAD4932 is UNSAT
Problem TDEAD4933 is UNSAT
Problem TDEAD4934 is UNSAT
Problem TDEAD4935 is UNSAT
Problem TDEAD4936 is UNSAT
Problem TDEAD4937 is UNSAT
Problem TDEAD4938 is UNSAT
Problem TDEAD4939 is UNSAT
Problem TDEAD4940 is UNSAT
Problem TDEAD4941 is UNSAT
Problem TDEAD4942 is UNSAT
Problem TDEAD4943 is UNSAT
Problem TDEAD4944 is UNSAT
Problem TDEAD4945 is UNSAT
Problem TDEAD4946 is UNSAT
Problem TDEAD4947 is UNSAT
Problem TDEAD4948 is UNSAT
Problem TDEAD4949 is UNSAT
Problem TDEAD4950 is UNSAT
Problem TDEAD4958 is UNSAT
Problem TDEAD4960 is UNSAT
Problem TDEAD4961 is UNSAT
Problem TDEAD4962 is UNSAT
Problem TDEAD4963 is UNSAT
Problem TDEAD4978 is UNSAT
Problem TDEAD4979 is UNSAT
Problem TDEAD4980 is UNSAT
Problem TDEAD4985 is UNSAT
Problem TDEAD4986 is UNSAT
Problem TDEAD4991 is UNSAT
Problem TDEAD4992 is UNSAT
Problem TDEAD5000 is UNSAT
Problem TDEAD5001 is UNSAT
Problem TDEAD5003 is UNSAT
Problem TDEAD5036 is UNSAT
Problem TDEAD5037 is UNSAT
Problem TDEAD5038 is UNSAT
Problem TDEAD5039 is UNSAT
Problem TDEAD5040 is UNSAT
Problem TDEAD5067 is UNSAT
Problem TDEAD5068 is UNSAT
Problem TDEAD5069 is UNSAT
Problem TDEAD5070 is UNSAT
Problem TDEAD5074 is UNSAT
Problem TDEAD5087 is UNSAT
Problem TDEAD5100 is UNSAT
Problem TDEAD5101 is UNSAT
Problem TDEAD5102 is UNSAT
Problem TDEAD5103 is UNSAT
Problem TDEAD5122 is UNSAT
Problem TDEAD5124 is UNSAT
Problem TDEAD5125 is UNSAT
Problem TDEAD5126 is UNSAT
Problem TDEAD5127 is UNSAT
Problem TDEAD5138 is UNSAT
Problem TDEAD5139 is UNSAT
Problem TDEAD5140 is UNSAT
Problem TDEAD5141 is UNSAT
Problem TDEAD5146 is UNSAT
Problem TDEAD5147 is UNSAT
Problem TDEAD5148 is UNSAT
Problem TDEAD5149 is UNSAT
Problem TDEAD5153 is UNSAT
Problem TDEAD5182 is UNSAT
Problem TDEAD5183 is UNSAT
Problem TDEAD5184 is UNSAT
Problem TDEAD5185 is UNSAT
Problem TDEAD5186 is UNSAT
Problem TDEAD5187 is UNSAT
Problem TDEAD5188 is UNSAT
Problem TDEAD5190 is UNSAT
Problem TDEAD5191 is UNSAT
Problem TDEAD5192 is UNSAT
Problem TDEAD5193 is UNSAT
Problem TDEAD5194 is UNSAT
Problem TDEAD5195 is UNSAT
Problem TDEAD5196 is UNSAT
Problem TDEAD5197 is UNSAT
Problem TDEAD5198 is UNSAT
Problem TDEAD5199 is UNSAT
Problem TDEAD5200 is UNSAT
Problem TDEAD5211 is UNSAT
Problem TDEAD5245 is UNSAT
Problem TDEAD5246 is UNSAT
Problem TDEAD5247 is UNSAT
Problem TDEAD5268 is UNSAT
Problem TDEAD5269 is UNSAT
Problem TDEAD5271 is UNSAT
Problem TDEAD5274 is UNSAT
Problem TDEAD5275 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 12/12 constraints. Problems are: Problem set: 2205 solved, 1150 unsolved
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1409 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1417 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1420 is UNSAT
Problem TDEAD1421 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1423 is UNSAT
Problem TDEAD1424 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1426 is UNSAT
Problem TDEAD1427 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1454 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1493 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1675 is UNSAT
Problem TDEAD1676 is UNSAT
Problem TDEAD1677 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1679 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1701 is UNSAT
Problem TDEAD1702 is UNSAT
Problem TDEAD1703 is UNSAT
Problem TDEAD1704 is UNSAT
Problem TDEAD1705 is UNSAT
Problem TDEAD1706 is UNSAT
Problem TDEAD1707 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1709 is UNSAT
Problem TDEAD1710 is UNSAT
Problem TDEAD1711 is UNSAT
Problem TDEAD1712 is UNSAT
Problem TDEAD1714 is UNSAT
Problem TDEAD1715 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1724 is UNSAT
Problem TDEAD1726 is UNSAT
Problem TDEAD1727 is UNSAT
Problem TDEAD1734 is UNSAT
Problem TDEAD1738 is UNSAT
Problem TDEAD1739 is UNSAT
Problem TDEAD1740 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1813 is UNSAT
Problem TDEAD1814 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1820 is UNSAT
Problem TDEAD1847 is UNSAT
Problem TDEAD1848 is UNSAT
Problem TDEAD1849 is UNSAT
Problem TDEAD1851 is UNSAT
Problem TDEAD1852 is UNSAT
Problem TDEAD1893 is UNSAT
Problem TDEAD1894 is UNSAT
Problem TDEAD1895 is UNSAT
Problem TDEAD1896 is UNSAT
Problem TDEAD1897 is UNSAT
Problem TDEAD2030 is UNSAT
Problem TDEAD2032 is UNSAT
Problem TDEAD2033 is UNSAT
Problem TDEAD2034 is UNSAT
Problem TDEAD2035 is UNSAT
Problem TDEAD2046 is UNSAT
Problem TDEAD2047 is UNSAT
Problem TDEAD2048 is UNSAT
Problem TDEAD2049 is UNSAT
Problem TDEAD2050 is UNSAT
Problem TDEAD2051 is UNSAT
Problem TDEAD2052 is UNSAT
Problem TDEAD2053 is UNSAT
Problem TDEAD2054 is UNSAT
Problem TDEAD2055 is UNSAT
Problem TDEAD2062 is UNSAT
Problem TDEAD2063 is UNSAT
Problem TDEAD2064 is UNSAT
Problem TDEAD2065 is UNSAT
Problem TDEAD2066 is UNSAT
Problem TDEAD2067 is UNSAT
Problem TDEAD2068 is UNSAT
Problem TDEAD2069 is UNSAT
Problem TDEAD2070 is UNSAT
Problem TDEAD2071 is UNSAT
Problem TDEAD2095 is UNSAT
Problem TDEAD2096 is UNSAT
Problem TDEAD2097 is UNSAT
Problem TDEAD2098 is UNSAT
Problem TDEAD2099 is UNSAT
Problem TDEAD2111 is UNSAT
Problem TDEAD2112 is UNSAT
Problem TDEAD2113 is UNSAT
Problem TDEAD2114 is UNSAT
Problem TDEAD2115 is UNSAT
Problem TDEAD2148 is UNSAT
Problem TDEAD2149 is UNSAT
Problem TDEAD2160 is UNSAT
Problem TDEAD2161 is UNSAT
Problem TDEAD2162 is UNSAT
Problem TDEAD2163 is UNSAT
Problem TDEAD2164 is UNSAT
Problem TDEAD2170 is UNSAT
Problem TDEAD2171 is UNSAT
Problem TDEAD2172 is UNSAT
Problem TDEAD2196 is UNSAT
Problem TDEAD2213 is UNSAT
Problem TDEAD2214 is UNSAT
Problem TDEAD2215 is UNSAT
Problem TDEAD2216 is UNSAT
Problem TDEAD2241 is UNSAT
Problem TDEAD2242 is UNSAT
Problem TDEAD2243 is UNSAT
Problem TDEAD2244 is UNSAT
Problem TDEAD2245 is UNSAT
Problem TDEAD2273 is UNSAT
Problem TDEAD2274 is UNSAT
Problem TDEAD2275 is UNSAT
Problem TDEAD2276 is UNSAT
Problem TDEAD2277 is UNSAT
Problem TDEAD2385 is UNSAT
Problem TDEAD2386 is UNSAT
Problem TDEAD2391 is UNSAT
Problem TDEAD2392 is UNSAT
Problem TDEAD2394 is UNSAT
Problem TDEAD2475 is UNSAT
Problem TDEAD2476 is UNSAT
Problem TDEAD2477 is UNSAT
Problem TDEAD2478 is UNSAT
Problem TDEAD2479 is UNSAT
Problem TDEAD2480 is UNSAT
Problem TDEAD2481 is UNSAT
Problem TDEAD2482 is UNSAT
Problem TDEAD2483 is UNSAT
Problem TDEAD2484 is UNSAT
Problem TDEAD2500 is UNSAT
Problem TDEAD2501 is UNSAT
Problem TDEAD2506 is UNSAT
Problem TDEAD2507 is UNSAT
Problem TDEAD2508 is UNSAT
Problem TDEAD2530 is UNSAT
Problem TDEAD2531 is UNSAT
Problem TDEAD2533 is UNSAT
Problem TDEAD2534 is UNSAT
Problem TDEAD2535 is UNSAT
Problem TDEAD2540 is UNSAT
Problem TDEAD2541 is UNSAT
Problem TDEAD2542 is UNSAT
Problem TDEAD2543 is UNSAT
Problem TDEAD2544 is UNSAT
Problem TDEAD2545 is UNSAT
Problem TDEAD2546 is UNSAT
Problem TDEAD2547 is UNSAT
Problem TDEAD2548 is UNSAT
Problem TDEAD2549 is UNSAT
Problem TDEAD2550 is UNSAT
Problem TDEAD2551 is UNSAT
Problem TDEAD2552 is UNSAT
Problem TDEAD2553 is UNSAT
Problem TDEAD2554 is UNSAT
Problem TDEAD2563 is UNSAT
Problem TDEAD2564 is UNSAT
Problem TDEAD2566 is UNSAT
Problem TDEAD2569 is UNSAT
Problem TDEAD2570 is UNSAT
Problem TDEAD2575 is UNSAT
Problem TDEAD2576 is UNSAT
Problem TDEAD2577 is UNSAT
Problem TDEAD2578 is UNSAT
Problem TDEAD2579 is UNSAT
Problem TDEAD2580 is UNSAT
Problem TDEAD2581 is UNSAT
Problem TDEAD2582 is UNSAT
Problem TDEAD2583 is UNSAT
Problem TDEAD2584 is UNSAT
Problem TDEAD2590 is UNSAT
Problem TDEAD2591 is UNSAT
Problem TDEAD2592 is UNSAT
Problem TDEAD2593 is UNSAT
Problem TDEAD2594 is UNSAT
Problem TDEAD2604 is UNSAT
Problem TDEAD2605 is UNSAT
Problem TDEAD2606 is UNSAT
Problem TDEAD2607 is UNSAT
Problem TDEAD2608 is UNSAT
Problem TDEAD2610 is UNSAT
Problem TDEAD2611 is UNSAT
Problem TDEAD2612 is UNSAT
Problem TDEAD2617 is UNSAT
Problem TDEAD2618 is UNSAT
Problem TDEAD2619 is UNSAT
Problem TDEAD2620 is UNSAT
Problem TDEAD2621 is UNSAT
Problem TDEAD2622 is UNSAT
Problem TDEAD2623 is UNSAT
Problem TDEAD2624 is UNSAT
Problem TDEAD2625 is UNSAT
Problem TDEAD2626 is UNSAT
Problem TDEAD2632 is UNSAT
Problem TDEAD2633 is UNSAT
Problem TDEAD2634 is UNSAT
Problem TDEAD2651 is UNSAT
Problem TDEAD2652 is UNSAT
Problem TDEAD2653 is UNSAT
Problem TDEAD2654 is UNSAT
Problem TDEAD2655 is UNSAT
Problem TDEAD2656 is UNSAT
Problem TDEAD2657 is UNSAT
Problem TDEAD2658 is UNSAT
Problem TDEAD2659 is UNSAT
Problem TDEAD2682 is UNSAT
Problem TDEAD2683 is UNSAT
Problem TDEAD2684 is UNSAT
Problem TDEAD2685 is UNSAT
Problem TDEAD2686 is UNSAT
Problem TDEAD2704 is UNSAT
Problem TDEAD2705 is UNSAT
Problem TDEAD2706 is UNSAT
Problem TDEAD2710 is UNSAT
Problem TDEAD2711 is UNSAT
Problem TDEAD2756 is UNSAT
Problem TDEAD2757 is UNSAT
Problem TDEAD2758 is UNSAT
Problem TDEAD2759 is UNSAT
Problem TDEAD2760 is UNSAT
Problem TDEAD2808 is UNSAT
Problem TDEAD2810 is UNSAT
Problem TDEAD2811 is UNSAT
Problem TDEAD2816 is UNSAT
Problem TDEAD2817 is UNSAT
Problem TDEAD2826 is UNSAT
Problem TDEAD2827 is UNSAT
Problem TDEAD2828 is UNSAT
Problem TDEAD2829 is UNSAT
Problem TDEAD2856 is UNSAT
Problem TDEAD2902 is UNSAT
Problem TDEAD2903 is UNSAT
Problem TDEAD2904 is UNSAT
Problem TDEAD2905 is UNSAT
Problem TDEAD2906 is UNSAT
Problem TDEAD3002 is UNSAT
Problem TDEAD3003 is UNSAT
Problem TDEAD3004 is UNSAT
Problem TDEAD3005 is UNSAT
Problem TDEAD3006 is UNSAT
Problem TDEAD3065 is UNSAT
Problem TDEAD3068 is UNSAT
Problem TDEAD3069 is UNSAT
Problem TDEAD3070 is UNSAT
Problem TDEAD3071 is UNSAT
Problem TDEAD3095 is UNSAT
Problem TDEAD3096 is UNSAT
Problem TDEAD3097 is UNSAT
Problem TDEAD3098 is UNSAT
Problem TDEAD3099 is UNSAT
Problem TDEAD3100 is UNSAT
Problem TDEAD3101 is UNSAT
Problem TDEAD3102 is UNSAT
Problem TDEAD3103 is UNSAT
Problem TDEAD3107 is UNSAT
Problem TDEAD3110 is UNSAT
Problem TDEAD3111 is UNSAT
Problem TDEAD3112 is UNSAT
Problem TDEAD3113 is UNSAT
Problem TDEAD3114 is UNSAT
Problem TDEAD3175 is UNSAT
Problem TDEAD3176 is UNSAT
Problem TDEAD3189 is UNSAT
Problem TDEAD3191 is UNSAT
Problem TDEAD3192 is UNSAT
Problem TDEAD3193 is UNSAT
Problem TDEAD3194 is UNSAT
Problem TDEAD3195 is UNSAT
Problem TDEAD3196 is UNSAT
Problem TDEAD3197 is UNSAT
Problem TDEAD3201 is UNSAT
Problem TDEAD3202 is UNSAT
Problem TDEAD3203 is UNSAT
Problem TDEAD3204 is UNSAT
Problem TDEAD3206 is UNSAT
Problem TDEAD3245 is UNSAT
Problem TDEAD3246 is UNSAT
Problem TDEAD3247 is UNSAT
Problem TDEAD3248 is UNSAT
Problem TDEAD3249 is UNSAT
Problem TDEAD3275 is UNSAT
Problem TDEAD3276 is UNSAT
Problem TDEAD3277 is UNSAT
Problem TDEAD3278 is UNSAT
Problem TDEAD3279 is UNSAT
Problem TDEAD3280 is UNSAT
Problem TDEAD3281 is UNSAT
Problem TDEAD3282 is UNSAT
Problem TDEAD3283 is UNSAT
Problem TDEAD3284 is UNSAT
Problem TDEAD3285 is UNSAT
Problem TDEAD3286 is UNSAT
Problem TDEAD3287 is UNSAT
Problem TDEAD3288 is UNSAT
Problem TDEAD3289 is UNSAT
Problem TDEAD3290 is UNSAT
Problem TDEAD3291 is UNSAT
Problem TDEAD3292 is UNSAT
Problem TDEAD3293 is UNSAT
Problem TDEAD3315 is UNSAT
Problem TDEAD3316 is UNSAT
Problem TDEAD3317 is UNSAT
Problem TDEAD3318 is UNSAT
Problem TDEAD3319 is UNSAT
Problem TDEAD3320 is UNSAT
Problem TDEAD3375 is UNSAT
Problem TDEAD3376 is UNSAT
Problem TDEAD3377 is UNSAT
Problem TDEAD3378 is UNSAT
Problem TDEAD3379 is UNSAT
Problem TDEAD3441 is UNSAT
Problem TDEAD3443 is UNSAT
Problem TDEAD3444 is UNSAT
Problem TDEAD3445 is UNSAT
Problem TDEAD3446 is UNSAT
Problem TDEAD3633 is UNSAT
Problem TDEAD3634 is UNSAT
Problem TDEAD3636 is UNSAT
Problem TDEAD3647 is UNSAT
Problem TDEAD3648 is UNSAT
Problem TDEAD3905 is UNSAT
Problem TDEAD3906 is UNSAT
Problem TDEAD3907 is UNSAT
Problem TDEAD3908 is UNSAT
Problem TDEAD3909 is UNSAT
Problem TDEAD3920 is UNSAT
Problem TDEAD3921 is UNSAT
Problem TDEAD3922 is UNSAT
Problem TDEAD3923 is UNSAT
Problem TDEAD3924 is UNSAT
Problem TDEAD4350 is UNSAT
Problem TDEAD4351 is UNSAT
Problem TDEAD4352 is UNSAT
Problem TDEAD4353 is UNSAT
Problem TDEAD4354 is UNSAT
Problem TDEAD4395 is UNSAT
Problem TDEAD4396 is UNSAT
Problem TDEAD4397 is UNSAT
Problem TDEAD4398 is UNSAT
Problem TDEAD4399 is UNSAT
Problem TDEAD4449 is UNSAT
Problem TDEAD4450 is UNSAT
Problem TDEAD4451 is UNSAT
Problem TDEAD4452 is UNSAT
Problem TDEAD4453 is UNSAT
Problem TDEAD4601 is UNSAT
Problem TDEAD4602 is UNSAT
Problem TDEAD4603 is UNSAT
Problem TDEAD4640 is UNSAT
Problem TDEAD4641 is UNSAT
Problem TDEAD4706 is UNSAT
Problem TDEAD4707 is UNSAT
Problem TDEAD4708 is UNSAT
Problem TDEAD4709 is UNSAT
Problem TDEAD4710 is UNSAT
Problem TDEAD4711 is UNSAT
Problem TDEAD4712 is UNSAT
Problem TDEAD4713 is UNSAT
Problem TDEAD4714 is UNSAT
Problem TDEAD4715 is UNSAT
Problem TDEAD4716 is UNSAT
Problem TDEAD4717 is UNSAT
Problem TDEAD4718 is UNSAT
Problem TDEAD4719 is UNSAT
Problem TDEAD4720 is UNSAT
Problem TDEAD4721 is UNSAT
Problem TDEAD4722 is UNSAT
Problem TDEAD4723 is UNSAT
Problem TDEAD4724 is UNSAT
Problem TDEAD4725 is UNSAT
Problem TDEAD4739 is UNSAT
Problem TDEAD4740 is UNSAT
Problem TDEAD4741 is UNSAT
Problem TDEAD4742 is UNSAT
Problem TDEAD4748 is UNSAT
Problem TDEAD4749 is UNSAT
Problem TDEAD4750 is UNSAT
Problem TDEAD4751 is UNSAT
Problem TDEAD4752 is UNSAT
Problem TDEAD4760 is UNSAT
Problem TDEAD4761 is UNSAT
Problem TDEAD4762 is UNSAT
Problem TDEAD4764 is UNSAT
Problem TDEAD4765 is UNSAT
Problem TDEAD4766 is UNSAT
Problem TDEAD4767 is UNSAT
Problem TDEAD4777 is UNSAT
Problem TDEAD4778 is UNSAT
Problem TDEAD4779 is UNSAT
Problem TDEAD4783 is UNSAT
Problem TDEAD4809 is UNSAT
Problem TDEAD4810 is UNSAT
Problem TDEAD4811 is UNSAT
Problem TDEAD4812 is UNSAT
Problem TDEAD4813 is UNSAT
Problem TDEAD4832 is UNSAT
Problem TDEAD4833 is UNSAT
Problem TDEAD4834 is UNSAT
Problem TDEAD4837 is UNSAT
Problem TDEAD4838 is UNSAT
Problem TDEAD4872 is UNSAT
Problem TDEAD4873 is UNSAT
Problem TDEAD4874 is UNSAT
Problem TDEAD4875 is UNSAT
Problem TDEAD4876 is UNSAT
Problem TDEAD4918 is UNSAT
Problem TDEAD4919 is UNSAT
Problem TDEAD4920 is UNSAT
Problem TDEAD4921 is UNSAT
Problem TDEAD4922 is UNSAT
Problem TDEAD5017 is UNSAT
Problem TDEAD5018 is UNSAT
Problem TDEAD5019 is UNSAT
Problem TDEAD5046 is UNSAT
Problem TDEAD5047 is UNSAT
Problem TDEAD5252 is UNSAT
Problem TDEAD5253 is UNSAT
Problem TDEAD5257 is UNSAT
Problem TDEAD5258 is UNSAT
Problem TDEAD5259 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 8/20 constraints. Problems are: Problem set: 3075 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/20 constraints. Problems are: Problem set: 3075 solved, 280 unsolved
At refinement iteration 3 (OVERLAPS) 5280/5355 variables, 75/95 constraints. Problems are: Problem set: 3075 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5355/5355 variables, and 95 constraints, problems are : Problem set: 3075 solved, 280 unsolved in 20064 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3075 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 3075 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 3075 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 12/72 variables, 12/17 constraints. Problems are: Problem set: 3075 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/17 constraints. Problems are: Problem set: 3075 solved, 280 unsolved
At refinement iteration 4 (OVERLAPS) 3/75 variables, 3/20 constraints. Problems are: Problem set: 3075 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/20 constraints. Problems are: Problem set: 3075 solved, 280 unsolved
At refinement iteration 6 (OVERLAPS) 5280/5355 variables, 75/95 constraints. Problems are: Problem set: 3075 solved, 280 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5355 variables, 5/100 constraints. Problems are: Problem set: 3075 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5355/5355 variables, and 100 constraints, problems are : Problem set: 3075 solved, 280 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 80426ms problems are : Problem set: 3075 solved, 280 unsolved
Search for dead transitions found 3075 dead transitions in 80516ms
Found 3075 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3075 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 3075 transitions.
// Phase 1: matrix 2205 rows 75 cols
[2024-05-23 18:35:53] [INFO ] Computed 20 invariants in 44 ms
[2024-05-23 18:35:54] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-05-23 18:35:54] [INFO ] Invariant cache hit.
[2024-05-23 18:35:54] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 914 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 75/75 places, 2205/5330 transitions.
Applied a total of 0 rules in 9 ms. Remains 75 /75 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81692 ms. Remains : 75/75 places, 2205/5330 transitions.
Support contains 68 out of 75 places after structural reductions.
[2024-05-23 18:35:55] [INFO ] Flatten gal took : 484 ms
[2024-05-23 18:35:55] [INFO ] Flatten gal took : 283 ms
[2024-05-23 18:35:56] [INFO ] Input system was already deterministic with 2205 transitions.
RANDOM walk for 40000 steps (8 resets) in 5904 ms. (6 steps per ms) remains 2/21 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
[2024-05-23 18:35:58] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/16 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp19 is UNSAT
At refinement iteration 3 (OVERLAPS) 53/69 variables, 9/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/75 variables, 6/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2205/2280 variables, 75/95 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2280 variables, 0/95 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/2280 variables, 0/95 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2280/2280 variables, and 95 constraints, problems are : Problem set: 1 solved, 1 unsolved in 801 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp1 is UNSAT
After SMT solving in domain Int declared 15/2280 variables, and 5 constraints, problems are : Problem set: 2 solved, 0 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 5/11 constraints, Generalized P Invariants (flows): 0/9 constraints, State Equation: 0/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 940ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA GlobalResAllocation-PT-05-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA GlobalResAllocation-PT-05-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 5 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 2205/2205 transitions.
Applied a total of 0 rules in 14 ms. Remains 75 /75 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Running 280 sub problems to find dead transitions.
[2024-05-23 18:35:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:36:03] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 6 ms to minimize.
[2024-05-23 18:36:03] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 2 ms to minimize.
[2024-05-23 18:36:03] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 2 ms to minimize.
[2024-05-23 18:36:03] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 3 ms to minimize.
[2024-05-23 18:36:04] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 1 ms to minimize.
[2024-05-23 18:36:04] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2024-05-23 18:36:04] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 0 ms to minimize.
[2024-05-23 18:36:04] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-05-23 18:36:04] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 0 ms to minimize.
[2024-05-23 18:36:05] [INFO ] Deduced a trap composed of 9 places in 201 ms of which 1 ms to minimize.
[2024-05-23 18:36:06] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-23 18:36:06] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-23 18:36:06] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 0 ms to minimize.
[2024-05-23 18:36:06] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-05-23 18:36:06] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-23 18:36:06] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 1 ms to minimize.
[2024-05-23 18:36:07] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2024-05-23 18:36:07] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2024-05-23 18:36:07] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-23 18:36:07] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:36:07] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-05-23 18:36:08] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-05-23 18:36:08] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2024-05-23 18:36:08] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-23 18:36:08] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2024-05-23 18:36:08] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-23 18:36:08] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-23 18:36:09] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2024-05-23 18:36:09] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-23 18:36:09] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2024-05-23 18:36:09] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2024-05-23 18:36:09] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-05-23 18:36:09] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-23 18:36:09] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 1 ms to minimize.
[2024-05-23 18:36:09] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 4 ms to minimize.
[2024-05-23 18:36:09] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2024-05-23 18:36:09] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2024-05-23 18:36:10] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-23 18:36:10] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-23 18:36:10] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:36:10] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 0 ms to minimize.
[2024-05-23 18:36:10] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-23 18:36:11] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2024-05-23 18:36:11] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-23 18:36:11] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2024-05-23 18:36:11] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-23 18:36:11] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2024-05-23 18:36:12] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2024-05-23 18:36:12] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 0 ms to minimize.
[2024-05-23 18:36:12] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 4 ms to minimize.
[2024-05-23 18:36:12] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 2 ms to minimize.
[2024-05-23 18:36:12] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2024-05-23 18:36:12] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:36:13] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2024-05-23 18:36:13] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-23 18:36:13] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 6 ms to minimize.
[2024-05-23 18:36:13] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-23 18:36:14] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2024-05-23 18:36:14] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2024-05-23 18:36:14] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 1 ms to minimize.
[2024-05-23 18:36:14] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2024-05-23 18:36:14] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 0 ms to minimize.
[2024-05-23 18:36:15] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:36:16] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 10 ms to minimize.
[2024-05-23 18:36:16] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 0 ms to minimize.
[2024-05-23 18:36:17] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 11 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2280/2280 variables, and 161 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 66/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2280 variables, 280/441 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2280/2280 variables, and 441 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
After SMT, in 42517ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 42520ms
[2024-05-23 18:36:42] [INFO ] Invariant cache hit.
[2024-05-23 18:36:42] [INFO ] Implicit Places using invariants in 347 ms returned [61, 62, 63, 64, 71]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 351 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 70/75 places, 2205/2205 transitions.
Applied a total of 0 rules in 8 ms. Remains 70 /70 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42895 ms. Remains : 70/75 places, 2205/2205 transitions.
Stuttering acceptance computed with spot in 254 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-PT-05-LTLCardinality-00
Product exploration timeout after 85660 steps with 9339 reset in 10002 ms.
Stack based approach found an accepted trace after 1082 steps with 118 reset with depth 10 and stack size 10 in 127 ms.
FORMULA GlobalResAllocation-PT-05-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-PT-05-LTLCardinality-00 finished in 53346 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))) U G(p1)))'
Support contains 65 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 2205/2205 transitions.
Applied a total of 0 rules in 7 ms. Remains 75 /75 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Running 280 sub problems to find dead transitions.
[2024-05-23 18:36:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:36:55] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 0 ms to minimize.
[2024-05-23 18:36:56] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-05-23 18:36:56] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-23 18:36:56] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-23 18:36:56] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-23 18:36:56] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-23 18:36:56] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-23 18:36:56] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2024-05-23 18:36:56] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2024-05-23 18:36:56] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-23 18:36:57] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-23 18:36:57] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:36:57] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 0 ms to minimize.
[2024-05-23 18:36:57] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-23 18:36:57] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-23 18:36:57] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2024-05-23 18:36:57] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2024-05-23 18:36:57] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-23 18:36:57] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-23 18:36:57] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:36:58] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-05-23 18:36:58] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-23 18:36:58] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-23 18:36:58] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-23 18:36:59] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-05-23 18:36:59] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:36:59] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-23 18:36:59] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-05-23 18:36:59] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-23 18:36:59] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-23 18:36:59] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-23 18:36:59] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-23 18:37:00] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-05-23 18:37:00] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 0 ms to minimize.
[2024-05-23 18:37:00] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-23 18:37:00] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-23 18:37:00] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-05-23 18:37:00] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-23 18:37:00] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-23 18:37:00] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:37:01] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 0 ms to minimize.
[2024-05-23 18:37:01] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-23 18:37:01] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-23 18:37:01] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-23 18:37:02] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-23 18:37:02] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-23 18:37:02] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-23 18:37:02] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-23 18:37:02] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 1 ms to minimize.
[2024-05-23 18:37:02] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-23 18:37:03] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2024-05-23 18:37:03] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-23 18:37:03] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:37:03] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-23 18:37:03] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2024-05-23 18:37:03] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-23 18:37:03] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-23 18:37:04] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 1 ms to minimize.
[2024-05-23 18:37:04] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-23 18:37:04] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 0 ms to minimize.
[2024-05-23 18:37:04] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
[2024-05-23 18:37:05] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 1 ms to minimize.
[2024-05-23 18:37:05] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:37:06] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-23 18:37:07] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
[2024-05-23 18:37:07] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 11 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2280/2280 variables, and 161 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 66/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2280 variables, 280/441 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2280/2280 variables, and 441 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
After SMT, in 42063ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 42066ms
[2024-05-23 18:37:35] [INFO ] Invariant cache hit.
[2024-05-23 18:37:35] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-23 18:37:35] [INFO ] Invariant cache hit.
[2024-05-23 18:37:35] [INFO ] Implicit Places using invariants and state equation in 626 ms returned []
Implicit Place search using SMT with State Equation took 849 ms to find 0 implicit places.
Running 280 sub problems to find dead transitions.
[2024-05-23 18:37:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:37:39] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2024-05-23 18:37:39] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-23 18:37:39] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-23 18:37:39] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-23 18:37:39] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-23 18:37:39] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-23 18:37:39] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-05-23 18:37:39] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-23 18:37:39] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-23 18:37:40] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-23 18:37:40] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-23 18:37:40] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-23 18:37:40] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2024-05-23 18:37:40] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-23 18:37:40] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-23 18:37:40] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
[2024-05-23 18:37:40] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 1 ms to minimize.
[2024-05-23 18:37:41] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-05-23 18:37:41] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-23 18:37:41] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:37:41] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-23 18:37:41] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-23 18:37:41] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-23 18:37:42] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-23 18:37:42] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-23 18:37:42] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-23 18:37:42] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-23 18:37:42] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-05-23 18:37:42] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:37:42] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-23 18:37:43] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-05-23 18:37:43] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-23 18:37:43] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:37:43] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 1 ms to minimize.
[2024-05-23 18:37:43] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-05-23 18:37:43] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-23 18:37:43] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-23 18:37:43] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-23 18:37:43] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-23 18:37:44] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:37:44] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 1 ms to minimize.
[2024-05-23 18:37:44] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-23 18:37:45] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-05-23 18:37:45] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-23 18:37:45] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-05-23 18:37:45] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-05-23 18:37:45] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-23 18:37:45] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-23 18:37:45] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2024-05-23 18:37:46] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-23 18:37:46] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-23 18:37:46] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-23 18:37:46] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:37:46] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-05-23 18:37:46] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2024-05-23 18:37:46] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-23 18:37:46] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-23 18:37:47] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 0 ms to minimize.
[2024-05-23 18:37:47] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-23 18:37:48] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2024-05-23 18:37:48] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2024-05-23 18:37:48] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 1 ms to minimize.
[2024-05-23 18:37:48] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:37:49] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-23 18:37:50] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2024-05-23 18:37:50] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 11 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2280 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2280/2280 variables, and 161 constraints, problems are : Problem set: 0 solved, 280 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 66/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2280 variables, 280/441 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2280/2280 variables, and 441 constraints, problems are : Problem set: 0 solved, 280 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
After SMT, in 62174ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 62178ms
Finished structural reductions in LTL mode , in 1 iterations and 105104 ms. Remains : 75/75 places, 2205/2205 transitions.
Stuttering acceptance computed with spot in 245 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : GlobalResAllocation-PT-05-LTLCardinality-02
Product exploration explored 100000 steps with 0 reset in 1901 ms.
Product exploration explored 100000 steps with 0 reset in 1907 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 185 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Reduction of identical properties reduced properties to check from 6 to 4
RANDOM walk for 40000 steps (8 resets) in 1839 ms. (21 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 1/1 properties
[2024-05-23 18:38:46] [INFO ] Invariant cache hit.
Problem apf1 is UNSAT
After SMT solving in domain Real declared 65/2280 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 0/11 constraints, Generalized P Invariants (flows): 0/9 constraints, State Equation: 0/75 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 82ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (G (OR (NOT p1) p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT (OR p1 (NOT p0)))), (F p1), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 288 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
[2024-05-23 18:38:47] [INFO ] Invariant cache hit.
[2024-05-23 18:38:47] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-23 18:38:47] [INFO ] [Real]Absence check using 11 positive and 9 generalized place invariants in 8 ms returned sat
[2024-05-23 18:38:48] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2024-05-23 18:38:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 18:38:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-23 18:38:49] [INFO ] [Nat]Absence check using 11 positive and 9 generalized place invariants in 5 ms returned sat
[2024-05-23 18:38:49] [INFO ] [Nat]Absence check using state equation in 558 ms returned sat
[2024-05-23 18:38:50] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 243 ms.
[2024-05-23 18:38:50] [INFO ] Added : 0 causal constraints over 0 iterations in 423 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-23 18:38:50] [INFO ] Invariant cache hit.
[2024-05-23 18:38:52] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-23 18:38:52] [INFO ] [Real]Absence check using 11 positive and 9 generalized place invariants in 12 ms returned sat
[2024-05-23 18:38:52] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2024-05-23 18:38:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 18:38:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-23 18:38:54] [INFO ] [Nat]Absence check using 11 positive and 9 generalized place invariants in 5 ms returned sat
[2024-05-23 18:38:54] [INFO ] [Nat]Absence check using state equation in 413 ms returned sat
[2024-05-23 18:38:54] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 318 ms.
[2024-05-23 18:38:54] [INFO ] Added : 0 causal constraints over 0 iterations in 453 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 65 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 2205/2205 transitions.
Applied a total of 0 rules in 14 ms. Remains 75 /75 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Running 280 sub problems to find dead transitions.
[2024-05-23 18:38:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:38:58] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
[2024-05-23 18:38:58] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-23 18:38:58] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-23 18:38:58] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-23 18:38:58] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-05-23 18:38:58] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-23 18:38:58] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-05-23 18:38:58] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-05-23 18:38:58] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-23 18:38:59] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2024-05-23 18:38:59] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-05-23 18:38:59] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-23 18:38:59] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2024-05-23 18:38:59] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-23 18:38:59] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-23 18:38:59] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 1 ms to minimize.
[2024-05-23 18:39:00] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 0 ms to minimize.
[2024-05-23 18:39:00] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-23 18:39:00] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-23 18:39:00] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:39:00] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-23 18:39:00] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-23 18:39:01] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-05-23 18:39:01] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2024-05-23 18:39:01] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-23 18:39:01] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-05-23 18:39:01] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-05-23 18:39:01] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2024-05-23 18:39:02] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-05-23 18:39:02] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-23 18:39:02] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-23 18:39:02] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-23 18:39:02] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-23 18:39:02] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2024-05-23 18:39:02] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-23 18:39:02] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-23 18:39:02] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-23 18:39:02] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-23 18:39:02] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-05-23 18:39:03] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:39:03] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 1 ms to minimize.
[2024-05-23 18:39:03] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2024-05-23 18:39:04] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2024-05-23 18:39:04] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-23 18:39:04] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2024-05-23 18:39:04] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-23 18:39:04] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-23 18:39:04] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-05-23 18:39:05] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2024-05-23 18:39:05] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-23 18:39:05] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-23 18:39:05] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-23 18:39:05] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:39:05] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-23 18:39:05] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-23 18:39:05] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2024-05-23 18:39:06] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2024-05-23 18:39:06] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 3 ms to minimize.
[2024-05-23 18:39:07] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-23 18:39:07] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2024-05-23 18:39:07] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
[2024-05-23 18:39:07] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2024-05-23 18:39:07] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:39:08] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-23 18:39:09] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2024-05-23 18:39:09] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 11 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2280/2280 variables, and 161 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 66/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2280 variables, 280/441 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2280/2280 variables, and 441 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
After SMT, in 42132ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 42136ms
[2024-05-23 18:39:37] [INFO ] Invariant cache hit.
[2024-05-23 18:39:37] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-23 18:39:37] [INFO ] Invariant cache hit.
[2024-05-23 18:39:37] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 821 ms to find 0 implicit places.
Running 280 sub problems to find dead transitions.
[2024-05-23 18:39:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:39:41] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 0 ms to minimize.
[2024-05-23 18:39:41] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-23 18:39:41] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-23 18:39:41] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-23 18:39:41] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-23 18:39:41] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:39:41] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-23 18:39:41] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-23 18:39:41] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-23 18:39:41] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-23 18:39:42] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-23 18:39:42] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-23 18:39:42] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2024-05-23 18:39:42] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-23 18:39:42] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-23 18:39:42] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2024-05-23 18:39:42] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2024-05-23 18:39:42] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-23 18:39:42] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-23 18:39:42] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:39:43] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-23 18:39:43] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-05-23 18:39:43] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-23 18:39:43] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-05-23 18:39:44] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-23 18:39:44] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-23 18:39:44] [INFO ] Deduced a trap composed of 9 places in 168 ms of which 0 ms to minimize.
[2024-05-23 18:39:44] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-23 18:39:44] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-23 18:39:44] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-23 18:39:44] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-23 18:39:44] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-23 18:39:44] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-23 18:39:45] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
[2024-05-23 18:39:45] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-23 18:39:45] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-05-23 18:39:45] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-23 18:39:45] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-23 18:39:45] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-23 18:39:45] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:39:45] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 0 ms to minimize.
[2024-05-23 18:39:46] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-23 18:39:46] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-23 18:39:46] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-23 18:39:46] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-05-23 18:39:47] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-23 18:39:47] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-23 18:39:47] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-23 18:39:47] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2024-05-23 18:39:47] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-23 18:39:47] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-23 18:39:47] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-23 18:39:47] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:39:48] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-23 18:39:48] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-23 18:39:48] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-05-23 18:39:48] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-05-23 18:39:49] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
[2024-05-23 18:39:49] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-23 18:39:49] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2024-05-23 18:39:49] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 0 ms to minimize.
[2024-05-23 18:39:49] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2024-05-23 18:39:50] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:39:51] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-23 18:39:51] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2024-05-23 18:39:51] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 11 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2280 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2280/2280 variables, and 161 constraints, problems are : Problem set: 0 solved, 280 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 66/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2280 variables, 280/441 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2280/2280 variables, and 441 constraints, problems are : Problem set: 0 solved, 280 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
After SMT, in 62148ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 62151ms
Finished structural reductions in LTL mode , in 1 iterations and 105130 ms. Remains : 75/75 places, 2205/2205 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
RANDOM walk for 10 steps (0 resets) in 19 ms. (0 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F p0), (F p1)]
Knowledge based reduction with 3 factoid took 203 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
[2024-05-23 18:40:43] [INFO ] Invariant cache hit.
[2024-05-23 18:40:43] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-23 18:40:43] [INFO ] [Real]Absence check using 11 positive and 9 generalized place invariants in 5 ms returned sat
[2024-05-23 18:40:44] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2024-05-23 18:40:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 18:40:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-23 18:40:44] [INFO ] [Nat]Absence check using 11 positive and 9 generalized place invariants in 4 ms returned sat
[2024-05-23 18:40:45] [INFO ] [Nat]Absence check using state equation in 508 ms returned sat
[2024-05-23 18:40:45] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 189 ms.
[2024-05-23 18:40:45] [INFO ] Added : 0 causal constraints over 0 iterations in 319 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-23 18:40:45] [INFO ] Invariant cache hit.
[2024-05-23 18:40:47] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-23 18:40:47] [INFO ] [Real]Absence check using 11 positive and 9 generalized place invariants in 12 ms returned sat
[2024-05-23 18:40:48] [INFO ] [Real]Absence check using state equation in 419 ms returned sat
[2024-05-23 18:40:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 18:40:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-23 18:40:49] [INFO ] [Nat]Absence check using 11 positive and 9 generalized place invariants in 5 ms returned sat
[2024-05-23 18:40:50] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
[2024-05-23 18:40:50] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 271 ms.
[2024-05-23 18:40:50] [INFO ] Added : 0 causal constraints over 0 iterations in 396 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1923 ms.
Product exploration explored 100000 steps with 0 reset in 1977 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Support contains 65 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 2205/2205 transitions.
Applied a total of 0 rules in 105 ms. Remains 75 /75 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Running 280 sub problems to find dead transitions.
[2024-05-23 18:40:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:40:58] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2024-05-23 18:40:58] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 1 ms to minimize.
[2024-05-23 18:40:58] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-23 18:40:58] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-23 18:40:58] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-23 18:40:58] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-23 18:40:58] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-05-23 18:40:59] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-23 18:40:59] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-23 18:40:59] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-23 18:40:59] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-23 18:40:59] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-23 18:40:59] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
[2024-05-23 18:40:59] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:40:59] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-23 18:41:00] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2024-05-23 18:41:00] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2024-05-23 18:41:00] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-23 18:41:00] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-23 18:41:00] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:41:00] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-05-23 18:41:01] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-23 18:41:01] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-23 18:41:01] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-05-23 18:41:02] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-23 18:41:02] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-23 18:41:02] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2024-05-23 18:41:02] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-23 18:41:02] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-23 18:41:02] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-23 18:41:02] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2024-05-23 18:41:02] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-23 18:41:02] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:41:03] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2024-05-23 18:41:03] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:41:03] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-23 18:41:03] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-23 18:41:03] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-23 18:41:03] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-23 18:41:03] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:41:03] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 1 ms to minimize.
[2024-05-23 18:41:04] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-23 18:41:04] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-23 18:41:04] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-23 18:41:04] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-23 18:41:05] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-05-23 18:41:05] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-23 18:41:05] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2024-05-23 18:41:05] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 1 ms to minimize.
[2024-05-23 18:41:05] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2024-05-23 18:41:05] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 0 ms to minimize.
[2024-05-23 18:41:05] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-05-23 18:41:06] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:41:06] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2024-05-23 18:41:06] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 0 ms to minimize.
[2024-05-23 18:41:06] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2024-05-23 18:41:06] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2024-05-23 18:41:07] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 0 ms to minimize.
[2024-05-23 18:41:07] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2024-05-23 18:41:07] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 1 ms to minimize.
[2024-05-23 18:41:08] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 0 ms to minimize.
[2024-05-23 18:41:08] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 0 ms to minimize.
[2024-05-23 18:41:08] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:41:09] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-23 18:41:10] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 1 ms to minimize.
[2024-05-23 18:41:10] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 11 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2280/2280 variables, and 161 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 66/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2280 variables, 280/441 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2280/2280 variables, and 441 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
After SMT, in 42047ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 42050ms
[2024-05-23 18:41:38] [INFO ] Redundant transitions in 744 ms returned [1360, 1361, 1362, 1363, 1364, 1365, 1366, 1367, 1368, 1369, 1370, 1371, 1372, 1373, 1374, 1375, 1376, 1377, 1378, 1379, 1380, 1381, 1382, 1383, 1384, 1385, 1386, 1387, 1388, 1389, 1390, 1391, 1392, 1393, 1394, 1395, 1396, 1397, 1398, 1399, 1400, 1401, 1402, 1403, 1404, 1405, 1406, 1407, 1408, 1409, 1410, 1411, 1412, 1413, 1414, 1415, 1416, 1417, 1418, 1419, 1420, 1421, 1422, 1423, 1424, 1425, 1426, 1427, 1428, 1429, 1430, 1431, 1432, 1433, 1434, 1435, 1436, 1437, 1438, 1439, 1440, 1441, 1442, 1443, 1444, 1445, 1446, 1447, 1448, 1449, 1450, 1451, 1452, 1453, 1454, 1455, 1456, 1457, 1458, 1459, 1460, 1461, 1462, 1463, 1464, 1465, 1466, 1467, 1468, 1469, 1470, 1471, 1472, 1473, 1474, 1475, 1476, 1477, 1478, 1479, 1480, 1481, 1482, 1483, 1484, 1485, 1486, 1487, 1488, 1489, 1490, 1491, 1492, 1493, 1494, 1495, 1496, 1497, 1498, 1499, 1500, 1501, 1502, 1503, 1504, 1505, 1506, 1507, 1508, 1509, 1510, 1511, 1512, 1513, 1514, 1515, 1516, 1517, 1518, 1519, 1520, 1521, 1522, 1523, 1524, 1525, 1526, 1527, 1528, 1529, 1530, 1531, 1532, 1533, 1534, 1535, 1536, 1537, 1538, 1539, 1540, 1541, 1542, 1543, 1544, 1545, 1546, 1547, 1548, 1549, 1550, 1551, 1552, 1553, 1554, 1555, 1556, 1557, 1558, 1559, 1560, 1561, 1562, 1563, 1564, 1565, 1566, 1567, 1568, 1569, 1570, 1571, 1572, 1573, 1574, 1575, 1576, 1577, 1578, 1579, 1580, 1581, 1582, 1583, 1584]
Found 225 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 225 transitions
Redundant transitions reduction (with SMT) removed 225 transitions.
Running 55 sub problems to find dead transitions.
// Phase 1: matrix 1980 rows 75 cols
[2024-05-23 18:41:38] [INFO ] Computed 20 invariants in 17 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 4/75 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 1980/2055 variables, 75/95 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2055 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (OVERLAPS) 0/2055 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 95 constraints, problems are : Problem set: 0 solved, 55 unsolved in 4263 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-23 18:41:43] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-23 18:41:43] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-05-23 18:41:43] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-23 18:41:43] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2024-05-23 18:41:43] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-05-23 18:41:43] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2024-05-23 18:41:43] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 1980/2055 variables, 75/102 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2055 variables, 55/157 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2055 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (OVERLAPS) 0/2055 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2055/2055 variables, and 157 constraints, problems are : Problem set: 0 solved, 55 unsolved in 16299 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 7/7 constraints]
After SMT, in 21024ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 21024ms
Starting structural reductions in SI_LTL mode, iteration 1 : 75/75 places, 1980/2205 transitions.
Applied a total of 0 rules in 31 ms. Remains 75 /75 variables (removed 0) and now considering 1980/1980 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63993 ms. Remains : 75/75 places, 1980/2205 transitions.
Support contains 65 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 2205/2205 transitions.
Applied a total of 0 rules in 5 ms. Remains 75 /75 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Running 280 sub problems to find dead transitions.
// Phase 1: matrix 2205 rows 75 cols
[2024-05-23 18:41:59] [INFO ] Computed 20 invariants in 19 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:42:02] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2024-05-23 18:42:02] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2024-05-23 18:42:02] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-23 18:42:02] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-23 18:42:02] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2024-05-23 18:42:02] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 7 ms to minimize.
[2024-05-23 18:42:03] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-05-23 18:42:03] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-05-23 18:42:03] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2024-05-23 18:42:03] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-23 18:42:03] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 1 ms to minimize.
[2024-05-23 18:42:03] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 0 ms to minimize.
[2024-05-23 18:42:03] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 0 ms to minimize.
[2024-05-23 18:42:04] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 0 ms to minimize.
[2024-05-23 18:42:04] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2024-05-23 18:42:04] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 0 ms to minimize.
[2024-05-23 18:42:04] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 1 ms to minimize.
[2024-05-23 18:42:04] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2024-05-23 18:42:04] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2024-05-23 18:42:04] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:42:05] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
[2024-05-23 18:42:05] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-23 18:42:05] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 0 ms to minimize.
[2024-05-23 18:42:05] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-23 18:42:05] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-05-23 18:42:06] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-23 18:42:06] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-23 18:42:06] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 0 ms to minimize.
[2024-05-23 18:42:06] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-23 18:42:06] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-23 18:42:06] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-23 18:42:06] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:42:07] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-23 18:42:07] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-23 18:42:07] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-23 18:42:07] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-05-23 18:42:07] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-23 18:42:07] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-05-23 18:42:07] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2024-05-23 18:42:07] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:42:07] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-23 18:42:08] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-23 18:42:08] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-23 18:42:08] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-23 18:42:08] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-23 18:42:08] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-05-23 18:42:09] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-23 18:42:09] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-23 18:42:09] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 0 ms to minimize.
[2024-05-23 18:42:09] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2024-05-23 18:42:09] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-23 18:42:09] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-23 18:42:09] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:42:10] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:42:12] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-05-23 18:42:12] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-23 18:42:12] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (OVERLAPS) 4/75 variables, 4/77 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 11 (OVERLAPS) 2205/2280 variables, 75/152 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2280/2280 variables, and 152 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 57/73 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 4/77 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 2205/2280 variables, 75/152 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2280 variables, 280/432 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2280/2280 variables, and 432 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 57/57 constraints]
After SMT, in 42339ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 42343ms
[2024-05-23 18:42:41] [INFO ] Invariant cache hit.
[2024-05-23 18:42:41] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-23 18:42:41] [INFO ] Invariant cache hit.
[2024-05-23 18:42:42] [INFO ] Implicit Places using invariants and state equation in 635 ms returned []
Implicit Place search using SMT with State Equation took 874 ms to find 0 implicit places.
Running 280 sub problems to find dead transitions.
[2024-05-23 18:42:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:42:45] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2024-05-23 18:42:46] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2024-05-23 18:42:46] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-05-23 18:42:46] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-23 18:42:46] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:42:46] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-23 18:42:46] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-23 18:42:46] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-23 18:42:46] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-23 18:42:46] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-23 18:42:46] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-23 18:42:47] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-23 18:42:47] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 0 ms to minimize.
[2024-05-23 18:42:47] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-23 18:42:47] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-23 18:42:47] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 0 ms to minimize.
[2024-05-23 18:42:47] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2024-05-23 18:42:47] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-05-23 18:42:47] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-05-23 18:42:47] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:42:48] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-23 18:42:48] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 0 ms to minimize.
[2024-05-23 18:42:48] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-23 18:42:48] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-23 18:42:49] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-23 18:42:49] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-23 18:42:49] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-23 18:42:49] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-23 18:42:49] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-23 18:42:49] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-05-23 18:42:49] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-23 18:42:49] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-23 18:42:49] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-23 18:42:50] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2024-05-23 18:42:50] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-23 18:42:50] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-05-23 18:42:50] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-23 18:42:50] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-23 18:42:50] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-23 18:42:50] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:42:50] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 1 ms to minimize.
[2024-05-23 18:42:51] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-23 18:42:51] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-23 18:42:51] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-23 18:42:51] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2024-05-23 18:42:51] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-23 18:42:52] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-23 18:42:52] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-23 18:42:52] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2024-05-23 18:42:52] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-23 18:42:52] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-23 18:42:52] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 5 ms to minimize.
[2024-05-23 18:42:52] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:42:53] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2024-05-23 18:42:53] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-23 18:42:53] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-23 18:42:53] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-05-23 18:42:54] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 0 ms to minimize.
[2024-05-23 18:42:54] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-23 18:42:54] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 0 ms to minimize.
[2024-05-23 18:42:54] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
[2024-05-23 18:42:54] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 0 ms to minimize.
[2024-05-23 18:42:55] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:42:56] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-23 18:42:56] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
[2024-05-23 18:42:56] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 11 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2280 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2280/2280 variables, and 161 constraints, problems are : Problem set: 0 solved, 280 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 66/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2280 variables, 280/441 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2280/2280 variables, and 441 constraints, problems are : Problem set: 0 solved, 280 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
After SMT, in 62477ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 62483ms
Finished structural reductions in LTL mode , in 1 iterations and 105708 ms. Remains : 75/75 places, 2205/2205 transitions.
Treatment of property GlobalResAllocation-PT-05-LTLCardinality-02 finished in 412275 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((!(G(X(p0)) U (p1 U p0))||G(p1)))))'
Support contains 65 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 2205/2205 transitions.
Applied a total of 0 rules in 11 ms. Remains 75 /75 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Running 280 sub problems to find dead transitions.
[2024-05-23 18:43:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:43:48] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
[2024-05-23 18:43:48] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-05-23 18:43:48] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-05-23 18:43:48] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-23 18:43:48] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-23 18:43:48] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-23 18:43:48] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-23 18:43:48] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-23 18:43:48] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-23 18:43:49] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-23 18:43:49] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-23 18:43:49] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-05-23 18:43:49] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2024-05-23 18:43:49] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-23 18:43:49] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-23 18:43:49] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2024-05-23 18:43:49] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2024-05-23 18:43:49] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-23 18:43:50] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2024-05-23 18:43:50] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:43:50] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-05-23 18:43:50] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2024-05-23 18:43:51] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2024-05-23 18:43:51] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2024-05-23 18:43:51] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-05-23 18:43:51] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-23 18:43:51] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-23 18:43:51] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-05-23 18:43:52] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-23 18:43:52] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-23 18:43:52] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-05-23 18:43:52] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-23 18:43:52] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-23 18:43:52] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2024-05-23 18:43:52] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-23 18:43:52] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-05-23 18:43:52] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-23 18:43:52] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-23 18:43:52] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-23 18:43:53] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:43:53] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 0 ms to minimize.
[2024-05-23 18:43:53] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-23 18:43:54] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-23 18:43:54] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-23 18:43:54] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 0 ms to minimize.
[2024-05-23 18:43:54] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2024-05-23 18:43:54] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-23 18:43:54] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-23 18:43:54] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 0 ms to minimize.
[2024-05-23 18:43:55] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-23 18:43:55] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-23 18:43:55] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-23 18:43:55] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:43:55] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-23 18:43:55] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-23 18:43:55] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-23 18:43:55] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-23 18:43:56] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
[2024-05-23 18:43:56] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-23 18:43:56] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2024-05-23 18:43:57] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2024-05-23 18:43:57] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2024-05-23 18:43:57] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:43:58] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-23 18:43:59] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2024-05-23 18:43:59] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 11 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2280/2280 variables, and 161 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 66/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2280 variables, 280/441 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2280/2280 variables, and 441 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
After SMT, in 41995ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 41998ms
[2024-05-23 18:44:27] [INFO ] Invariant cache hit.
[2024-05-23 18:44:27] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-23 18:44:27] [INFO ] Invariant cache hit.
[2024-05-23 18:44:28] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 839 ms to find 0 implicit places.
Running 280 sub problems to find dead transitions.
[2024-05-23 18:44:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:44:31] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2024-05-23 18:44:31] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-23 18:44:31] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-23 18:44:31] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-23 18:44:31] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-23 18:44:31] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-23 18:44:31] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-23 18:44:31] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-23 18:44:32] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-23 18:44:32] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2024-05-23 18:44:32] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-05-23 18:44:32] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2024-05-23 18:44:32] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2024-05-23 18:44:32] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-23 18:44:32] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-23 18:44:33] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 0 ms to minimize.
[2024-05-23 18:44:33] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 1 ms to minimize.
[2024-05-23 18:44:33] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-05-23 18:44:33] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-23 18:44:33] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:44:33] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-23 18:44:34] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-23 18:44:34] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-23 18:44:34] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2024-05-23 18:44:34] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-23 18:44:34] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-23 18:44:34] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-23 18:44:35] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-23 18:44:35] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-23 18:44:35] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-23 18:44:35] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-23 18:44:35] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-23 18:44:35] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-23 18:44:35] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2024-05-23 18:44:35] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-23 18:44:35] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-23 18:44:35] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-05-23 18:44:35] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-05-23 18:44:36] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-23 18:44:36] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:44:36] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 1 ms to minimize.
[2024-05-23 18:44:36] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-05-23 18:44:37] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2024-05-23 18:44:37] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:44:37] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-23 18:44:37] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-23 18:44:37] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-23 18:44:37] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-23 18:44:37] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
[2024-05-23 18:44:38] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-23 18:44:38] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-23 18:44:38] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-23 18:44:38] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:44:38] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-05-23 18:44:38] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-05-23 18:44:38] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-23 18:44:38] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-23 18:44:39] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2024-05-23 18:44:39] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-23 18:44:40] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
[2024-05-23 18:44:40] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
[2024-05-23 18:44:40] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
[2024-05-23 18:44:40] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:44:41] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-23 18:44:42] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 0 ms to minimize.
[2024-05-23 18:44:42] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 11 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2280 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2280/2280 variables, and 161 constraints, problems are : Problem set: 0 solved, 280 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 66/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2280 variables, 280/441 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2280/2280 variables, and 441 constraints, problems are : Problem set: 0 solved, 280 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
After SMT, in 62345ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 62351ms
Finished structural reductions in LTL mode , in 1 iterations and 105203 ms. Remains : 75/75 places, 2205/2205 transitions.
Stuttering acceptance computed with spot in 175 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), true, (NOT p1), p0]
Running random walk in product with property : GlobalResAllocation-PT-05-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 17 steps with 4 reset in 6 ms.
FORMULA GlobalResAllocation-PT-05-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-PT-05-LTLCardinality-03 finished in 105421 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 5 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 2205/2205 transitions.
Applied a total of 0 rules in 115 ms. Remains 75 /75 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Running 280 sub problems to find dead transitions.
[2024-05-23 18:45:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:45:33] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
[2024-05-23 18:45:34] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-23 18:45:34] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-23 18:45:34] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 0 ms to minimize.
[2024-05-23 18:45:34] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-05-23 18:45:34] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-23 18:45:34] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2024-05-23 18:45:34] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-23 18:45:34] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-23 18:45:35] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-05-23 18:45:35] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-23 18:45:35] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-23 18:45:35] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2024-05-23 18:45:35] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-23 18:45:35] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:45:35] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
[2024-05-23 18:45:36] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2024-05-23 18:45:36] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-23 18:45:36] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-23 18:45:36] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:45:36] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-23 18:45:36] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-23 18:45:37] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-23 18:45:37] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2024-05-23 18:45:37] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-23 18:45:37] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-23 18:45:37] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-23 18:45:37] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-23 18:45:38] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-23 18:45:38] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-23 18:45:38] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-23 18:45:38] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-23 18:45:38] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:45:38] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2024-05-23 18:45:38] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:45:38] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-23 18:45:38] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-05-23 18:45:38] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-23 18:45:38] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-23 18:45:39] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:45:39] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 0 ms to minimize.
[2024-05-23 18:45:39] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-23 18:45:40] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-23 18:45:40] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-23 18:45:40] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-23 18:45:40] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-23 18:45:40] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-23 18:45:40] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-23 18:45:41] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 1 ms to minimize.
[2024-05-23 18:45:41] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-23 18:45:41] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-23 18:45:41] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-23 18:45:41] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:45:41] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-23 18:45:41] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-23 18:45:41] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-23 18:45:41] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-23 18:45:42] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 0 ms to minimize.
[2024-05-23 18:45:42] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-23 18:45:43] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
[2024-05-23 18:45:43] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 0 ms to minimize.
[2024-05-23 18:45:43] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 0 ms to minimize.
[2024-05-23 18:45:43] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:45:44] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2024-05-23 18:45:45] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 0 ms to minimize.
[2024-05-23 18:45:45] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 11 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2280/2280 variables, and 161 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 66/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2280 variables, 280/441 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2280/2280 variables, and 441 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
After SMT, in 42244ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 42247ms
[2024-05-23 18:46:13] [INFO ] Invariant cache hit.
[2024-05-23 18:46:13] [INFO ] Implicit Places using invariants in 408 ms returned [61, 62, 63, 64, 71]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 411 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/75 places, 2205/2205 transitions.
Applied a total of 0 rules in 85 ms. Remains 70 /70 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 42860 ms. Remains : 70/75 places, 2205/2205 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : GlobalResAllocation-PT-05-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 1762 ms.
Product exploration explored 100000 steps with 0 reset in 1822 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 154 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
RANDOM walk for 5 steps (0 resets) in 19 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 189 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
// Phase 1: matrix 2205 rows 70 cols
[2024-05-23 18:46:19] [INFO ] Computed 15 invariants in 15 ms
[2024-05-23 18:46:20] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-05-23 18:46:20] [INFO ] [Real]Absence check using state equation in 336 ms returned sat
[2024-05-23 18:46:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 18:46:20] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-05-23 18:46:21] [INFO ] [Nat]Absence check using state equation in 333 ms returned sat
[2024-05-23 18:46:21] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 120 ms.
[2024-05-23 18:46:21] [INFO ] Added : 0 causal constraints over 0 iterations in 225 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 2205/2205 transitions.
Applied a total of 0 rules in 60 ms. Remains 70 /70 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Running 280 sub problems to find dead transitions.
[2024-05-23 18:46:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (OVERLAPS) 15/70 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (OVERLAPS) 2205/2275 variables, 70/85 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2275 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 0/2275 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2275/2275 variables, and 85 constraints, problems are : Problem set: 0 solved, 280 unsolved in 12586 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (OVERLAPS) 15/70 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (OVERLAPS) 2205/2275 variables, 70/85 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2275 variables, 280/365 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2275 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2275/2275 variables, and 365 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 0/0 constraints]
After SMT, in 33680ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 33683ms
[2024-05-23 18:46:55] [INFO ] Invariant cache hit.
[2024-05-23 18:46:55] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-05-23 18:46:55] [INFO ] Invariant cache hit.
[2024-05-23 18:46:56] [INFO ] Implicit Places using invariants and state equation in 629 ms returned []
Implicit Place search using SMT with State Equation took 894 ms to find 0 implicit places.
[2024-05-23 18:46:56] [INFO ] Redundant transitions in 327 ms returned [1360, 1361, 1362, 1363, 1364, 1365, 1366, 1367, 1368, 1369, 1370, 1371, 1372, 1373, 1374, 1375, 1376, 1377, 1378, 1379, 1380, 1381, 1382, 1383, 1384, 1385, 1386, 1387, 1388, 1389, 1390, 1391, 1392, 1393, 1394, 1395, 1396, 1397, 1398, 1399, 1400, 1401, 1402, 1403, 1404, 1405, 1406, 1407, 1408, 1409, 1410, 1411, 1412, 1413, 1414, 1415, 1416, 1417, 1418, 1419, 1420, 1421, 1422, 1423, 1424, 1425, 1426, 1427, 1428, 1429, 1430, 1431, 1432, 1433, 1434, 1435, 1436, 1437, 1438, 1439, 1440, 1441, 1442, 1443, 1444, 1445, 1446, 1447, 1448, 1449, 1450, 1451, 1452, 1453, 1454, 1455, 1456, 1457, 1458, 1459, 1460, 1461, 1462, 1463, 1464, 1465, 1466, 1467, 1468, 1469, 1470, 1471, 1472, 1473, 1474, 1475, 1476, 1477, 1478, 1479, 1480, 1481, 1482, 1483, 1484, 1485, 1486, 1487, 1488, 1489, 1490, 1491, 1492, 1493, 1494, 1495, 1496, 1497, 1498, 1499, 1500, 1501, 1502, 1503, 1504, 1505, 1506, 1507, 1508, 1509, 1510, 1511, 1512, 1513, 1514, 1515, 1516, 1517, 1518, 1519, 1520, 1521, 1522, 1523, 1524, 1525, 1526, 1527, 1528, 1529, 1530, 1531, 1532, 1533, 1534, 1535, 1536, 1537, 1538, 1539, 1540, 1541, 1542, 1543, 1544, 1545, 1546, 1547, 1548, 1549, 1550, 1551, 1552, 1553, 1554, 1555, 1556, 1557, 1558, 1559, 1560, 1561, 1562, 1563, 1564, 1565, 1566, 1567, 1568, 1569, 1570, 1571, 1572, 1573, 1574, 1575, 1576, 1577, 1578, 1579, 1580, 1581, 1582, 1583, 1584]
Found 225 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 225 transitions
Redundant transitions reduction (with SMT) removed 225 transitions.
Running 55 sub problems to find dead transitions.
// Phase 1: matrix 1980 rows 70 cols
[2024-05-23 18:46:56] [INFO ] Computed 15 invariants in 11 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 15/70 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (OVERLAPS) 1980/2050 variables, 70/85 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2050 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 0/2050 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2050/2050 variables, and 85 constraints, problems are : Problem set: 0 solved, 55 unsolved in 2867 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 15/70 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (OVERLAPS) 1980/2050 variables, 70/85 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2050 variables, 55/140 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2050 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 0/2050 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2050/2050 variables, and 140 constraints, problems are : Problem set: 0 solved, 55 unsolved in 4933 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
After SMT, in 7948ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 7949ms
Starting structural reductions in SI_LTL mode, iteration 1 : 70/70 places, 1980/2205 transitions.
Applied a total of 0 rules in 36 ms. Remains 70 /70 variables (removed 0) and now considering 1980/1980 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 42960 ms. Remains : 70/70 places, 1980/2205 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 181 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
RANDOM walk for 7 steps (0 resets) in 10 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 221 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
[2024-05-23 18:47:06] [INFO ] Invariant cache hit.
[2024-05-23 18:47:07] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2024-05-23 18:47:07] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2024-05-23 18:47:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 18:47:08] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-05-23 18:47:08] [INFO ] [Nat]Absence check using state equation in 371 ms returned sat
[2024-05-23 18:47:08] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 55 transitions) in 87 ms.
[2024-05-23 18:47:08] [INFO ] Added : 0 causal constraints over 0 iterations in 183 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1353 ms.
Product exploration explored 100000 steps with 0 reset in 1497 ms.
Support contains 5 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 1980/1980 transitions.
Applied a total of 0 rules in 26 ms. Remains 70 /70 variables (removed 0) and now considering 1980/1980 (removed 0) transitions.
Running 55 sub problems to find dead transitions.
[2024-05-23 18:47:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 15/70 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (OVERLAPS) 1980/2050 variables, 70/85 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2050 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 0/2050 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2050/2050 variables, and 85 constraints, problems are : Problem set: 0 solved, 55 unsolved in 2986 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 15/70 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (OVERLAPS) 1980/2050 variables, 70/85 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2050 variables, 55/140 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2050 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 0/2050 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2050/2050 variables, and 140 constraints, problems are : Problem set: 0 solved, 55 unsolved in 5780 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
After SMT, in 8917ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 8918ms
[2024-05-23 18:47:20] [INFO ] Invariant cache hit.
[2024-05-23 18:47:20] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-23 18:47:20] [INFO ] Invariant cache hit.
[2024-05-23 18:47:21] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 885 ms to find 0 implicit places.
[2024-05-23 18:47:21] [INFO ] Redundant transitions in 78 ms returned []
Running 55 sub problems to find dead transitions.
[2024-05-23 18:47:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 15/70 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (OVERLAPS) 1980/2050 variables, 70/85 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2050 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 0/2050 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2050/2050 variables, and 85 constraints, problems are : Problem set: 0 solved, 55 unsolved in 3092 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 15/70 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (OVERLAPS) 1980/2050 variables, 70/85 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2050 variables, 55/140 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2050 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 0/2050 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2050/2050 variables, and 140 constraints, problems are : Problem set: 0 solved, 55 unsolved in 5967 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
After SMT, in 9206ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 9208ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19123 ms. Remains : 70/70 places, 1980/1980 transitions.
Treatment of property GlobalResAllocation-PT-05-LTLCardinality-06 finished in 120301 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 5 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 2205/2205 transitions.
Applied a total of 0 rules in 8 ms. Remains 75 /75 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Running 280 sub problems to find dead transitions.
// Phase 1: matrix 2205 rows 75 cols
[2024-05-23 18:47:31] [INFO ] Computed 20 invariants in 20 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:47:34] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 0 ms to minimize.
[2024-05-23 18:47:34] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-23 18:47:34] [INFO ] Deduced a trap composed of 9 places in 199 ms of which 1 ms to minimize.
[2024-05-23 18:47:34] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2024-05-23 18:47:34] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-23 18:47:34] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:47:35] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-23 18:47:35] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-23 18:47:35] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-23 18:47:35] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-23 18:47:35] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 1 ms to minimize.
[2024-05-23 18:47:35] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-23 18:47:35] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 1 ms to minimize.
[2024-05-23 18:47:35] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 1 ms to minimize.
[2024-05-23 18:47:36] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-23 18:47:36] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2024-05-23 18:47:36] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2024-05-23 18:47:36] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-23 18:47:36] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:47:36] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:47:37] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2024-05-23 18:47:37] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-23 18:47:37] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-23 18:47:37] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-23 18:47:37] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-23 18:47:37] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-23 18:47:37] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-05-23 18:47:38] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 0 ms to minimize.
[2024-05-23 18:47:38] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 0 ms to minimize.
[2024-05-23 18:47:38] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-23 18:47:38] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-23 18:47:38] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-23 18:47:38] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-23 18:47:38] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-23 18:47:39] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-23 18:47:39] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-05-23 18:47:39] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-23 18:47:39] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-23 18:47:39] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-05-23 18:47:39] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:47:39] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-23 18:47:40] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-23 18:47:40] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-05-23 18:47:40] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-05-23 18:47:41] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-23 18:47:41] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-23 18:47:41] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-23 18:47:41] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-23 18:47:41] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 0 ms to minimize.
[2024-05-23 18:47:41] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2024-05-23 18:47:41] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-05-23 18:47:42] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-23 18:47:42] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:47:43] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:47:44] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-23 18:47:44] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-23 18:47:44] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (OVERLAPS) 4/75 variables, 4/77 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 11 (OVERLAPS) 2205/2280 variables, 75/152 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2280/2280 variables, and 152 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 57/73 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 4/77 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 2205/2280 variables, 75/152 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2280 variables, 280/432 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2280/2280 variables, and 432 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 57/57 constraints]
After SMT, in 42434ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 42437ms
[2024-05-23 18:48:13] [INFO ] Invariant cache hit.
[2024-05-23 18:48:13] [INFO ] Implicit Places using invariants in 346 ms returned [61, 62, 63, 64, 71]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 349 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 70/75 places, 2205/2205 transitions.
Applied a total of 0 rules in 5 ms. Remains 70 /70 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42801 ms. Remains : 70/75 places, 2205/2205 transitions.
Stuttering acceptance computed with spot in 91 ms :[p0, p0]
Running random walk in product with property : GlobalResAllocation-PT-05-LTLCardinality-07
Product exploration timeout after 23970 steps with 11985 reset in 10002 ms.
Product exploration timeout after 24020 steps with 12010 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 20 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GlobalResAllocation-PT-05-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GlobalResAllocation-PT-05-LTLCardinality-07 finished in 64861 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((G(F(p0)) U p1))))'
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 2205/2205 transitions.
Applied a total of 0 rules in 68 ms. Remains 75 /75 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Running 280 sub problems to find dead transitions.
[2024-05-23 18:48:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:48:39] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2024-05-23 18:48:39] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-23 18:48:39] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-23 18:48:39] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-23 18:48:39] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-23 18:48:39] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:48:39] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-23 18:48:39] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-23 18:48:39] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-23 18:48:40] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-23 18:48:40] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-23 18:48:40] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-23 18:48:40] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 0 ms to minimize.
[2024-05-23 18:48:40] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-23 18:48:40] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-23 18:48:40] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 0 ms to minimize.
[2024-05-23 18:48:40] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2024-05-23 18:48:40] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-23 18:48:41] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-23 18:48:41] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:48:41] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-23 18:48:41] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-05-23 18:48:41] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-23 18:48:41] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-23 18:48:42] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-23 18:48:42] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-23 18:48:42] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-23 18:48:42] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-23 18:48:42] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-23 18:48:42] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-23 18:48:43] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 0 ms to minimize.
[2024-05-23 18:48:43] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-23 18:48:43] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:48:43] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2024-05-23 18:48:43] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-23 18:48:43] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-05-23 18:48:43] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-05-23 18:48:43] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-23 18:48:43] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-23 18:48:44] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:48:44] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 1 ms to minimize.
[2024-05-23 18:48:44] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-23 18:48:44] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-23 18:48:44] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-23 18:48:45] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-23 18:48:45] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-23 18:48:45] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-23 18:48:45] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-23 18:48:45] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2024-05-23 18:48:45] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-23 18:48:46] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-23 18:48:46] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-23 18:48:46] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:48:46] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-23 18:48:46] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-23 18:48:46] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-23 18:48:46] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-23 18:48:47] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 0 ms to minimize.
[2024-05-23 18:48:47] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-23 18:48:47] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2024-05-23 18:48:48] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2024-05-23 18:48:48] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
[2024-05-23 18:48:48] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:48:49] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2024-05-23 18:48:50] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2024-05-23 18:48:50] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 11 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2280/2280 variables, and 161 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 66/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2280 variables, 280/441 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2280/2280 variables, and 441 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
After SMT, in 42242ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 42245ms
[2024-05-23 18:49:18] [INFO ] Invariant cache hit.
[2024-05-23 18:49:18] [INFO ] Implicit Places using invariants in 340 ms returned [63, 64, 71]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 353 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/75 places, 2205/2205 transitions.
Applied a total of 0 rules in 61 ms. Remains 72 /72 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 42730 ms. Remains : 72/75 places, 2205/2205 transitions.
Stuttering acceptance computed with spot in 236 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : GlobalResAllocation-PT-05-LTLCardinality-08
Product exploration explored 100000 steps with 5880 reset in 6982 ms.
Stack based approach found an accepted trace after 17258 steps with 1033 reset with depth 7 and stack size 7 in 1241 ms.
FORMULA GlobalResAllocation-PT-05-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-PT-05-LTLCardinality-08 finished in 51211 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(F(p0)) U G((p1||G(p2)))))))'
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 2205/2205 transitions.
Applied a total of 0 rules in 5 ms. Remains 75 /75 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Running 280 sub problems to find dead transitions.
[2024-05-23 18:49:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:49:30] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2024-05-23 18:49:30] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2024-05-23 18:49:30] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-23 18:49:30] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2024-05-23 18:49:30] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-05-23 18:49:30] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-23 18:49:30] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-23 18:49:30] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-23 18:49:30] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
[2024-05-23 18:49:31] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2024-05-23 18:49:31] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-05-23 18:49:31] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2024-05-23 18:49:31] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 0 ms to minimize.
[2024-05-23 18:49:31] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-05-23 18:49:31] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-05-23 18:49:31] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 0 ms to minimize.
[2024-05-23 18:49:32] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 1 ms to minimize.
[2024-05-23 18:49:32] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 0 ms to minimize.
[2024-05-23 18:49:32] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2024-05-23 18:49:32] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:49:32] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-23 18:49:33] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2024-05-23 18:49:33] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2024-05-23 18:49:33] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2024-05-23 18:49:34] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-05-23 18:49:34] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-23 18:49:34] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 0 ms to minimize.
[2024-05-23 18:49:34] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-23 18:49:34] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2024-05-23 18:49:34] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2024-05-23 18:49:34] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-23 18:49:34] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2024-05-23 18:49:34] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-23 18:49:34] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 0 ms to minimize.
[2024-05-23 18:49:35] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-05-23 18:49:35] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-05-23 18:49:35] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
[2024-05-23 18:49:35] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2024-05-23 18:49:35] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-05-23 18:49:35] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:49:35] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 5 ms to minimize.
[2024-05-23 18:49:36] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2024-05-23 18:49:36] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2024-05-23 18:49:36] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-23 18:49:36] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2024-05-23 18:49:37] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2024-05-23 18:49:37] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2024-05-23 18:49:37] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-23 18:49:37] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 0 ms to minimize.
[2024-05-23 18:49:37] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2024-05-23 18:49:37] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2024-05-23 18:49:37] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-05-23 18:49:38] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:49:38] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2024-05-23 18:49:38] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 2 ms to minimize.
[2024-05-23 18:49:38] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-05-23 18:49:38] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2024-05-23 18:49:39] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 0 ms to minimize.
[2024-05-23 18:49:39] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 0 ms to minimize.
[2024-05-23 18:49:39] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 0 ms to minimize.
[2024-05-23 18:49:39] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
[2024-05-23 18:49:40] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 0 ms to minimize.
[2024-05-23 18:49:40] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:49:41] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2024-05-23 18:49:42] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 1 ms to minimize.
[2024-05-23 18:49:42] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 11 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2280/2280 variables, and 161 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 66/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2280 variables, 280/441 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2280/2280 variables, and 441 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
After SMT, in 42137ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 42140ms
[2024-05-23 18:50:09] [INFO ] Invariant cache hit.
[2024-05-23 18:50:09] [INFO ] Implicit Places using invariants in 329 ms returned [61, 62, 64]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 342 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 72/75 places, 2205/2205 transitions.
Applied a total of 0 rules in 4 ms. Remains 72 /72 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42496 ms. Remains : 72/75 places, 2205/2205 transitions.
Stuttering acceptance computed with spot in 278 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : GlobalResAllocation-PT-05-LTLCardinality-09
Product exploration explored 100000 steps with 6533 reset in 7675 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 2 ms.
FORMULA GlobalResAllocation-PT-05-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-PT-05-LTLCardinality-09 finished in 50486 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(F(p0))||(p1&&F(p2)))))'
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 2205/2205 transitions.
Applied a total of 0 rules in 7 ms. Remains 75 /75 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Running 280 sub problems to find dead transitions.
[2024-05-23 18:50:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:50:20] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2024-05-23 18:50:20] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-23 18:50:20] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-23 18:50:20] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2024-05-23 18:50:20] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-23 18:50:20] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-23 18:50:21] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-23 18:50:21] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-05-23 18:50:21] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2024-05-23 18:50:21] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2024-05-23 18:50:21] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2024-05-23 18:50:21] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-23 18:50:22] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 0 ms to minimize.
[2024-05-23 18:50:22] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-23 18:50:22] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-05-23 18:50:22] [INFO ] Deduced a trap composed of 9 places in 435 ms of which 0 ms to minimize.
[2024-05-23 18:50:23] [INFO ] Deduced a trap composed of 9 places in 393 ms of which 0 ms to minimize.
[2024-05-23 18:50:23] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-23 18:50:23] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-23 18:50:23] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:50:23] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-23 18:50:23] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2024-05-23 18:50:23] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-23 18:50:24] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2024-05-23 18:50:24] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-05-23 18:50:24] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-23 18:50:24] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2024-05-23 18:50:24] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2024-05-23 18:50:25] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-23 18:50:25] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2024-05-23 18:50:25] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-23 18:50:25] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-05-23 18:50:25] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2024-05-23 18:50:25] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 0 ms to minimize.
[2024-05-23 18:50:25] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2024-05-23 18:50:25] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2024-05-23 18:50:25] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2024-05-23 18:50:25] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2024-05-23 18:50:26] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-23 18:50:26] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:50:26] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 0 ms to minimize.
[2024-05-23 18:50:26] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-05-23 18:50:27] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2024-05-23 18:50:27] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-05-23 18:50:27] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-05-23 18:50:27] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-23 18:50:27] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2024-05-23 18:50:28] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-05-23 18:50:28] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
[2024-05-23 18:50:28] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-23 18:50:28] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-23 18:50:28] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2024-05-23 18:50:28] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:50:29] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 1 ms to minimize.
[2024-05-23 18:50:29] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2024-05-23 18:50:29] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-23 18:50:29] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2024-05-23 18:50:30] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 0 ms to minimize.
[2024-05-23 18:50:30] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2024-05-23 18:50:30] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 1 ms to minimize.
[2024-05-23 18:50:30] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
[2024-05-23 18:50:30] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2024-05-23 18:50:31] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:50:32] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2024-05-23 18:50:32] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 1 ms to minimize.
[2024-05-23 18:50:32] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 11 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2280/2280 variables, and 161 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 66/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2280 variables, 280/441 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2280/2280 variables, and 441 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
After SMT, in 42052ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 42054ms
[2024-05-23 18:50:59] [INFO ] Invariant cache hit.
[2024-05-23 18:50:59] [INFO ] Implicit Places using invariants in 333 ms returned [61, 62, 63, 71]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 336 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 71/75 places, 2205/2205 transitions.
Applied a total of 0 rules in 4 ms. Remains 71 /71 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42403 ms. Remains : 71/75 places, 2205/2205 transitions.
Stuttering acceptance computed with spot in 305 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : GlobalResAllocation-PT-05-LTLCardinality-10
Product exploration explored 100000 steps with 5193 reset in 6268 ms.
Stack based approach found an accepted trace after 285 steps with 15 reset with depth 24 and stack size 24 in 21 ms.
FORMULA GlobalResAllocation-PT-05-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-PT-05-LTLCardinality-10 finished in 49021 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 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 2205/2205 transitions.
Applied a total of 0 rules in 73 ms. Remains 75 /75 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Running 280 sub problems to find dead transitions.
[2024-05-23 18:51:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:51:09] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 0 ms to minimize.
[2024-05-23 18:51:09] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-23 18:51:10] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-23 18:51:10] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-05-23 18:51:10] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-23 18:51:10] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-23 18:51:10] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-23 18:51:10] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-23 18:51:10] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-23 18:51:10] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-23 18:51:10] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-23 18:51:11] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-23 18:51:11] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 0 ms to minimize.
[2024-05-23 18:51:11] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-23 18:51:11] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-23 18:51:11] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
[2024-05-23 18:51:11] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 0 ms to minimize.
[2024-05-23 18:51:11] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-23 18:51:11] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-23 18:51:11] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:51:12] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-05-23 18:51:12] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-23 18:51:12] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-23 18:51:12] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-05-23 18:51:13] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-23 18:51:13] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-23 18:51:13] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-23 18:51:13] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-23 18:51:13] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-23 18:51:13] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-23 18:51:13] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-23 18:51:13] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-23 18:51:13] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-23 18:51:14] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2024-05-23 18:51:14] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-23 18:51:14] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-23 18:51:14] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-23 18:51:14] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2024-05-23 18:51:14] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-23 18:51:14] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:51:15] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 0 ms to minimize.
[2024-05-23 18:51:15] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-23 18:51:15] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-23 18:51:15] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-23 18:51:15] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-23 18:51:16] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-23 18:51:16] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-23 18:51:16] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-23 18:51:16] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
[2024-05-23 18:51:16] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-23 18:51:16] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-23 18:51:16] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-23 18:51:17] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:51:17] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-23 18:51:17] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-23 18:51:17] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2024-05-23 18:51:17] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-23 18:51:18] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2024-05-23 18:51:18] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-23 18:51:18] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 0 ms to minimize.
[2024-05-23 18:51:18] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2024-05-23 18:51:19] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 1 ms to minimize.
[2024-05-23 18:51:19] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:51:20] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-05-23 18:51:21] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
[2024-05-23 18:51:21] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 11 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2280/2280 variables, and 161 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 66/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2280 variables, 280/441 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2280/2280 variables, and 441 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
After SMT, in 42237ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 42239ms
[2024-05-23 18:51:48] [INFO ] Invariant cache hit.
[2024-05-23 18:51:49] [INFO ] Implicit Places using invariants in 400 ms returned [61, 62, 63, 64, 71]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 402 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/75 places, 2205/2205 transitions.
Applied a total of 0 rules in 47 ms. Remains 70 /70 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 42765 ms. Remains : 70/75 places, 2205/2205 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : GlobalResAllocation-PT-05-LTLCardinality-11
Product exploration explored 100000 steps with 0 reset in 1729 ms.
Stack based approach found an accepted trace after 84 steps with 0 reset with depth 85 and stack size 83 in 3 ms.
FORMULA GlobalResAllocation-PT-05-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-PT-05-LTLCardinality-11 finished in 44569 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((X((G(p0)||X(!p0)))||F(p1)))))))'
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 2205/2205 transitions.
Applied a total of 0 rules in 9 ms. Remains 75 /75 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Running 280 sub problems to find dead transitions.
[2024-05-23 18:51:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:51:54] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 0 ms to minimize.
[2024-05-23 18:51:54] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2024-05-23 18:51:54] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2024-05-23 18:51:54] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2024-05-23 18:51:54] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-23 18:51:54] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-23 18:51:54] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-05-23 18:51:54] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-23 18:51:55] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-23 18:51:55] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-23 18:51:55] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-23 18:51:55] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-23 18:51:55] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
[2024-05-23 18:51:55] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-23 18:51:55] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:51:56] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2024-05-23 18:51:56] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
[2024-05-23 18:51:56] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-05-23 18:51:56] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-23 18:51:56] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:51:56] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-23 18:51:57] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-23 18:51:57] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-23 18:51:57] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-23 18:51:57] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-23 18:51:57] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-23 18:51:58] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-23 18:51:58] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 0 ms to minimize.
[2024-05-23 18:51:58] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-05-23 18:51:58] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-05-23 18:51:58] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-23 18:51:58] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-23 18:51:58] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-23 18:51:58] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2024-05-23 18:51:58] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-23 18:51:58] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-23 18:51:58] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-23 18:51:59] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-23 18:51:59] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-05-23 18:51:59] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:51:59] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 0 ms to minimize.
[2024-05-23 18:51:59] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-23 18:52:00] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-23 18:52:00] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-23 18:52:00] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-23 18:52:00] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-23 18:52:00] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2024-05-23 18:52:00] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-23 18:52:01] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 0 ms to minimize.
[2024-05-23 18:52:01] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-23 18:52:01] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-05-23 18:52:01] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-23 18:52:01] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:52:01] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-23 18:52:01] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-23 18:52:01] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-05-23 18:52:02] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-23 18:52:02] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2024-05-23 18:52:02] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-23 18:52:03] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
[2024-05-23 18:52:03] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 0 ms to minimize.
[2024-05-23 18:52:03] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 1 ms to minimize.
[2024-05-23 18:52:03] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:52:04] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-05-23 18:52:05] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
[2024-05-23 18:52:05] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 11 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2280/2280 variables, and 161 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20011 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 66/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2280 variables, 280/441 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2280/2280 variables, and 441 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
After SMT, in 42162ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 42165ms
[2024-05-23 18:52:33] [INFO ] Invariant cache hit.
[2024-05-23 18:52:33] [INFO ] Implicit Places using invariants in 404 ms returned [61, 62, 63, 64, 71]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 408 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 70/75 places, 2205/2205 transitions.
Applied a total of 0 rules in 5 ms. Remains 70 /70 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42588 ms. Remains : 70/75 places, 2205/2205 transitions.
Stuttering acceptance computed with spot in 438 ms :[(AND (NOT p1) p0), (NOT p1), false, false, false, (AND (NOT p1) (NOT p0)), false, false, false, false]
Running random walk in product with property : GlobalResAllocation-PT-05-LTLCardinality-12
Product exploration timeout after 58390 steps with 10147 reset in 10001 ms.
Stack based approach found an accepted trace after 987 steps with 178 reset with depth 18 and stack size 18 in 176 ms.
FORMULA GlobalResAllocation-PT-05-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-PT-05-LTLCardinality-12 finished in 53232 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 2205/2205 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Running 280 sub problems to find dead transitions.
[2024-05-23 18:52:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:52:47] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 0 ms to minimize.
[2024-05-23 18:52:47] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2024-05-23 18:52:47] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-05-23 18:52:47] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-23 18:52:47] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-23 18:52:47] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-23 18:52:48] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2024-05-23 18:52:48] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-23 18:52:48] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-23 18:52:48] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 0 ms to minimize.
[2024-05-23 18:52:48] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2024-05-23 18:52:49] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-23 18:52:49] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2024-05-23 18:52:49] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:52:49] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-23 18:52:49] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2024-05-23 18:52:49] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 0 ms to minimize.
[2024-05-23 18:52:49] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-23 18:52:49] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-23 18:52:49] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:52:50] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-23 18:52:50] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-23 18:52:50] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-05-23 18:52:50] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-05-23 18:52:51] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-23 18:52:51] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-23 18:52:51] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-23 18:52:51] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-23 18:52:51] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-05-23 18:52:51] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-23 18:52:51] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2024-05-23 18:52:51] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-23 18:52:51] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-23 18:52:51] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2024-05-23 18:52:51] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-23 18:52:52] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-23 18:52:52] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-23 18:52:52] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-23 18:52:52] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-23 18:52:52] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:52:52] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 1 ms to minimize.
[2024-05-23 18:52:52] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-05-23 18:52:53] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-23 18:52:53] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:52:54] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-05-23 18:52:54] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-05-23 18:52:54] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-05-23 18:52:54] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-23 18:52:54] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 0 ms to minimize.
[2024-05-23 18:52:54] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-23 18:52:54] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-05-23 18:52:54] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-23 18:52:55] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:52:55] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-23 18:52:55] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-23 18:52:55] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-23 18:52:55] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-05-23 18:52:56] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 0 ms to minimize.
[2024-05-23 18:52:56] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-23 18:52:56] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 0 ms to minimize.
[2024-05-23 18:52:56] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2024-05-23 18:52:57] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2024-05-23 18:52:57] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:52:58] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-23 18:52:58] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 1 ms to minimize.
[2024-05-23 18:52:59] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 11 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2280/2280 variables, and 161 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 66/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2280 variables, 280/441 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2280/2280 variables, and 441 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
After SMT, in 42294ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 42298ms
[2024-05-23 18:53:26] [INFO ] Invariant cache hit.
[2024-05-23 18:53:27] [INFO ] Implicit Places using invariants in 365 ms returned [61, 62, 63, 64, 71]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 368 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 70/75 places, 2205/2205 transitions.
Applied a total of 0 rules in 5 ms. Remains 70 /70 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42679 ms. Remains : 70/75 places, 2205/2205 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-PT-05-LTLCardinality-13
Product exploration timeout after 37810 steps with 10656 reset in 10003 ms.
Stack based approach found an accepted trace after 3166 steps with 914 reset with depth 9 and stack size 9 in 846 ms.
FORMULA GlobalResAllocation-PT-05-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-PT-05-LTLCardinality-13 finished in 53666 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))) U G(p1)))'
Found a Lengthening insensitive property : GlobalResAllocation-PT-05-LTLCardinality-02
Stuttering acceptance computed with spot in 262 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Support contains 65 out of 75 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 75/75 places, 2205/2205 transitions.
Applied a total of 0 rules in 19 ms. Remains 75 /75 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Running 280 sub problems to find dead transitions.
[2024-05-23 18:53:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:53:41] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2024-05-23 18:53:41] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-05-23 18:53:41] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-23 18:53:41] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-23 18:53:42] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-23 18:53:42] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-23 18:53:42] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2024-05-23 18:53:42] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-23 18:53:42] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-23 18:53:42] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 0 ms to minimize.
[2024-05-23 18:53:42] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-23 18:53:43] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-23 18:53:43] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 0 ms to minimize.
[2024-05-23 18:53:43] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-23 18:53:43] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-23 18:53:43] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2024-05-23 18:53:43] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2024-05-23 18:53:43] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2024-05-23 18:53:43] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-23 18:53:43] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:53:44] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-23 18:53:44] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2024-05-23 18:53:44] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-23 18:53:44] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-23 18:53:45] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-23 18:53:45] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-23 18:53:45] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2024-05-23 18:53:45] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-23 18:53:45] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-23 18:53:45] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-05-23 18:53:45] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2024-05-23 18:53:45] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-23 18:53:45] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-23 18:53:46] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
[2024-05-23 18:53:46] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-23 18:53:46] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-23 18:53:46] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-23 18:53:46] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-23 18:53:46] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:53:46] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:53:46] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 0 ms to minimize.
[2024-05-23 18:53:47] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-05-23 18:53:47] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-23 18:53:47] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-23 18:53:47] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-23 18:53:48] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2024-05-23 18:53:48] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2024-05-23 18:53:48] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-23 18:53:48] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 0 ms to minimize.
[2024-05-23 18:53:48] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-23 18:53:49] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-23 18:53:49] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-23 18:53:49] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:53:49] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-23 18:53:49] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-23 18:53:49] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-05-23 18:53:49] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-23 18:53:50] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2024-05-23 18:53:50] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-23 18:53:50] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2024-05-23 18:53:50] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2024-05-23 18:53:51] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
[2024-05-23 18:53:51] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:53:52] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-23 18:53:53] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
[2024-05-23 18:53:53] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 11 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2280/2280 variables, and 161 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 66/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2280 variables, 280/441 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2280/2280 variables, and 441 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
After SMT, in 42351ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 42354ms
[2024-05-23 18:54:20] [INFO ] Invariant cache hit.
[2024-05-23 18:54:20] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-23 18:54:20] [INFO ] Invariant cache hit.
[2024-05-23 18:54:21] [INFO ] Implicit Places using invariants and state equation in 597 ms returned []
Implicit Place search using SMT with State Equation took 809 ms to find 0 implicit places.
Running 280 sub problems to find dead transitions.
[2024-05-23 18:54:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:54:24] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2024-05-23 18:54:24] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-23 18:54:25] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-23 18:54:25] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-23 18:54:25] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-23 18:54:25] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-23 18:54:25] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-23 18:54:25] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-23 18:54:25] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-23 18:54:25] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-23 18:54:25] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-23 18:54:26] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-23 18:54:26] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 0 ms to minimize.
[2024-05-23 18:54:26] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-23 18:54:26] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-23 18:54:26] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 0 ms to minimize.
[2024-05-23 18:54:26] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2024-05-23 18:54:26] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-23 18:54:26] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-23 18:54:26] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:54:27] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-05-23 18:54:27] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-23 18:54:27] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-23 18:54:27] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-23 18:54:28] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-23 18:54:28] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-23 18:54:28] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-23 18:54:28] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-23 18:54:28] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:54:28] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-23 18:54:28] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-23 18:54:28] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-23 18:54:28] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:54:28] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2024-05-23 18:54:29] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-23 18:54:29] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-23 18:54:29] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-05-23 18:54:29] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-23 18:54:29] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-23 18:54:29] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:54:29] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 1 ms to minimize.
[2024-05-23 18:54:29] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-05-23 18:54:30] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-23 18:54:30] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-23 18:54:30] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-23 18:54:30] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-23 18:54:31] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-23 18:54:31] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-23 18:54:31] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
[2024-05-23 18:54:31] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-23 18:54:31] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-23 18:54:31] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:54:31] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:54:32] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-23 18:54:32] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-23 18:54:32] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-05-23 18:54:32] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-23 18:54:33] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2024-05-23 18:54:33] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-23 18:54:33] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2024-05-23 18:54:34] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 0 ms to minimize.
[2024-05-23 18:54:34] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 0 ms to minimize.
[2024-05-23 18:54:34] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:54:35] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-23 18:54:36] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2024-05-23 18:54:36] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 11 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2280 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2280/2280 variables, and 161 constraints, problems are : Problem set: 0 solved, 280 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 66/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2280 variables, 280/441 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2280/2280 variables, and 441 constraints, problems are : Problem set: 0 solved, 280 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
After SMT, in 62348ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 62352ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 105538 ms. Remains : 75/75 places, 2205/2205 transitions.
Running random walk in product with property : GlobalResAllocation-PT-05-LTLCardinality-02
Product exploration explored 100000 steps with 0 reset in 1928 ms.
Product exploration explored 100000 steps with 0 reset in 2014 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 161 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 338 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Reduction of identical properties reduced properties to check from 6 to 4
RANDOM walk for 40000 steps (8 resets) in 1133 ms. (35 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
[2024-05-23 18:55:31] [INFO ] Invariant cache hit.
Problem apf1 is UNSAT
After SMT solving in domain Real declared 65/2280 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 0/11 constraints, Generalized P Invariants (flows): 0/9 constraints, State Equation: 0/75 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 64ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (G (OR (NOT p1) p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT (OR p1 (NOT p0)))), (F p1), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 252 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
[2024-05-23 18:55:32] [INFO ] Invariant cache hit.
[2024-05-23 18:55:33] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-23 18:55:33] [INFO ] [Real]Absence check using 11 positive and 9 generalized place invariants in 5 ms returned sat
[2024-05-23 18:55:33] [INFO ] [Real]Absence check using state equation in 386 ms returned sat
[2024-05-23 18:55:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 18:55:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-23 18:55:34] [INFO ] [Nat]Absence check using 11 positive and 9 generalized place invariants in 4 ms returned sat
[2024-05-23 18:55:34] [INFO ] [Nat]Absence check using state equation in 500 ms returned sat
[2024-05-23 18:55:35] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 145 ms.
[2024-05-23 18:55:35] [INFO ] Added : 0 causal constraints over 0 iterations in 257 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-23 18:55:35] [INFO ] Invariant cache hit.
[2024-05-23 18:55:37] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-23 18:55:37] [INFO ] [Real]Absence check using 11 positive and 9 generalized place invariants in 12 ms returned sat
[2024-05-23 18:55:37] [INFO ] [Real]Absence check using state equation in 405 ms returned sat
[2024-05-23 18:55:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 18:55:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-23 18:55:39] [INFO ] [Nat]Absence check using 11 positive and 9 generalized place invariants in 5 ms returned sat
[2024-05-23 18:55:39] [INFO ] [Nat]Absence check using state equation in 407 ms returned sat
[2024-05-23 18:55:39] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 139 ms.
[2024-05-23 18:55:39] [INFO ] Added : 0 causal constraints over 0 iterations in 253 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 65 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 2205/2205 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Running 280 sub problems to find dead transitions.
[2024-05-23 18:55:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:55:43] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 0 ms to minimize.
[2024-05-23 18:55:43] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-05-23 18:55:43] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-23 18:55:43] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-05-23 18:55:43] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-23 18:55:43] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-23 18:55:43] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-23 18:55:43] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-23 18:55:43] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-23 18:55:44] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-23 18:55:44] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-23 18:55:44] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-23 18:55:44] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2024-05-23 18:55:44] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-23 18:55:44] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-23 18:55:44] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 0 ms to minimize.
[2024-05-23 18:55:45] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 0 ms to minimize.
[2024-05-23 18:55:45] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-23 18:55:45] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-23 18:55:45] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:55:45] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-05-23 18:55:45] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2024-05-23 18:55:45] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-23 18:55:46] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-23 18:55:46] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-23 18:55:46] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-23 18:55:46] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-23 18:55:46] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-05-23 18:55:46] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-23 18:55:46] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-23 18:55:47] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-23 18:55:47] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-23 18:55:47] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-23 18:55:47] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2024-05-23 18:55:47] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-23 18:55:47] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-23 18:55:47] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-23 18:55:47] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-23 18:55:47] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-23 18:55:48] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:55:48] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 0 ms to minimize.
[2024-05-23 18:55:48] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-23 18:55:48] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-23 18:55:49] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-23 18:55:49] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-05-23 18:55:49] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-23 18:55:49] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2024-05-23 18:55:49] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-23 18:55:49] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2024-05-23 18:55:49] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-23 18:55:50] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-05-23 18:55:50] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-23 18:55:50] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:55:50] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 0 ms to minimize.
[2024-05-23 18:55:50] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2024-05-23 18:55:50] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2024-05-23 18:55:51] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-05-23 18:55:51] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2024-05-23 18:55:51] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-05-23 18:55:52] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 0 ms to minimize.
[2024-05-23 18:55:52] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2024-05-23 18:55:52] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2024-05-23 18:55:52] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:55:53] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-23 18:55:54] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2024-05-23 18:55:54] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 11 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2280/2280 variables, and 161 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 66/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2280 variables, 280/441 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2280/2280 variables, and 441 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
After SMT, in 42327ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 42329ms
[2024-05-23 18:56:22] [INFO ] Invariant cache hit.
[2024-05-23 18:56:22] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-23 18:56:22] [INFO ] Invariant cache hit.
[2024-05-23 18:56:22] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 806 ms to find 0 implicit places.
Running 280 sub problems to find dead transitions.
[2024-05-23 18:56:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:56:26] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
[2024-05-23 18:56:26] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-23 18:56:26] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2024-05-23 18:56:26] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-23 18:56:26] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-23 18:56:26] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-23 18:56:26] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-23 18:56:26] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-23 18:56:26] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-23 18:56:27] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-23 18:56:27] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-23 18:56:27] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-23 18:56:27] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 1 ms to minimize.
[2024-05-23 18:56:27] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-23 18:56:27] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:56:27] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2024-05-23 18:56:27] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2024-05-23 18:56:28] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2024-05-23 18:56:28] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-23 18:56:28] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:56:28] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-23 18:56:28] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-23 18:56:28] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-05-23 18:56:28] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-23 18:56:29] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-23 18:56:29] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-23 18:56:29] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-23 18:56:29] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-05-23 18:56:29] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-23 18:56:29] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-23 18:56:30] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-23 18:56:30] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-23 18:56:30] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-23 18:56:30] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2024-05-23 18:56:30] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-23 18:56:30] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-23 18:56:30] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-05-23 18:56:30] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-23 18:56:30] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-23 18:56:30] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:56:31] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 1 ms to minimize.
[2024-05-23 18:56:31] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-23 18:56:31] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-23 18:56:31] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-23 18:56:32] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-23 18:56:32] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-23 18:56:32] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-23 18:56:32] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-05-23 18:56:32] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
[2024-05-23 18:56:32] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-23 18:56:33] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-23 18:56:33] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-23 18:56:33] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:56:33] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-05-23 18:56:33] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-05-23 18:56:33] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-23 18:56:33] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-23 18:56:34] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 1 ms to minimize.
[2024-05-23 18:56:35] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-23 18:56:35] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2024-05-23 18:56:35] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2024-05-23 18:56:35] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2024-05-23 18:56:35] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:56:36] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-23 18:56:37] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 0 ms to minimize.
[2024-05-23 18:56:37] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 11 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2280 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2280/2280 variables, and 161 constraints, problems are : Problem set: 0 solved, 280 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 66/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2280 variables, 280/441 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2280/2280 variables, and 441 constraints, problems are : Problem set: 0 solved, 280 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
After SMT, in 62372ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 62377ms
Finished structural reductions in LTL mode , in 1 iterations and 105520 ms. Remains : 75/75 places, 2205/2205 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 189 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
RANDOM walk for 10 steps (0 resets) in 11 ms. (0 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F p0), (F p1)]
Knowledge based reduction with 3 factoid took 164 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
[2024-05-23 18:57:28] [INFO ] Invariant cache hit.
[2024-05-23 18:57:28] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-23 18:57:28] [INFO ] [Real]Absence check using 11 positive and 9 generalized place invariants in 5 ms returned sat
[2024-05-23 18:57:29] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2024-05-23 18:57:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 18:57:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-23 18:57:30] [INFO ] [Nat]Absence check using 11 positive and 9 generalized place invariants in 4 ms returned sat
[2024-05-23 18:57:30] [INFO ] [Nat]Absence check using state equation in 497 ms returned sat
[2024-05-23 18:57:30] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 166 ms.
[2024-05-23 18:57:30] [INFO ] Added : 0 causal constraints over 0 iterations in 282 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-23 18:57:31] [INFO ] Invariant cache hit.
[2024-05-23 18:57:32] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-23 18:57:32] [INFO ] [Real]Absence check using 11 positive and 9 generalized place invariants in 12 ms returned sat
[2024-05-23 18:57:33] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2024-05-23 18:57:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 18:57:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-23 18:57:34] [INFO ] [Nat]Absence check using 11 positive and 9 generalized place invariants in 4 ms returned sat
[2024-05-23 18:57:35] [INFO ] [Nat]Absence check using state equation in 414 ms returned sat
[2024-05-23 18:57:35] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 140 ms.
[2024-05-23 18:57:35] [INFO ] Added : 0 causal constraints over 0 iterations in 245 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 1863 ms.
Product exploration explored 100000 steps with 0 reset in 1968 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Support contains 65 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 2205/2205 transitions.
Applied a total of 0 rules in 51 ms. Remains 75 /75 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Running 280 sub problems to find dead transitions.
[2024-05-23 18:57:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:57:43] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2024-05-23 18:57:43] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-23 18:57:43] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-23 18:57:43] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-23 18:57:43] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
[2024-05-23 18:57:43] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-05-23 18:57:43] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2024-05-23 18:57:43] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-05-23 18:57:44] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2024-05-23 18:57:44] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-23 18:57:44] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-23 18:57:44] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-23 18:57:44] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2024-05-23 18:57:44] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:57:44] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-23 18:57:45] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2024-05-23 18:57:45] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2024-05-23 18:57:45] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-23 18:57:45] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-23 18:57:45] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:57:45] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-23 18:57:46] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-23 18:57:46] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-05-23 18:57:46] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2024-05-23 18:57:46] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-23 18:57:46] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-23 18:57:47] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2024-05-23 18:57:47] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2024-05-23 18:57:47] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-23 18:57:47] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-23 18:57:47] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2024-05-23 18:57:47] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-23 18:57:47] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-23 18:57:47] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
[2024-05-23 18:57:47] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-05-23 18:57:48] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2024-05-23 18:57:48] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-23 18:57:48] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-23 18:57:48] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-23 18:57:48] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:57:48] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 0 ms to minimize.
[2024-05-23 18:57:49] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2024-05-23 18:57:49] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2024-05-23 18:57:49] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-05-23 18:57:49] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2024-05-23 18:57:50] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
[2024-05-23 18:57:50] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2024-05-23 18:57:50] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-05-23 18:57:50] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 0 ms to minimize.
[2024-05-23 18:57:50] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 1 ms to minimize.
[2024-05-23 18:57:50] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2024-05-23 18:57:50] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-05-23 18:57:51] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:57:51] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 0 ms to minimize.
[2024-05-23 18:57:52] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 1 ms to minimize.
[2024-05-23 18:57:52] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2024-05-23 18:57:52] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2024-05-23 18:57:53] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 0 ms to minimize.
[2024-05-23 18:57:53] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2024-05-23 18:57:53] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 0 ms to minimize.
[2024-05-23 18:57:53] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 1 ms to minimize.
[2024-05-23 18:57:53] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 0 ms to minimize.
[2024-05-23 18:57:54] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:57:55] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2024-05-23 18:57:55] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 0 ms to minimize.
[2024-05-23 18:57:56] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 11 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2280/2280 variables, and 161 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 66/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2280 variables, 280/441 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2280/2280 variables, and 441 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
After SMT, in 42416ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 42418ms
[2024-05-23 18:58:22] [INFO ] Redundant transitions in 362 ms returned [1360, 1361, 1362, 1363, 1364, 1365, 1366, 1367, 1368, 1369, 1370, 1371, 1372, 1373, 1374, 1375, 1376, 1377, 1378, 1379, 1380, 1381, 1382, 1383, 1384, 1385, 1386, 1387, 1388, 1389, 1390, 1391, 1392, 1393, 1394, 1395, 1396, 1397, 1398, 1399, 1400, 1401, 1402, 1403, 1404, 1405, 1406, 1407, 1408, 1409, 1410, 1411, 1412, 1413, 1414, 1415, 1416, 1417, 1418, 1419, 1420, 1421, 1422, 1423, 1424, 1425, 1426, 1427, 1428, 1429, 1430, 1431, 1432, 1433, 1434, 1435, 1436, 1437, 1438, 1439, 1440, 1441, 1442, 1443, 1444, 1445, 1446, 1447, 1448, 1449, 1450, 1451, 1452, 1453, 1454, 1455, 1456, 1457, 1458, 1459, 1460, 1461, 1462, 1463, 1464, 1465, 1466, 1467, 1468, 1469, 1470, 1471, 1472, 1473, 1474, 1475, 1476, 1477, 1478, 1479, 1480, 1481, 1482, 1483, 1484, 1485, 1486, 1487, 1488, 1489, 1490, 1491, 1492, 1493, 1494, 1495, 1496, 1497, 1498, 1499, 1500, 1501, 1502, 1503, 1504, 1505, 1506, 1507, 1508, 1509, 1510, 1511, 1512, 1513, 1514, 1515, 1516, 1517, 1518, 1519, 1520, 1521, 1522, 1523, 1524, 1525, 1526, 1527, 1528, 1529, 1530, 1531, 1532, 1533, 1534, 1535, 1536, 1537, 1538, 1539, 1540, 1541, 1542, 1543, 1544, 1545, 1546, 1547, 1548, 1549, 1550, 1551, 1552, 1553, 1554, 1555, 1556, 1557, 1558, 1559, 1560, 1561, 1562, 1563, 1564, 1565, 1566, 1567, 1568, 1569, 1570, 1571, 1572, 1573, 1574, 1575, 1576, 1577, 1578, 1579, 1580, 1581, 1582, 1583, 1584]
Found 225 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 225 transitions
Redundant transitions reduction (with SMT) removed 225 transitions.
Running 55 sub problems to find dead transitions.
// Phase 1: matrix 1980 rows 75 cols
[2024-05-23 18:58:22] [INFO ] Computed 20 invariants in 14 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 4/75 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 1980/2055 variables, 75/95 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2055 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (OVERLAPS) 0/2055 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 95 constraints, problems are : Problem set: 0 solved, 55 unsolved in 3808 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-23 18:58:27] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-23 18:58:27] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-23 18:58:27] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-23 18:58:27] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-05-23 18:58:27] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2024-05-23 18:58:27] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2024-05-23 18:58:27] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 1980/2055 variables, 75/102 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2055 variables, 55/157 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2055 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (OVERLAPS) 0/2055 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2055/2055 variables, and 157 constraints, problems are : Problem set: 0 solved, 55 unsolved in 15732 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 7/7 constraints]
After SMT, in 19978ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 19979ms
Starting structural reductions in SI_LTL mode, iteration 1 : 75/75 places, 1980/2205 transitions.
Applied a total of 0 rules in 17 ms. Remains 75 /75 variables (removed 0) and now considering 1980/1980 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62834 ms. Remains : 75/75 places, 1980/2205 transitions.
Support contains 65 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 2205/2205 transitions.
Applied a total of 0 rules in 5 ms. Remains 75 /75 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Running 280 sub problems to find dead transitions.
// Phase 1: matrix 2205 rows 75 cols
[2024-05-23 18:58:42] [INFO ] Computed 20 invariants in 21 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:58:46] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2024-05-23 18:58:46] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2024-05-23 18:58:46] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2024-05-23 18:58:46] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2024-05-23 18:58:46] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-05-23 18:58:46] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-05-23 18:58:46] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-05-23 18:58:46] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-23 18:58:46] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2024-05-23 18:58:46] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-23 18:58:47] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 1 ms to minimize.
[2024-05-23 18:58:47] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2024-05-23 18:58:47] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 1 ms to minimize.
[2024-05-23 18:58:47] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 1 ms to minimize.
[2024-05-23 18:58:47] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2024-05-23 18:58:47] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2024-05-23 18:58:48] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 0 ms to minimize.
[2024-05-23 18:58:48] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-23 18:58:48] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-05-23 18:58:48] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:58:49] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2024-05-23 18:58:49] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-23 18:58:49] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-23 18:58:49] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-23 18:58:49] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2024-05-23 18:58:49] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-05-23 18:58:49] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-23 18:58:50] [INFO ] Deduced a trap composed of 9 places in 288 ms of which 0 ms to minimize.
[2024-05-23 18:58:50] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-05-23 18:58:50] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-23 18:58:50] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2024-05-23 18:58:50] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-05-23 18:58:50] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-05-23 18:58:50] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-05-23 18:58:51] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-05-23 18:58:51] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2024-05-23 18:58:51] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2024-05-23 18:58:51] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2024-05-23 18:58:51] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-23 18:58:51] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:58:51] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-23 18:58:52] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-23 18:58:52] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-05-23 18:58:52] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-05-23 18:58:52] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2024-05-23 18:58:52] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2024-05-23 18:58:52] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2024-05-23 18:58:53] [INFO ] Deduced a trap composed of 9 places in 219 ms of which 1 ms to minimize.
[2024-05-23 18:58:54] [INFO ] Deduced a trap composed of 9 places in 249 ms of which 1 ms to minimize.
[2024-05-23 18:58:54] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 0 ms to minimize.
[2024-05-23 18:58:54] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-05-23 18:58:54] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-23 18:58:54] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:58:55] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:58:57] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-05-23 18:58:57] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2024-05-23 18:58:57] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (OVERLAPS) 4/75 variables, 4/77 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 11 (OVERLAPS) 2205/2280 variables, 75/152 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2280/2280 variables, and 152 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 57/73 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 4/77 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 2205/2280 variables, 75/152 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2280 variables, 280/432 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2280/2280 variables, and 432 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 57/57 constraints]
After SMT, in 42484ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 42487ms
[2024-05-23 18:59:25] [INFO ] Invariant cache hit.
[2024-05-23 18:59:25] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-23 18:59:25] [INFO ] Invariant cache hit.
[2024-05-23 18:59:26] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 836 ms to find 0 implicit places.
Running 280 sub problems to find dead transitions.
[2024-05-23 18:59:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:59:28] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 1 ms to minimize.
[2024-05-23 18:59:28] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2024-05-23 18:59:29] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-23 18:59:29] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 0 ms to minimize.
[2024-05-23 18:59:29] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-23 18:59:29] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-23 18:59:29] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-23 18:59:29] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-23 18:59:29] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2024-05-23 18:59:29] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2024-05-23 18:59:29] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-23 18:59:30] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-05-23 18:59:30] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2024-05-23 18:59:30] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-23 18:59:30] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-23 18:59:30] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
[2024-05-23 18:59:30] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 0 ms to minimize.
[2024-05-23 18:59:30] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-05-23 18:59:30] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 0 ms to minimize.
[2024-05-23 18:59:31] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:59:31] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:59:31] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2024-05-23 18:59:31] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2024-05-23 18:59:31] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-23 18:59:32] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-23 18:59:32] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-05-23 18:59:32] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2024-05-23 18:59:33] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-05-23 18:59:33] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-23 18:59:33] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2024-05-23 18:59:33] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2024-05-23 18:59:33] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-23 18:59:33] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-23 18:59:33] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
[2024-05-23 18:59:33] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2024-05-23 18:59:34] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2024-05-23 18:59:34] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2024-05-23 18:59:34] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-23 18:59:34] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2024-05-23 18:59:34] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:59:34] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 0 ms to minimize.
[2024-05-23 18:59:34] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2024-05-23 18:59:35] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-23 18:59:35] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-05-23 18:59:35] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-23 18:59:35] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2024-05-23 18:59:36] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2024-05-23 18:59:36] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-05-23 18:59:36] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
[2024-05-23 18:59:36] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-23 18:59:36] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2024-05-23 18:59:36] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2024-05-23 18:59:36] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:59:37] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-23 18:59:37] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-23 18:59:37] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2024-05-23 18:59:37] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-23 18:59:38] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 0 ms to minimize.
[2024-05-23 18:59:38] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2024-05-23 18:59:38] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2024-05-23 18:59:38] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 0 ms to minimize.
[2024-05-23 18:59:38] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
[2024-05-23 18:59:38] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-23 18:59:40] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 0 ms to minimize.
[2024-05-23 18:59:40] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 1 ms to minimize.
[2024-05-23 18:59:40] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 11 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2280 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2280/2280 variables, and 161 constraints, problems are : Problem set: 0 solved, 280 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 11/71 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 66/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 2205/2280 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2280 variables, 280/441 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2280/2280 variables, and 441 constraints, problems are : Problem set: 0 solved, 280 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 66/66 constraints]
After SMT, in 61819ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 61821ms
Finished structural reductions in LTL mode , in 1 iterations and 105152 ms. Remains : 75/75 places, 2205/2205 transitions.
Treatment of property GlobalResAllocation-PT-05-LTLCardinality-02 finished in 409979 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)))'
[2024-05-23 19:00:28] [INFO ] Flatten gal took : 228 ms
[2024-05-23 19:00:28] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-23 19:00:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 75 places, 2205 transitions and 19285 arcs took 59 ms.
Total runtime 1557882 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running GlobalResAllocation-PT-05
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 75
TRANSITIONS: 2205
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.089s, Sys 0.004s]
SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.009s, 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: 6749
MODEL NAME: /home/mcc/execution/413/model
75 places, 2205 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA GlobalResAllocation-PT-05-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA GlobalResAllocation-PT-05-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716491234370
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
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="GlobalResAllocation-PT-05"
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 GlobalResAllocation-PT-05, 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 r179-tall-171640602100691"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GlobalResAllocation-PT-05.tgz
mv GlobalResAllocation-PT-05 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 ;