About the Execution of GreatSPN+red for CO4-PT-18
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5839.228 | 1327486.00 | 1838333.00 | 3217.10 | TTTF?FFFFFFTFFTT | 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.r549-tall-171734897900140.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 CO4-PT-18, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734897900140
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 14K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 239K Jun 2 16:33 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 CO4-PT-18-LTLFireability-00
FORMULA_NAME CO4-PT-18-LTLFireability-01
FORMULA_NAME CO4-PT-18-LTLFireability-02
FORMULA_NAME CO4-PT-18-LTLFireability-03
FORMULA_NAME CO4-PT-18-LTLFireability-04
FORMULA_NAME CO4-PT-18-LTLFireability-05
FORMULA_NAME CO4-PT-18-LTLFireability-06
FORMULA_NAME CO4-PT-18-LTLFireability-07
FORMULA_NAME CO4-PT-18-LTLFireability-08
FORMULA_NAME CO4-PT-18-LTLFireability-09
FORMULA_NAME CO4-PT-18-LTLFireability-10
FORMULA_NAME CO4-PT-18-LTLFireability-11
FORMULA_NAME CO4-PT-18-LTLFireability-12
FORMULA_NAME CO4-PT-18-LTLFireability-13
FORMULA_NAME CO4-PT-18-LTLFireability-14
FORMULA_NAME CO4-PT-18-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717360865180
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 20:41:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 20:41:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:41:06] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2024-06-02 20:41:06] [INFO ] Transformed 979 places.
[2024-06-02 20:41:06] [INFO ] Transformed 1111 transitions.
[2024-06-02 20:41:06] [INFO ] Found NUPN structural information;
[2024-06-02 20:41:06] [INFO ] Parsed PT model containing 979 places and 1111 transitions and 2420 arcs in 212 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 157 places in 13 ms
Reduce places removed 157 places and 177 transitions.
FORMULA CO4-PT-18-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 822 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 822/822 places, 934/934 transitions.
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 808 transition count 931
Discarding 129 places :
Symmetric choice reduction at 1 with 129 rule applications. Total rules 146 place count 679 transition count 800
Iterating global reduction 1 with 129 rules applied. Total rules applied 275 place count 679 transition count 800
Discarding 112 places :
Symmetric choice reduction at 1 with 112 rule applications. Total rules 387 place count 567 transition count 688
Iterating global reduction 1 with 112 rules applied. Total rules applied 499 place count 567 transition count 688
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 502 place count 567 transition count 685
Discarding 54 places :
Symmetric choice reduction at 2 with 54 rule applications. Total rules 556 place count 513 transition count 631
Iterating global reduction 2 with 54 rules applied. Total rules applied 610 place count 513 transition count 631
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 611 place count 513 transition count 630
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 644 place count 480 transition count 597
Iterating global reduction 3 with 33 rules applied. Total rules applied 677 place count 480 transition count 597
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 680 place count 480 transition count 594
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 697 place count 463 transition count 577
Iterating global reduction 4 with 17 rules applied. Total rules applied 714 place count 463 transition count 577
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 715 place count 463 transition count 576
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 721 place count 457 transition count 570
Iterating global reduction 5 with 6 rules applied. Total rules applied 727 place count 457 transition count 570
Applied a total of 727 rules in 226 ms. Remains 457 /822 variables (removed 365) and now considering 570/934 (removed 364) transitions.
// Phase 1: matrix 570 rows 457 cols
[2024-06-02 20:41:07] [INFO ] Computed 5 invariants in 26 ms
[2024-06-02 20:41:07] [INFO ] Implicit Places using invariants in 308 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 336 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 456/822 places, 570/934 transitions.
Applied a total of 0 rules in 13 ms. Remains 456 /456 variables (removed 0) and now considering 570/570 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 591 ms. Remains : 456/822 places, 570/934 transitions.
Support contains 24 out of 456 places after structural reductions.
[2024-06-02 20:41:07] [INFO ] Flatten gal took : 63 ms
[2024-06-02 20:41:07] [INFO ] Flatten gal took : 28 ms
[2024-06-02 20:41:07] [INFO ] Input system was already deterministic with 570 transitions.
RANDOM walk for 40000 steps (58 resets) in 1672 ms. (23 steps per ms) remains 19/22 properties
BEST_FIRST walk for 4004 steps (21 resets) in 25 ms. (154 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4003 steps (19 resets) in 34 ms. (114 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (22 resets) in 25 ms. (153 steps per ms) remains 16/18 properties
BEST_FIRST walk for 4002 steps (22 resets) in 50 ms. (78 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (23 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (23 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (25 resets) in 25 ms. (153 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (13 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (19 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (25 resets) in 22 ms. (174 steps per ms) remains 13/15 properties
BEST_FIRST walk for 4002 steps (16 resets) in 40 ms. (97 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4002 steps (24 resets) in 21 ms. (181 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (21 resets) in 41 ms. (95 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (23 resets) in 21 ms. (181 steps per ms) remains 13/13 properties
// Phase 1: matrix 570 rows 456 cols
[2024-06-02 20:41:08] [INFO ] Computed 4 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 63/77 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 228/305 variables, 87/101 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 12/317 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 19/336 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 318/654 variables, 150/257 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/654 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 225/879 variables, 114/371 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/879 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 105/984 variables, 62/433 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/984 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 33/1017 variables, 21/454 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1017 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (OVERLAPS) 9/1026 variables, 6/460 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1026 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (OVERLAPS) 0/1026 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1026/1026 variables, and 460 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1486 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 63/77 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 228/305 variables, 87/101 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 13/114 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 12/317 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 19/336 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 318/654 variables, 150/270 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/654 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 225/879 variables, 114/384 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/879 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 105/984 variables, 62/446 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/984 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 33/1017 variables, 21/467 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1017 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (OVERLAPS) 9/1026 variables, 6/473 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1026 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (OVERLAPS) 0/1026 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1026/1026 variables, and 473 constraints, problems are : Problem set: 0 solved, 13 unsolved in 2084 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 3631ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 12 different solutions.
Finished Parikh walk after 3582 steps, including 30 resets, run visited all 1 properties in 6 ms. (steps per millisecond=597 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 13 properties in 1582 ms.
Computed a total of 16 stabilizing places and 19 stable transitions
Graph (complete) has 718 edges and 456 vertex of which 451 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.10 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 1 out of 456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 570/570 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 446 transition count 560
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 446 transition count 560
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 439 transition count 553
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 439 transition count 553
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 439 transition count 552
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 436 transition count 549
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 436 transition count 549
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 434 transition count 547
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 434 transition count 547
Applied a total of 45 rules in 34 ms. Remains 434 /456 variables (removed 22) and now considering 547/570 (removed 23) transitions.
// Phase 1: matrix 547 rows 434 cols
[2024-06-02 20:41:14] [INFO ] Computed 4 invariants in 7 ms
[2024-06-02 20:41:14] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-02 20:41:14] [INFO ] Invariant cache hit.
[2024-06-02 20:41:14] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Running 546 sub problems to find dead transitions.
[2024-06-02 20:41:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 1 (OVERLAPS) 1/434 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 3 (OVERLAPS) 547/981 variables, 434/438 constraints. Problems are: Problem set: 0 solved, 546 unsolved
[2024-06-02 20:41:30] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 23 ms to minimize.
[2024-06-02 20:41:31] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/981 variables, 2/440 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/981 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 546 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 981/981 variables, and 440 constraints, problems are : Problem set: 0 solved, 546 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 434/434 constraints, PredecessorRefiner: 546/546 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 546 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 1 (OVERLAPS) 1/434 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 4 (OVERLAPS) 547/981 variables, 434/440 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/981 variables, 546/986 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/981 variables, 0/986 constraints. Problems are: Problem set: 0 solved, 546 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 981/981 variables, and 986 constraints, problems are : Problem set: 0 solved, 546 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 434/434 constraints, PredecessorRefiner: 546/546 constraints, Known Traps: 2/2 constraints]
After SMT, in 60184ms problems are : Problem set: 0 solved, 546 unsolved
Search for dead transitions found 0 dead transitions in 60198ms
Starting structural reductions in LTL mode, iteration 1 : 434/456 places, 547/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60581 ms. Remains : 434/456 places, 547/570 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-18-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 241 ms.
Product exploration explored 100000 steps with 50000 reset in 192 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 691 edges and 434 vertex of which 429 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-18-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-18-LTLFireability-00 finished in 61302 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 (p1&&X(p1)))))'
Support contains 2 out of 456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 570/570 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 448 transition count 562
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 448 transition count 562
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 442 transition count 556
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 442 transition count 556
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 442 transition count 555
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 440 transition count 553
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 440 transition count 553
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 439 transition count 552
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 439 transition count 552
Applied a total of 35 rules in 26 ms. Remains 439 /456 variables (removed 17) and now considering 552/570 (removed 18) transitions.
// Phase 1: matrix 552 rows 439 cols
[2024-06-02 20:42:15] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 20:42:15] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-06-02 20:42:15] [INFO ] Invariant cache hit.
[2024-06-02 20:42:15] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
Running 551 sub problems to find dead transitions.
[2024-06-02 20:42:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 1 (OVERLAPS) 1/439 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 3 (OVERLAPS) 552/991 variables, 439/443 constraints. Problems are: Problem set: 0 solved, 551 unsolved
[2024-06-02 20:42:32] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 5 ms to minimize.
[2024-06-02 20:42:32] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/991 variables, 2/445 constraints. Problems are: Problem set: 0 solved, 551 unsolved
(s315 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0timeout
)
(s316 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 991/991 variables, and 445 constraints, problems are : Problem set: 0 solved, 551 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 439/439 constraints, PredecessorRefiner: 551/551 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 551 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 1 (OVERLAPS) 1/439 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 4 (OVERLAPS) 552/991 variables, 439/445 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/991 variables, 551/996 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/991 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 551 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 timeout
0)
(s40 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 991/991 variables, and 996 constraints, problems are : Problem set: 0 solved, 551 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 439/439 constraints, PredecessorRefiner: 551/551 constraints, Known Traps: 2/2 constraints]
After SMT, in 60153ms problems are : Problem set: 0 solved, 551 unsolved
Search for dead transitions found 0 dead transitions in 60168ms
Starting structural reductions in LTL mode, iteration 1 : 439/456 places, 552/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60569 ms. Remains : 439/456 places, 552/570 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1), true]
Running random walk in product with property : CO4-PT-18-LTLFireability-01
Product exploration explored 100000 steps with 33333 reset in 133 ms.
Product exploration explored 100000 steps with 33333 reset in 188 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 696 edges and 439 vertex of which 434 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 168 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-18-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-18-LTLFireability-01 finished in 61272 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((p0 U X(p1)))))'
Support contains 2 out of 456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 570/570 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 448 transition count 562
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 448 transition count 562
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 443 transition count 557
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 443 transition count 557
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 443 transition count 556
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 440 transition count 553
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 440 transition count 553
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 438 transition count 551
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 438 transition count 551
Applied a total of 37 rules in 29 ms. Remains 438 /456 variables (removed 18) and now considering 551/570 (removed 19) transitions.
// Phase 1: matrix 551 rows 438 cols
[2024-06-02 20:43:16] [INFO ] Computed 4 invariants in 5 ms
[2024-06-02 20:43:16] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-06-02 20:43:16] [INFO ] Invariant cache hit.
[2024-06-02 20:43:16] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Running 550 sub problems to find dead transitions.
[2024-06-02 20:43:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 1 (OVERLAPS) 1/438 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 3 (OVERLAPS) 551/989 variables, 438/442 constraints. Problems are: Problem set: 0 solved, 550 unsolved
[2024-06-02 20:43:34] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 3 ms to minimize.
[2024-06-02 20:43:34] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/989 variables, 2/444 constraints. Problems are: Problem set: 0 solved, 550 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 989/989 variables, and 444 constraints, problems are : Problem set: 0 solved, 550 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 438/438 constraints, PredecessorRefiner: 550/550 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 550 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 1 (OVERLAPS) 1/438 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 4 (OVERLAPS) 551/989 variables, 438/444 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/989 variables, 550/994 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/989 variables, 0/994 constraints. Problems are: Problem set: 0 solved, 550 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 989/989 variables, and 994 constraints, problems are : Problem set: 0 solved, 550 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 438/438 constraints, PredecessorRefiner: 550/550 constraints, Known Traps: 2/2 constraints]
After SMT, in 60120ms problems are : Problem set: 0 solved, 550 unsolved
Search for dead transitions found 0 dead transitions in 60125ms
Starting structural reductions in LTL mode, iteration 1 : 438/456 places, 551/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60526 ms. Remains : 438/456 places, 551/570 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : CO4-PT-18-LTLFireability-03
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CO4-PT-18-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-18-LTLFireability-03 finished in 60738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 570/570 transitions.
Graph (trivial) has 488 edges and 456 vertex of which 3 / 456 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 716 edges and 454 vertex of which 449 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 201 place count 448 transition count 362
Reduce places removed 199 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 249 transition count 360
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 403 place count 248 transition count 360
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 403 place count 248 transition count 315
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 493 place count 203 transition count 315
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 496 place count 200 transition count 312
Iterating global reduction 3 with 3 rules applied. Total rules applied 499 place count 200 transition count 312
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 499 place count 200 transition count 311
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 501 place count 199 transition count 311
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 503 place count 197 transition count 309
Iterating global reduction 3 with 2 rules applied. Total rules applied 505 place count 197 transition count 309
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 507 place count 197 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 508 place count 196 transition count 307
Performed 73 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 654 place count 123 transition count 214
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 660 place count 123 transition count 208
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 667 place count 116 transition count 201
Iterating global reduction 6 with 7 rules applied. Total rules applied 674 place count 116 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 675 place count 116 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 679 place count 114 transition count 198
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 7 with 66 rules applied. Total rules applied 745 place count 81 transition count 200
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 765 place count 81 transition count 180
Discarding 27 places :
Symmetric choice reduction at 8 with 27 rule applications. Total rules 792 place count 54 transition count 126
Iterating global reduction 8 with 27 rules applied. Total rules applied 819 place count 54 transition count 126
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 837 place count 54 transition count 108
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 843 place count 48 transition count 91
Iterating global reduction 9 with 6 rules applied. Total rules applied 849 place count 48 transition count 91
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 854 place count 48 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 856 place count 47 transition count 96
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 10 with 15 rules applied. Total rules applied 871 place count 47 transition count 81
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 873 place count 45 transition count 79
Applied a total of 873 rules in 121 ms. Remains 45 /456 variables (removed 411) and now considering 79/570 (removed 491) transitions.
[2024-06-02 20:44:17] [INFO ] Flow matrix only has 72 transitions (discarded 7 similar events)
// Phase 1: matrix 72 rows 45 cols
[2024-06-02 20:44:17] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 20:44:17] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 20:44:17] [INFO ] Flow matrix only has 72 transitions (discarded 7 similar events)
[2024-06-02 20:44:17] [INFO ] Invariant cache hit.
[2024-06-02 20:44:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 20:44:17] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2024-06-02 20:44:17] [INFO ] Redundant transitions in 1 ms returned []
Running 66 sub problems to find dead transitions.
[2024-06-02 20:44:17] [INFO ] Flow matrix only has 72 transitions (discarded 7 similar events)
[2024-06-02 20:44:17] [INFO ] Invariant cache hit.
[2024-06-02 20:44:17] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 71/116 variables, 45/49 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 1/117 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/117 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 51 constraints, problems are : Problem set: 0 solved, 66 unsolved in 879 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 45/45 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 71/116 variables, 45/49 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 66/116 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 1/117 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 117 constraints, problems are : Problem set: 0 solved, 66 unsolved in 935 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 45/45 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
After SMT, in 1844ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 1845ms
Starting structural reductions in SI_LTL mode, iteration 1 : 45/456 places, 79/570 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2100 ms. Remains : 45/456 places, 79/570 transitions.
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CO4-PT-18-LTLFireability-04
Product exploration explored 100000 steps with 3 reset in 92 ms.
Product exploration explored 100000 steps with 56 reset in 85 ms.
Computed a total of 7 stabilizing places and 13 stable transitions
Computed a total of 7 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 77 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 1456 steps (151 resets) in 31 ms. (45 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 117 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 79/79 transitions.
Applied a total of 0 rules in 5 ms. Remains 45 /45 variables (removed 0) and now considering 79/79 (removed 0) transitions.
[2024-06-02 20:44:20] [INFO ] Flow matrix only has 72 transitions (discarded 7 similar events)
[2024-06-02 20:44:20] [INFO ] Invariant cache hit.
[2024-06-02 20:44:20] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-02 20:44:20] [INFO ] Flow matrix only has 72 transitions (discarded 7 similar events)
[2024-06-02 20:44:20] [INFO ] Invariant cache hit.
[2024-06-02 20:44:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 20:44:20] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-06-02 20:44:20] [INFO ] Redundant transitions in 2 ms returned []
Running 66 sub problems to find dead transitions.
[2024-06-02 20:44:20] [INFO ] Flow matrix only has 72 transitions (discarded 7 similar events)
[2024-06-02 20:44:20] [INFO ] Invariant cache hit.
[2024-06-02 20:44:20] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 71/116 variables, 45/49 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 1/117 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/117 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 51 constraints, problems are : Problem set: 0 solved, 66 unsolved in 817 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 45/45 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 71/116 variables, 45/49 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 66/116 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 1/117 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 117 constraints, problems are : Problem set: 0 solved, 66 unsolved in 836 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 45/45 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
After SMT, in 1674ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 1674ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1758 ms. Remains : 45/45 places, 79/79 transitions.
Computed a total of 7 stabilizing places and 13 stable transitions
Computed a total of 7 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 84 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 1330 steps (142 resets) in 22 ms. (57 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 98 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 41 reset in 54 ms.
Product exploration explored 100000 steps with 15 reset in 160 ms.
Support contains 2 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 79/79 transitions.
Applied a total of 0 rules in 2 ms. Remains 45 /45 variables (removed 0) and now considering 79/79 (removed 0) transitions.
[2024-06-02 20:44:22] [INFO ] Flow matrix only has 72 transitions (discarded 7 similar events)
[2024-06-02 20:44:22] [INFO ] Invariant cache hit.
[2024-06-02 20:44:22] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-02 20:44:22] [INFO ] Flow matrix only has 72 transitions (discarded 7 similar events)
[2024-06-02 20:44:22] [INFO ] Invariant cache hit.
[2024-06-02 20:44:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 20:44:22] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-06-02 20:44:22] [INFO ] Redundant transitions in 1 ms returned []
Running 66 sub problems to find dead transitions.
[2024-06-02 20:44:22] [INFO ] Flow matrix only has 72 transitions (discarded 7 similar events)
[2024-06-02 20:44:22] [INFO ] Invariant cache hit.
[2024-06-02 20:44:22] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 71/116 variables, 45/49 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 1/117 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/117 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 51 constraints, problems are : Problem set: 0 solved, 66 unsolved in 813 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 45/45 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 71/116 variables, 45/49 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 66/116 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 1/117 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 117 constraints, problems are : Problem set: 0 solved, 66 unsolved in 942 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 45/45 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
After SMT, in 1774ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 1775ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1873 ms. Remains : 45/45 places, 79/79 transitions.
Treatment of property CO4-PT-18-LTLFireability-04 finished in 7467 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((p0&&X(G(p1)))))))'
Support contains 2 out of 456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 570/570 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 447 transition count 561
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 447 transition count 561
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 441 transition count 555
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 441 transition count 555
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 441 transition count 554
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 439 transition count 552
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 439 transition count 552
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 437 transition count 550
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 437 transition count 550
Applied a total of 39 rules in 32 ms. Remains 437 /456 variables (removed 19) and now considering 550/570 (removed 20) transitions.
// Phase 1: matrix 550 rows 437 cols
[2024-06-02 20:44:24] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 20:44:24] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-02 20:44:24] [INFO ] Invariant cache hit.
[2024-06-02 20:44:25] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 549 sub problems to find dead transitions.
[2024-06-02 20:44:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (OVERLAPS) 1/437 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 3 (OVERLAPS) 550/987 variables, 437/441 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-06-02 20:44:41] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 3 ms to minimize.
[2024-06-02 20:44:41] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/987 variables, 2/443 constraints. Problems are: Problem set: 0 solved, 549 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 987/987 variables, and 443 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 549 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (OVERLAPS) 1/437 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/437 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 4 (OVERLAPS) 550/987 variables, 437/443 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/987 variables, 549/992 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/987 variables, 0/992 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 987/987 variables, and 992 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 2/2 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 549 unsolved
Search for dead transitions found 0 dead transitions in 60148ms
Starting structural reductions in LTL mode, iteration 1 : 437/456 places, 550/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60507 ms. Remains : 437/456 places, 550/570 transitions.
Stuttering acceptance computed with spot in 209 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-18-LTLFireability-06
Product exploration explored 100000 steps with 7 reset in 83 ms.
Product exploration explored 100000 steps with 45 reset in 86 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 694 edges and 437 vertex of which 432 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 72 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (81 resets) in 210 ms. (189 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (96 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (27 resets) in 154 ms. (258 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1308887 steps, run timeout after 3001 ms. (steps per millisecond=436 ) properties seen :1 out of 2
Probabilistic random walk after 1308887 steps, saw 254789 distinct states, run finished after 3004 ms. (steps per millisecond=435 ) properties seen :1
[2024-06-02 20:45:29] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/12 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 16/28 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 61/89 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 148/237 variables, 65/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/248 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/248 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 18/266 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 205/471 variables, 91/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/471 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 243/714 variables, 108/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/714 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 201/915 variables, 105/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/915 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 60/975 variables, 39/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/975 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 10/985 variables, 6/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/985 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/987 variables, 2/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/987 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/987 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 987/987 variables, and 441 constraints, problems are : Problem set: 0 solved, 1 unsolved in 261 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/12 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 16/28 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 61/89 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 148/237 variables, 65/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/248 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/248 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 18/266 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 205/471 variables, 91/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/471 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 243/714 variables, 108/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/714 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 201/915 variables, 105/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/915 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 60/975 variables, 39/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/975 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 10/985 variables, 6/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/985 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/987 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/987 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/987 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 987/987 variables, and 442 constraints, problems are : Problem set: 0 solved, 1 unsolved in 287 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 560ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 45 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=45 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 134 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 200 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Support contains 2 out of 437 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 437/437 places, 550/550 transitions.
Applied a total of 0 rules in 11 ms. Remains 437 /437 variables (removed 0) and now considering 550/550 (removed 0) transitions.
[2024-06-02 20:45:30] [INFO ] Invariant cache hit.
[2024-06-02 20:45:30] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 20:45:30] [INFO ] Invariant cache hit.
[2024-06-02 20:45:30] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Running 549 sub problems to find dead transitions.
[2024-06-02 20:45:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (OVERLAPS) 1/437 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 3 (OVERLAPS) 550/987 variables, 437/441 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-06-02 20:45:47] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 3 ms to minimize.
[2024-06-02 20:45:47] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/987 variables, 2/443 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 987/987 variables, and 443 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 549 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (OVERLAPS) 1/437 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/437 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 4 (OVERLAPS) 550/987 variables, 437/443 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/987 variables, 549/992 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/987 variables, 0/992 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 987/987 variables, and 992 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 2/2 constraints]
After SMT, in 60146ms problems are : Problem set: 0 solved, 549 unsolved
Search for dead transitions found 0 dead transitions in 60152ms
Finished structural reductions in LTL mode , in 1 iterations and 60465 ms. Remains : 437/437 places, 550/550 transitions.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 694 edges and 437 vertex of which 432 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (54 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (72 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (131 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1322871 steps, run timeout after 3001 ms. (steps per millisecond=440 ) properties seen :1 out of 2
Probabilistic random walk after 1322871 steps, saw 257202 distinct states, run finished after 3001 ms. (steps per millisecond=440 ) properties seen :1
[2024-06-02 20:46:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/12 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 16/28 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 61/89 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 148/237 variables, 65/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/248 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/248 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 18/266 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 205/471 variables, 91/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/471 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 243/714 variables, 108/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/714 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 201/915 variables, 105/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/915 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 60/975 variables, 39/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/975 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 10/985 variables, 6/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/985 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/987 variables, 2/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/987 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/987 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 987/987 variables, and 441 constraints, problems are : Problem set: 0 solved, 1 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/12 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 16/28 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 61/89 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 148/237 variables, 65/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/248 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/248 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 18/266 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 205/471 variables, 91/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/471 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 243/714 variables, 108/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/714 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 201/915 variables, 105/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/915 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 60/975 variables, 39/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/975 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 10/985 variables, 6/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/985 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/987 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/987 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/987 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 987/987 variables, and 442 constraints, problems are : Problem set: 0 solved, 1 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 561ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 45 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=45 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 123 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 204 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 208 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 39 reset in 80 ms.
Product exploration explored 100000 steps with 15 reset in 90 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 224 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Support contains 2 out of 437 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 437/437 places, 550/550 transitions.
Graph (trivial) has 469 edges and 437 vertex of which 3 / 437 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 692 edges and 435 vertex of which 430 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Performed 187 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 187 rules applied. Total rules applied 189 place count 430 transition count 542
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 190 place count 430 transition count 541
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 190 place count 430 transition count 542
Deduced a syphon composed of 193 places in 1 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 196 place count 430 transition count 542
Discarding 52 places :
Symmetric choice reduction at 2 with 52 rule applications. Total rules 248 place count 378 transition count 490
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 2 with 52 rules applied. Total rules applied 300 place count 378 transition count 490
Performed 89 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 2 with 89 rules applied. Total rules applied 389 place count 378 transition count 543
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 398 place count 378 transition count 534
Discarding 85 places :
Symmetric choice reduction at 3 with 85 rule applications. Total rules 483 place count 293 transition count 449
Deduced a syphon composed of 151 places in 0 ms
Iterating global reduction 3 with 85 rules applied. Total rules applied 568 place count 293 transition count 449
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 569 place count 292 transition count 448
Deduced a syphon composed of 150 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 570 place count 292 transition count 448
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 151 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 571 place count 292 transition count 448
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 573 place count 292 transition count 446
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 577 place count 288 transition count 442
Deduced a syphon composed of 148 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 581 place count 288 transition count 442
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 583 place count 286 transition count 439
Deduced a syphon composed of 147 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 585 place count 286 transition count 439
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 586 place count 286 transition count 438
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 587 place count 285 transition count 437
Deduced a syphon composed of 146 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 588 place count 285 transition count 437
Performed 57 Post agglomeration using F-continuation condition with reduction of 25 identical transitions.
Deduced a syphon composed of 203 places in 1 ms
Iterating global reduction 5 with 57 rules applied. Total rules applied 645 place count 285 transition count 674
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 5 with 54 rules applied. Total rules applied 699 place count 285 transition count 620
Discarding 92 places :
Symmetric choice reduction at 6 with 92 rule applications. Total rules 791 place count 193 transition count 415
Deduced a syphon composed of 137 places in 1 ms
Iterating global reduction 6 with 92 rules applied. Total rules applied 883 place count 193 transition count 415
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 6 with 35 rules applied. Total rules applied 918 place count 193 transition count 380
Discarding 61 places :
Symmetric choice reduction at 7 with 61 rule applications. Total rules 979 place count 132 transition count 276
Deduced a syphon composed of 81 places in 1 ms
Iterating global reduction 7 with 61 rules applied. Total rules applied 1040 place count 132 transition count 276
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1048 place count 132 transition count 268
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 1057 place count 123 transition count 251
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 8 with 9 rules applied. Total rules applied 1066 place count 123 transition count 251
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 1067 place count 123 transition count 276
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1077 place count 123 transition count 266
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1080 place count 120 transition count 248
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 1083 place count 120 transition count 248
Deduced a syphon composed of 70 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 1094 place count 120 transition count 237
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1095 place count 119 transition count 236
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1096 place count 119 transition count 236
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1097 place count 119 transition count 257
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1099 place count 117 transition count 241
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 1101 place count 117 transition count 241
Deduced a syphon composed of 68 places in 0 ms
Applied a total of 1101 rules in 134 ms. Remains 117 /437 variables (removed 320) and now considering 241/550 (removed 309) transitions.
[2024-06-02 20:46:36] [INFO ] Redundant transitions in 9 ms returned []
Running 240 sub problems to find dead transitions.
[2024-06-02 20:46:36] [INFO ] Flow matrix only has 234 transitions (discarded 7 similar events)
// Phase 1: matrix 234 rows 117 cols
[2024-06-02 20:46:36] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 20:46:36] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-02 20:46:37] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
[2024-06-02 20:46:37] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
[2024-06-02 20:46:37] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-06-02 20:46:37] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD98 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 4/8 constraints. Problems are: Problem set: 12 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/8 constraints. Problems are: Problem set: 12 solved, 228 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 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 TDEAD58 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 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 TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 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 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 TDEAD145 is UNSAT
Problem TDEAD146 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 TDEAD161 is UNSAT
Problem TDEAD162 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 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 TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 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 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
At refinement iteration 4 (OVERLAPS) 233/350 variables, 117/125 constraints. Problems are: Problem set: 157 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 11/136 constraints. Problems are: Problem set: 157 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/136 constraints. Problems are: Problem set: 157 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 1/351 variables, 1/137 constraints. Problems are: Problem set: 157 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 0/137 constraints. Problems are: Problem set: 157 solved, 83 unsolved
At refinement iteration 9 (OVERLAPS) 0/351 variables, 0/137 constraints. Problems are: Problem set: 157 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 137 constraints, problems are : Problem set: 157 solved, 83 unsolved in 4607 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 117/117 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 157 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 157 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 13/61 variables, 4/4 constraints. Problems are: Problem set: 157 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 4/8 constraints. Problems are: Problem set: 157 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/8 constraints. Problems are: Problem set: 157 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 219/280 variables, 61/69 constraints. Problems are: Problem set: 157 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 11/80 constraints. Problems are: Problem set: 157 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 83/163 constraints. Problems are: Problem set: 157 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/163 constraints. Problems are: Problem set: 157 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 70/350 variables, 56/219 constraints. Problems are: Problem set: 157 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 0/219 constraints. Problems are: Problem set: 157 solved, 83 unsolved
At refinement iteration 10 (OVERLAPS) 1/351 variables, 1/220 constraints. Problems are: Problem set: 157 solved, 83 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/351 variables, 0/220 constraints. Problems are: Problem set: 157 solved, 83 unsolved
At refinement iteration 12 (OVERLAPS) 0/351 variables, 0/220 constraints. Problems are: Problem set: 157 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 351/351 variables, and 220 constraints, problems are : Problem set: 157 solved, 83 unsolved in 3734 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 117/117 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 83/240 constraints, Known Traps: 4/4 constraints]
After SMT, in 8412ms problems are : Problem set: 157 solved, 83 unsolved
Search for dead transitions found 157 dead transitions in 8421ms
Found 157 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 157 transitions
Dead transitions reduction (with SMT) removed 157 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 117/437 places, 84/550 transitions.
Graph (complete) has 164 edges and 117 vertex of which 49 are kept as prefixes of interest. Removing 68 places using SCC suffix rule.1 ms
Discarding 68 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 49 transition count 99
Deduced a syphon composed of 1 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 14 place count 49 transition count 87
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 14 rules in 16 ms. Remains 49 /117 variables (removed 68) and now considering 87/84 (removed -3) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/437 places, 87/550 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8586 ms. Remains : 49/437 places, 87/550 transitions.
Support contains 2 out of 437 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 437/437 places, 550/550 transitions.
Applied a total of 0 rules in 12 ms. Remains 437 /437 variables (removed 0) and now considering 550/550 (removed 0) transitions.
// Phase 1: matrix 550 rows 437 cols
[2024-06-02 20:46:44] [INFO ] Computed 4 invariants in 4 ms
[2024-06-02 20:46:44] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 20:46:44] [INFO ] Invariant cache hit.
[2024-06-02 20:46:44] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Running 549 sub problems to find dead transitions.
[2024-06-02 20:46:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (OVERLAPS) 1/437 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 3 (OVERLAPS) 550/987 variables, 437/441 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-06-02 20:47:02] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-06-02 20:47:02] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/987 variables, 2/443 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 987/987 variables, and 443 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 549 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (OVERLAPS) 1/437 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/437 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 4 (OVERLAPS) 550/987 variables, 437/443 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/987 variables, 549/992 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/987 variables, 0/992 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 987/987 variables, and 992 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 2/2 constraints]
After SMT, in 60116ms problems are : Problem set: 0 solved, 549 unsolved
Search for dead transitions found 0 dead transitions in 60122ms
Finished structural reductions in LTL mode , in 1 iterations and 60451 ms. Remains : 437/437 places, 550/550 transitions.
Treatment of property CO4-PT-18-LTLFireability-06 finished in 200398 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 570/570 transitions.
Graph (trivial) has 490 edges and 456 vertex of which 3 / 456 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 716 edges and 454 vertex of which 449 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 203 place count 448 transition count 360
Reduce places removed 201 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 203 rules applied. Total rules applied 406 place count 247 transition count 358
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 407 place count 246 transition count 358
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 407 place count 246 transition count 313
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 497 place count 201 transition count 313
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 500 place count 198 transition count 310
Iterating global reduction 3 with 3 rules applied. Total rules applied 503 place count 198 transition count 310
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 503 place count 198 transition count 309
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 505 place count 197 transition count 309
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 507 place count 195 transition count 307
Iterating global reduction 3 with 2 rules applied. Total rules applied 509 place count 195 transition count 307
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 511 place count 195 transition count 305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 512 place count 194 transition count 305
Performed 73 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 658 place count 121 transition count 214
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 664 place count 121 transition count 208
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 671 place count 114 transition count 201
Iterating global reduction 6 with 7 rules applied. Total rules applied 678 place count 114 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 679 place count 114 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 683 place count 112 transition count 198
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 7 with 66 rules applied. Total rules applied 749 place count 79 transition count 200
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 770 place count 79 transition count 179
Discarding 28 places :
Symmetric choice reduction at 8 with 28 rule applications. Total rules 798 place count 51 transition count 123
Iterating global reduction 8 with 28 rules applied. Total rules applied 826 place count 51 transition count 123
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 844 place count 51 transition count 105
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 851 place count 44 transition count 85
Iterating global reduction 9 with 7 rules applied. Total rules applied 858 place count 44 transition count 85
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 863 place count 44 transition count 80
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 867 place count 42 transition count 105
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 10 with 20 rules applied. Total rules applied 887 place count 42 transition count 85
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 889 place count 40 transition count 83
Applied a total of 889 rules in 41 ms. Remains 40 /456 variables (removed 416) and now considering 83/570 (removed 487) transitions.
[2024-06-02 20:47:45] [INFO ] Flow matrix only has 73 transitions (discarded 10 similar events)
// Phase 1: matrix 73 rows 40 cols
[2024-06-02 20:47:45] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 20:47:45] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-06-02 20:47:45] [INFO ] Flow matrix only has 73 transitions (discarded 10 similar events)
[2024-06-02 20:47:45] [INFO ] Invariant cache hit.
[2024-06-02 20:47:45] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 20:47:45] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-06-02 20:47:45] [INFO ] Redundant transitions in 1 ms returned []
Running 70 sub problems to find dead transitions.
[2024-06-02 20:47:45] [INFO ] Flow matrix only has 73 transitions (discarded 10 similar events)
[2024-06-02 20:47:45] [INFO ] Invariant cache hit.
[2024-06-02 20:47:45] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 72/112 variables, 40/44 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (OVERLAPS) 1/113 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/113 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 47 constraints, problems are : Problem set: 0 solved, 70 unsolved in 860 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 40/40 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 72/112 variables, 40/44 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 70/116 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 1/113 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/113 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 117 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1032 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 40/40 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
After SMT, in 1917ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 1917ms
Starting structural reductions in SI_LTL mode, iteration 1 : 40/456 places, 83/570 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2173 ms. Remains : 40/456 places, 83/570 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-18-LTLFireability-07
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA CO4-PT-18-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-18-LTLFireability-07 finished in 2267 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 570/570 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 446 transition count 560
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 446 transition count 560
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 439 transition count 553
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 439 transition count 553
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 439 transition count 552
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 436 transition count 549
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 436 transition count 549
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 434 transition count 547
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 434 transition count 547
Applied a total of 45 rules in 43 ms. Remains 434 /456 variables (removed 22) and now considering 547/570 (removed 23) transitions.
// Phase 1: matrix 547 rows 434 cols
[2024-06-02 20:47:47] [INFO ] Computed 4 invariants in 7 ms
[2024-06-02 20:47:47] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 20:47:47] [INFO ] Invariant cache hit.
[2024-06-02 20:47:47] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 546 sub problems to find dead transitions.
[2024-06-02 20:47:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 1 (OVERLAPS) 1/434 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 3 (OVERLAPS) 547/981 variables, 434/438 constraints. Problems are: Problem set: 0 solved, 546 unsolved
[2024-06-02 20:48:04] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2024-06-02 20:48:04] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/981 variables, 2/440 constraints. Problems are: Problem set: 0 solved, 546 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 981/981 variables, and 440 constraints, problems are : Problem set: 0 solved, 546 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 434/434 constraints, PredecessorRefiner: 546/546 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 546 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 1 (OVERLAPS) 1/434 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 4 (OVERLAPS) 547/981 variables, 434/440 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/981 variables, 546/986 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/981 variables, 0/986 constraints. Problems are: Problem set: 0 solved, 546 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 981/981 variables, and 986 constraints, problems are : Problem set: 0 solved, 546 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 434/434 constraints, PredecessorRefiner: 546/546 constraints, Known Traps: 2/2 constraints]
After SMT, in 60103ms problems are : Problem set: 0 solved, 546 unsolved
Search for dead transitions found 0 dead transitions in 60108ms
Starting structural reductions in LTL mode, iteration 1 : 434/456 places, 547/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60473 ms. Remains : 434/456 places, 547/570 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-18-LTLFireability-08
Product exploration explored 100000 steps with 25 reset in 80 ms.
Product exploration explored 100000 steps with 17 reset in 74 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 691 edges and 434 vertex of which 429 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p0)]
RANDOM walk for 36770 steps (35 resets) in 41 ms. (875 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-18-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-18-LTLFireability-08 finished in 60977 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(p0))'
Support contains 2 out of 456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 570/570 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 446 transition count 560
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 446 transition count 560
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 439 transition count 553
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 439 transition count 553
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 439 transition count 552
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 436 transition count 549
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 436 transition count 549
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 434 transition count 547
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 434 transition count 547
Applied a total of 45 rules in 40 ms. Remains 434 /456 variables (removed 22) and now considering 547/570 (removed 23) transitions.
[2024-06-02 20:48:48] [INFO ] Invariant cache hit.
[2024-06-02 20:48:48] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 20:48:48] [INFO ] Invariant cache hit.
[2024-06-02 20:48:48] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 546 sub problems to find dead transitions.
[2024-06-02 20:48:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 1 (OVERLAPS) 1/434 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 3 (OVERLAPS) 547/981 variables, 434/438 constraints. Problems are: Problem set: 0 solved, 546 unsolved
[2024-06-02 20:49:05] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 3 ms to minimize.
[2024-06-02 20:49:05] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/981 variables, 2/440 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/981 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 546 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 981/981 variables, and 440 constraints, problems are : Problem set: 0 solved, 546 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 434/434 constraints, PredecessorRefiner: 546/546 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 546 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 1 (OVERLAPS) 1/434 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 4 (OVERLAPS) 547/981 variables, 434/440 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/981 variables, 546/986 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/981 variables, 0/986 constraints. Problems are: Problem set: 0 solved, 546 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 981/981 variables, and 986 constraints, problems are : Problem set: 0 solved, 546 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 434/434 constraints, PredecessorRefiner: 546/546 constraints, Known Traps: 2/2 constraints]
After SMT, in 60105ms problems are : Problem set: 0 solved, 546 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Starting structural reductions in LTL mode, iteration 1 : 434/456 places, 547/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60458 ms. Remains : 434/456 places, 547/570 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CO4-PT-18-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CO4-PT-18-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-18-LTLFireability-10 finished in 60559 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(p1&&X(F(p2)))))))'
Support contains 4 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 570/570 transitions.
Graph (trivial) has 481 edges and 456 vertex of which 3 / 456 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 716 edges and 454 vertex of which 449 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 202 place count 448 transition count 361
Reduce places removed 200 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 203 rules applied. Total rules applied 405 place count 248 transition count 358
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 407 place count 246 transition count 358
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 407 place count 246 transition count 314
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 495 place count 202 transition count 314
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 497 place count 200 transition count 312
Iterating global reduction 3 with 2 rules applied. Total rules applied 499 place count 200 transition count 312
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 499 place count 200 transition count 311
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 501 place count 199 transition count 311
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 502 place count 198 transition count 310
Iterating global reduction 3 with 1 rules applied. Total rules applied 503 place count 198 transition count 310
Performed 74 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 651 place count 124 transition count 216
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 657 place count 124 transition count 210
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 664 place count 117 transition count 203
Iterating global reduction 4 with 7 rules applied. Total rules applied 671 place count 117 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 672 place count 117 transition count 202
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 676 place count 115 transition count 200
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 740 place count 83 transition count 203
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 760 place count 83 transition count 183
Discarding 27 places :
Symmetric choice reduction at 6 with 27 rule applications. Total rules 787 place count 56 transition count 129
Iterating global reduction 6 with 27 rules applied. Total rules applied 814 place count 56 transition count 129
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 832 place count 56 transition count 111
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 839 place count 49 transition count 91
Iterating global reduction 7 with 7 rules applied. Total rules applied 846 place count 49 transition count 91
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 851 place count 49 transition count 86
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 855 place count 47 transition count 113
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 868 place count 47 transition count 100
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 870 place count 45 transition count 98
Applied a total of 870 rules in 47 ms. Remains 45 /456 variables (removed 411) and now considering 98/570 (removed 472) transitions.
[2024-06-02 20:49:48] [INFO ] Flow matrix only has 89 transitions (discarded 9 similar events)
// Phase 1: matrix 89 rows 45 cols
[2024-06-02 20:49:48] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 20:49:49] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-02 20:49:49] [INFO ] Flow matrix only has 89 transitions (discarded 9 similar events)
[2024-06-02 20:49:49] [INFO ] Invariant cache hit.
[2024-06-02 20:49:49] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 20:49:49] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-06-02 20:49:49] [INFO ] Redundant transitions in 1 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-02 20:49:49] [INFO ] Flow matrix only has 89 transitions (discarded 9 similar events)
[2024-06-02 20:49:49] [INFO ] Invariant cache hit.
[2024-06-02 20:49:49] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 88/132 variables, 44/48 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 1/133 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/134 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 0/134 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 53 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1422 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 45/45 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 88/132 variables, 44/48 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 24/75 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 1/133 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 65/141 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 1/134 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (OVERLAPS) 0/134 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 142 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1805 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 45/45 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints]
After SMT, in 3256ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 3256ms
Starting structural reductions in SI_LTL mode, iteration 1 : 45/456 places, 98/570 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3379 ms. Remains : 45/456 places, 98/570 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CO4-PT-18-LTLFireability-11
Product exploration explored 100000 steps with 4 reset in 61 ms.
Product exploration explored 100000 steps with 2 reset in 134 ms.
Computed a total of 7 stabilizing places and 23 stable transitions
Computed a total of 7 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 117 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 171 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false]
RANDOM walk for 40000 steps (3841 resets) in 743 ms. (53 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40003 steps (532 resets) in 249 ms. (160 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (383 resets) in 152 ms. (261 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (517 resets) in 159 ms. (250 steps per ms) remains 3/3 properties
[2024-06-02 20:49:53] [INFO ] Flow matrix only has 89 transitions (discarded 9 similar events)
[2024-06-02 20:49:53] [INFO ] Invariant cache hit.
[2024-06-02 20:49:53] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 31/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 50/85 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 40/125 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3/128 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/128 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 5/133 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/133 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/133 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1/134 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/134 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/134 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 53 constraints, problems are : Problem set: 0 solved, 3 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 45/45 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 31/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 50/85 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf1 is UNSAT
Problem apf3 is UNSAT
Problem apf5 is UNSAT
After SMT solving in domain Int declared 125/134 variables, and 41 constraints, problems are : Problem set: 3 solved, 0 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 0/4 constraints, State Equation: 40/45 constraints, ReadFeed: 1/4 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 135ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (G (OR p0 p1)), (G (OR p2 p0 (NOT p1))), (G (OR p2 p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p2)), (F (NOT (OR (NOT p2) p0 (NOT p1)))), (F (NOT p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 12 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-18-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-18-LTLFireability-11 finished in 4597 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(p0) U (F((p1&&X((p1 U (!p0||G(p1)))))) U p2))))'
Support contains 3 out of 456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 570/570 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 448 transition count 562
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 448 transition count 562
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 442 transition count 556
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 442 transition count 556
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 442 transition count 555
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 32 place count 439 transition count 552
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 439 transition count 552
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 437 transition count 550
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 437 transition count 550
Applied a total of 39 rules in 40 ms. Remains 437 /456 variables (removed 19) and now considering 550/570 (removed 20) transitions.
// Phase 1: matrix 550 rows 437 cols
[2024-06-02 20:49:53] [INFO ] Computed 4 invariants in 4 ms
[2024-06-02 20:49:53] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 20:49:53] [INFO ] Invariant cache hit.
[2024-06-02 20:49:53] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Running 549 sub problems to find dead transitions.
[2024-06-02 20:49:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (OVERLAPS) 1/437 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 3 (OVERLAPS) 550/987 variables, 437/441 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-06-02 20:50:11] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 3 ms to minimize.
[2024-06-02 20:50:11] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/987 variables, 2/443 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 987/987 variables, and 443 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 549 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (OVERLAPS) 1/437 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/437 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 4 (OVERLAPS) 550/987 variables, 437/443 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/987 variables, 549/992 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-06-02 20:50:40] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/987 variables, 1/993 constraints. Problems are: Problem set: 0 solved, 549 unsolved
(s24 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 987/987 variables, and 993 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 3/3 constraints]
After SMT, in 60135ms problems are : Problem set: 0 solved, 549 unsolved
Search for dead transitions found 0 dead transitions in 60146ms
Starting structural reductions in LTL mode, iteration 1 : 437/456 places, 550/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60502 ms. Remains : 437/456 places, 550/570 transitions.
Stuttering acceptance computed with spot in 262 ms :[(NOT p2), (NOT p2), (AND p2 (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) p0), (NOT p2)]
Running random walk in product with property : CO4-PT-18-LTLFireability-12
Product exploration explored 100000 steps with 16714 reset in 126 ms.
Product exploration explored 100000 steps with 16663 reset in 130 ms.
Computed a total of 16 stabilizing places and 19 stable transitions
Graph (complete) has 696 edges and 437 vertex of which 432 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 19 stable transitions
Detected a total of 16/437 stabilizing places and 19/550 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 184 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(NOT p2), (NOT p2), (AND p2 (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) p0), (NOT p2)]
RANDOM walk for 40000 steps (72 resets) in 692 ms. (57 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (112 resets) in 465 ms. (85 steps per ms) remains 7/12 properties
BEST_FIRST walk for 40001 steps (59 resets) in 349 ms. (114 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (41 resets) in 451 ms. (88 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (119 resets) in 179 ms. (222 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (90 resets) in 523 ms. (76 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (57 resets) in 271 ms. (147 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (69 resets) in 481 ms. (82 steps per ms) remains 7/7 properties
[2024-06-02 20:50:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 36/46 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 11/57 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 18/75 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/75 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 138/213 variables, 53/70 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 282/495 variables, 106/176 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/495 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 307/802 variables, 159/335 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/802 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 136/938 variables, 75/410 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/938 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 37/975 variables, 23/433 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/975 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 11/986 variables, 7/440 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/986 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (OVERLAPS) 1/987 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/987 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (OVERLAPS) 0/987 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 987/987 variables, and 441 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1096 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 36/46 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 11/57 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 18/75 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 138/213 variables, 53/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 282/495 variables, 106/183 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/495 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 307/802 variables, 159/342 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/802 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 136/938 variables, 75/417 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/938 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 37/975 variables, 23/440 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/975 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 11/986 variables, 7/447 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/986 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 1/987 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/987 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 0/987 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 987/987 variables, and 448 constraints, problems are : Problem set: 0 solved, 7 unsolved in 914 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 2018ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 6 properties in 264 ms.
Support contains 3 out of 437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 550/550 transitions.
Graph (trivial) has 467 edges and 437 vertex of which 3 / 437 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 693 edges and 435 vertex of which 420 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 193 transitions
Trivial Post-agglo rules discarded 193 transitions
Performed 193 trivial Post agglomeration. Transition count delta: 193
Iterating post reduction 0 with 211 rules applied. Total rules applied 213 place count 420 transition count 325
Reduce places removed 193 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 195 rules applied. Total rules applied 408 place count 227 transition count 323
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 410 place count 226 transition count 322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 411 place count 225 transition count 322
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 411 place count 225 transition count 276
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 503 place count 179 transition count 276
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 504 place count 178 transition count 275
Iterating global reduction 4 with 1 rules applied. Total rules applied 505 place count 178 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 506 place count 178 transition count 274
Performed 66 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 132 rules applied. Total rules applied 638 place count 112 transition count 192
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 644 place count 112 transition count 186
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 651 place count 105 transition count 179
Iterating global reduction 6 with 7 rules applied. Total rules applied 658 place count 105 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 659 place count 105 transition count 178
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 665 place count 102 transition count 175
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 669 place count 102 transition count 171
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 673 place count 98 transition count 167
Iterating global reduction 8 with 4 rules applied. Total rules applied 677 place count 98 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 678 place count 98 transition count 166
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 682 place count 96 transition count 164
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 684 place count 96 transition count 162
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 686 place count 94 transition count 160
Iterating global reduction 10 with 2 rules applied. Total rules applied 688 place count 94 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 689 place count 94 transition count 159
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 690 place count 93 transition count 158
Iterating global reduction 11 with 1 rules applied. Total rules applied 691 place count 93 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 692 place count 93 transition count 157
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 12 with 56 rules applied. Total rules applied 748 place count 65 transition count 159
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 12 with 36 rules applied. Total rules applied 784 place count 65 transition count 123
Discarding 25 places :
Symmetric choice reduction at 13 with 25 rule applications. Total rules 809 place count 40 transition count 87
Iterating global reduction 13 with 25 rules applied. Total rules applied 834 place count 40 transition count 87
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 13 with 20 rules applied. Total rules applied 854 place count 40 transition count 67
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 857 place count 37 transition count 59
Iterating global reduction 14 with 3 rules applied. Total rules applied 860 place count 37 transition count 59
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 862 place count 37 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 864 place count 36 transition count 65
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 867 place count 36 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 16 with 5 rules applied. Total rules applied 872 place count 36 transition count 57
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 873 place count 35 transition count 56
Iterating global reduction 16 with 1 rules applied. Total rules applied 874 place count 35 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 875 place count 35 transition count 55
Free-agglomeration rule applied 5 times.
Iterating global reduction 17 with 5 rules applied. Total rules applied 880 place count 35 transition count 50
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 7 rules applied. Total rules applied 887 place count 30 transition count 48
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 888 place count 30 transition count 48
Graph (complete) has 84 edges and 30 vertex of which 29 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 18 with 1 rules applied. Total rules applied 889 place count 29 transition count 48
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 890 place count 29 transition count 47
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 891 place count 29 transition count 47
Graph (complete) has 81 edges and 29 vertex of which 28 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 20 with 1 rules applied. Total rules applied 892 place count 28 transition count 47
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 893 place count 28 transition count 46
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 22 with 1 rules applied. Total rules applied 894 place count 28 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 895 place count 27 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 23 with 1 rules applied. Total rules applied 896 place count 26 transition count 44
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t61.t67.t509.t545 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 18 edges and 22 vertex of which 3 / 22 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 23 with 3 rules applied. Total rules applied 899 place count 20 transition count 42
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 24 with 5 rules applied. Total rules applied 904 place count 20 transition count 37
Discarding 1 places :
Symmetric choice reduction at 25 with 1 rule applications. Total rules 905 place count 19 transition count 36
Iterating global reduction 25 with 1 rules applied. Total rules applied 906 place count 19 transition count 36
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 907 place count 19 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 26 with 9 rules applied. Total rules applied 916 place count 19 transition count 26
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 918 place count 18 transition count 25
Discarding 1 places :
Symmetric choice reduction at 27 with 1 rule applications. Total rules 919 place count 17 transition count 24
Iterating global reduction 27 with 1 rules applied. Total rules applied 920 place count 17 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 921 place count 17 transition count 23
Discarding 1 places :
Symmetric choice reduction at 28 with 1 rule applications. Total rules 922 place count 16 transition count 22
Iterating global reduction 28 with 1 rules applied. Total rules applied 923 place count 16 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 28 with 1 rules applied. Total rules applied 924 place count 16 transition count 21
Free-agglomeration rule applied 3 times.
Iterating global reduction 29 with 3 rules applied. Total rules applied 927 place count 16 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 29 with 3 rules applied. Total rules applied 930 place count 13 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 30 with 2 rules applied. Total rules applied 932 place count 13 transition count 16
Free-agglomeration rule applied 2 times.
Iterating global reduction 30 with 2 rules applied. Total rules applied 934 place count 13 transition count 14
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 30 with 3 rules applied. Total rules applied 937 place count 11 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 31 with 1 rules applied. Total rules applied 938 place count 11 transition count 12
Free-agglomeration rule applied 1 times.
Iterating global reduction 31 with 1 rules applied. Total rules applied 939 place count 11 transition count 11
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 941 place count 10 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 32 with 2 rules applied. Total rules applied 943 place count 9 transition count 9
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 32 with 1 rules applied. Total rules applied 944 place count 9 transition count 8
Applied a total of 944 rules in 53 ms. Remains 9 /437 variables (removed 428) and now considering 8/550 (removed 542) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 9/437 places, 8/550 transitions.
RANDOM walk for 33340 steps (7 resets) in 21 ms. (1515 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (OR p2 p1))), (F (NOT (OR p0 p2 p1))), (F (NOT (AND (NOT p0) (NOT p2) p1))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F p2), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p2) p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 14 factoid took 628 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 321 ms :[(NOT p2), (NOT p2), (AND p2 (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) p0), (NOT p2)]
Stuttering acceptance computed with spot in 299 ms :[(NOT p2), (NOT p2), (AND p2 (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) p0), (NOT p2)]
[2024-06-02 20:51:00] [INFO ] Invariant cache hit.
[2024-06-02 20:51:00] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-06-02 20:51:00] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2024-06-02 20:51:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:51:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 20:51:00] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2024-06-02 20:51:00] [INFO ] Computed and/alt/rep : 540/745/540 causal constraints (skipped 9 transitions) in 25 ms.
[2024-06-02 20:51:04] [INFO ] Added : 508 causal constraints over 103 iterations in 3552 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 437 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 437/437 places, 550/550 transitions.
Applied a total of 0 rules in 7 ms. Remains 437 /437 variables (removed 0) and now considering 550/550 (removed 0) transitions.
[2024-06-02 20:51:04] [INFO ] Invariant cache hit.
[2024-06-02 20:51:04] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 20:51:04] [INFO ] Invariant cache hit.
[2024-06-02 20:51:04] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Running 549 sub problems to find dead transitions.
[2024-06-02 20:51:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (OVERLAPS) 1/437 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 3 (OVERLAPS) 550/987 variables, 437/441 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-06-02 20:51:21] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 3 ms to minimize.
[2024-06-02 20:51:21] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/987 variables, 2/443 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 987/987 variables, and 443 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 549 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (OVERLAPS) 1/437 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/437 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 4 (OVERLAPS) 550/987 variables, 437/443 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/987 variables, 549/992 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-06-02 20:51:51] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/987 variables, 1/993 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 987/987 variables, and 993 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 3/3 constraints]
After SMT, in 60121ms problems are : Problem set: 0 solved, 549 unsolved
Search for dead transitions found 0 dead transitions in 60126ms
Finished structural reductions in LTL mode , in 1 iterations and 60416 ms. Remains : 437/437 places, 550/550 transitions.
Computed a total of 16 stabilizing places and 19 stable transitions
Graph (complete) has 696 edges and 437 vertex of which 432 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 16 stabilizing places and 19 stable transitions
Detected a total of 16/437 stabilizing places and 19/550 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 198 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[(NOT p2), (NOT p2), (AND p2 (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) p0), (NOT p2)]
RANDOM walk for 40000 steps (57 resets) in 606 ms. (65 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (45 resets) in 598 ms. (66 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (97 resets) in 672 ms. (59 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (70 resets) in 317 ms. (125 steps per ms) remains 7/12 properties
BEST_FIRST walk for 40000 steps (74 resets) in 390 ms. (102 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (20 resets) in 478 ms. (83 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (111 resets) in 208 ms. (191 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (63 resets) in 350 ms. (113 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (110 resets) in 365 ms. (109 steps per ms) remains 7/7 properties
[2024-06-02 20:52:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 36/46 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 11/57 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 18/75 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/75 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 138/213 variables, 53/70 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 282/495 variables, 106/176 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/495 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 307/802 variables, 159/335 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/802 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 136/938 variables, 75/410 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/938 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 37/975 variables, 23/433 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/975 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 11/986 variables, 7/440 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/986 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (OVERLAPS) 1/987 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/987 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (OVERLAPS) 0/987 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 987/987 variables, and 441 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1189 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 36/46 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 11/57 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 18/75 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 138/213 variables, 53/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 282/495 variables, 106/183 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/495 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 307/802 variables, 159/342 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/802 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 136/938 variables, 75/417 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/938 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 37/975 variables, 23/440 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/975 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 11/986 variables, 7/447 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/986 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 1/987 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/987 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 0/987 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 987/987 variables, and 448 constraints, problems are : Problem set: 0 solved, 7 unsolved in 955 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 2150ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 6 properties in 225 ms.
Support contains 3 out of 437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 550/550 transitions.
Graph (trivial) has 467 edges and 437 vertex of which 3 / 437 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 693 edges and 435 vertex of which 420 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 193 transitions
Trivial Post-agglo rules discarded 193 transitions
Performed 193 trivial Post agglomeration. Transition count delta: 193
Iterating post reduction 0 with 211 rules applied. Total rules applied 213 place count 420 transition count 325
Reduce places removed 193 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 195 rules applied. Total rules applied 408 place count 227 transition count 323
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 410 place count 226 transition count 322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 411 place count 225 transition count 322
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 411 place count 225 transition count 276
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 503 place count 179 transition count 276
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 504 place count 178 transition count 275
Iterating global reduction 4 with 1 rules applied. Total rules applied 505 place count 178 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 506 place count 178 transition count 274
Performed 66 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 132 rules applied. Total rules applied 638 place count 112 transition count 192
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 644 place count 112 transition count 186
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 651 place count 105 transition count 179
Iterating global reduction 6 with 7 rules applied. Total rules applied 658 place count 105 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 659 place count 105 transition count 178
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 665 place count 102 transition count 175
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 669 place count 102 transition count 171
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 673 place count 98 transition count 167
Iterating global reduction 8 with 4 rules applied. Total rules applied 677 place count 98 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 678 place count 98 transition count 166
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 682 place count 96 transition count 164
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 684 place count 96 transition count 162
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 686 place count 94 transition count 160
Iterating global reduction 10 with 2 rules applied. Total rules applied 688 place count 94 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 689 place count 94 transition count 159
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 690 place count 93 transition count 158
Iterating global reduction 11 with 1 rules applied. Total rules applied 691 place count 93 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 692 place count 93 transition count 157
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 12 with 56 rules applied. Total rules applied 748 place count 65 transition count 159
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 12 with 36 rules applied. Total rules applied 784 place count 65 transition count 123
Discarding 25 places :
Symmetric choice reduction at 13 with 25 rule applications. Total rules 809 place count 40 transition count 87
Iterating global reduction 13 with 25 rules applied. Total rules applied 834 place count 40 transition count 87
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 13 with 20 rules applied. Total rules applied 854 place count 40 transition count 67
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 857 place count 37 transition count 59
Iterating global reduction 14 with 3 rules applied. Total rules applied 860 place count 37 transition count 59
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 862 place count 37 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 864 place count 36 transition count 65
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 867 place count 36 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 16 with 5 rules applied. Total rules applied 872 place count 36 transition count 57
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 873 place count 35 transition count 56
Iterating global reduction 16 with 1 rules applied. Total rules applied 874 place count 35 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 875 place count 35 transition count 55
Free-agglomeration rule applied 5 times.
Iterating global reduction 17 with 5 rules applied. Total rules applied 880 place count 35 transition count 50
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 7 rules applied. Total rules applied 887 place count 30 transition count 48
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 888 place count 30 transition count 48
Graph (complete) has 84 edges and 30 vertex of which 29 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 18 with 1 rules applied. Total rules applied 889 place count 29 transition count 48
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 890 place count 29 transition count 47
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 891 place count 29 transition count 47
Graph (complete) has 81 edges and 29 vertex of which 28 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 20 with 1 rules applied. Total rules applied 892 place count 28 transition count 47
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 893 place count 28 transition count 46
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 22 with 1 rules applied. Total rules applied 894 place count 28 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 895 place count 27 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 23 with 1 rules applied. Total rules applied 896 place count 26 transition count 44
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t61.t67.t509.t545 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 18 edges and 22 vertex of which 3 / 22 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 23 with 3 rules applied. Total rules applied 899 place count 20 transition count 42
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 24 with 5 rules applied. Total rules applied 904 place count 20 transition count 37
Discarding 1 places :
Symmetric choice reduction at 25 with 1 rule applications. Total rules 905 place count 19 transition count 36
Iterating global reduction 25 with 1 rules applied. Total rules applied 906 place count 19 transition count 36
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 907 place count 19 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 26 with 9 rules applied. Total rules applied 916 place count 19 transition count 26
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 918 place count 18 transition count 25
Discarding 1 places :
Symmetric choice reduction at 27 with 1 rule applications. Total rules 919 place count 17 transition count 24
Iterating global reduction 27 with 1 rules applied. Total rules applied 920 place count 17 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 921 place count 17 transition count 23
Discarding 1 places :
Symmetric choice reduction at 28 with 1 rule applications. Total rules 922 place count 16 transition count 22
Iterating global reduction 28 with 1 rules applied. Total rules applied 923 place count 16 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 28 with 1 rules applied. Total rules applied 924 place count 16 transition count 21
Free-agglomeration rule applied 3 times.
Iterating global reduction 29 with 3 rules applied. Total rules applied 927 place count 16 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 29 with 3 rules applied. Total rules applied 930 place count 13 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 30 with 2 rules applied. Total rules applied 932 place count 13 transition count 16
Free-agglomeration rule applied 2 times.
Iterating global reduction 30 with 2 rules applied. Total rules applied 934 place count 13 transition count 14
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 30 with 3 rules applied. Total rules applied 937 place count 11 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 31 with 1 rules applied. Total rules applied 938 place count 11 transition count 12
Free-agglomeration rule applied 1 times.
Iterating global reduction 31 with 1 rules applied. Total rules applied 939 place count 11 transition count 11
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 941 place count 10 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 32 with 2 rules applied. Total rules applied 943 place count 9 transition count 9
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 32 with 1 rules applied. Total rules applied 944 place count 9 transition count 8
Applied a total of 944 rules in 32 ms. Remains 9 /437 variables (removed 428) and now considering 8/550 (removed 542) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 9/437 places, 8/550 transitions.
RANDOM walk for 10012 steps (2 resets) in 9 ms. (1001 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (OR p2 p1))), (F (NOT (OR p0 p2 p1))), (F (NOT (AND (NOT p0) (NOT p2) p1))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F p2), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p2) p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 14 factoid took 689 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 321 ms :[(NOT p2), (NOT p2), (AND p2 (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) p0), (NOT p2)]
Stuttering acceptance computed with spot in 332 ms :[(NOT p2), (NOT p2), (AND p2 (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) p0), (NOT p2)]
[2024-06-02 20:52:10] [INFO ] Invariant cache hit.
[2024-06-02 20:52:10] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 20:52:10] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2024-06-02 20:52:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:52:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 20:52:11] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-06-02 20:52:11] [INFO ] Computed and/alt/rep : 540/745/540 causal constraints (skipped 9 transitions) in 30 ms.
[2024-06-02 20:52:14] [INFO ] Added : 508 causal constraints over 103 iterations in 3557 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 284 ms :[(NOT p2), (NOT p2), (AND p2 (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) p0), (NOT p2)]
Product exploration explored 100000 steps with 16667 reset in 144 ms.
Product exploration explored 100000 steps with 16649 reset in 153 ms.
Support contains 3 out of 437 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 437/437 places, 550/550 transitions.
Applied a total of 0 rules in 9 ms. Remains 437 /437 variables (removed 0) and now considering 550/550 (removed 0) transitions.
[2024-06-02 20:52:15] [INFO ] Invariant cache hit.
[2024-06-02 20:52:15] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 20:52:15] [INFO ] Invariant cache hit.
[2024-06-02 20:52:15] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 549 sub problems to find dead transitions.
[2024-06-02 20:52:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (OVERLAPS) 1/437 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 3 (OVERLAPS) 550/987 variables, 437/441 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-06-02 20:52:32] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 3 ms to minimize.
[2024-06-02 20:52:32] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/987 variables, 2/443 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 987/987 variables, and 443 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 549 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (OVERLAPS) 1/437 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/437 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 4 (OVERLAPS) 550/987 variables, 437/443 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/987 variables, 549/992 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-06-02 20:53:03] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/987 variables, 1/993 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 987/987 variables, and 993 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 3/3 constraints]
After SMT, in 60122ms problems are : Problem set: 0 solved, 549 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Finished structural reductions in LTL mode , in 1 iterations and 60461 ms. Remains : 437/437 places, 550/550 transitions.
Treatment of property CO4-PT-18-LTLFireability-12 finished in 202459 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||G(p1)))))'
Support contains 2 out of 456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 570/570 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 447 transition count 561
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 447 transition count 561
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 441 transition count 555
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 441 transition count 555
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 441 transition count 554
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 438 transition count 551
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 438 transition count 551
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 436 transition count 549
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 436 transition count 549
Applied a total of 41 rules in 41 ms. Remains 436 /456 variables (removed 20) and now considering 549/570 (removed 21) transitions.
// Phase 1: matrix 549 rows 436 cols
[2024-06-02 20:53:16] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 20:53:16] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 20:53:16] [INFO ] Invariant cache hit.
[2024-06-02 20:53:16] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
Running 548 sub problems to find dead transitions.
[2024-06-02 20:53:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (OVERLAPS) 549/985 variables, 436/440 constraints. Problems are: Problem set: 0 solved, 548 unsolved
[2024-06-02 20:53:33] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 3 ms to minimize.
[2024-06-02 20:53:33] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/985 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)timeout
(s294 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 985/985 variables, and 442 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 4 (OVERLAPS) 549/985 variables, 436/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/985 variables, 548/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/985 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 985/985 variables, and 990 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints]
After SMT, in 60115ms problems are : Problem set: 0 solved, 548 unsolved
Search for dead transitions found 0 dead transitions in 60120ms
Starting structural reductions in LTL mode, iteration 1 : 436/456 places, 549/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60465 ms. Remains : 436/456 places, 549/570 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-18-LTLFireability-13
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 0 ms.
FORMULA CO4-PT-18-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-18-LTLFireability-13 finished in 60566 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1))))'
Support contains 2 out of 456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 570/570 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 446 transition count 560
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 446 transition count 560
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 439 transition count 553
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 439 transition count 553
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 439 transition count 552
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 436 transition count 549
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 436 transition count 549
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 434 transition count 547
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 434 transition count 547
Applied a total of 45 rules in 31 ms. Remains 434 /456 variables (removed 22) and now considering 547/570 (removed 23) transitions.
// Phase 1: matrix 547 rows 434 cols
[2024-06-02 20:54:16] [INFO ] Computed 4 invariants in 5 ms
[2024-06-02 20:54:16] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 20:54:16] [INFO ] Invariant cache hit.
[2024-06-02 20:54:16] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Running 546 sub problems to find dead transitions.
[2024-06-02 20:54:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 1 (OVERLAPS) 1/434 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 3 (OVERLAPS) 547/981 variables, 434/438 constraints. Problems are: Problem set: 0 solved, 546 unsolved
[2024-06-02 20:54:34] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 3 ms to minimize.
[2024-06-02 20:54:34] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/981 variables, 2/440 constraints. Problems are: Problem set: 0 solved, 546 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 981/981 variables, and 440 constraints, problems are : Problem set: 0 solved, 546 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 434/434 constraints, PredecessorRefiner: 546/546 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 546 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 1 (OVERLAPS) 1/434 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 4 (OVERLAPS) 547/981 variables, 434/440 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/981 variables, 546/986 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/981 variables, 0/986 constraints. Problems are: Problem set: 0 solved, 546 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 981/981 variables, and 986 constraints, problems are : Problem set: 0 solved, 546 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 434/434 constraints, PredecessorRefiner: 546/546 constraints, Known Traps: 2/2 constraints]
After SMT, in 60120ms problems are : Problem set: 0 solved, 546 unsolved
Search for dead transitions found 0 dead transitions in 60126ms
Starting structural reductions in LTL mode, iteration 1 : 434/456 places, 547/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60471 ms. Remains : 434/456 places, 547/570 transitions.
Stuttering acceptance computed with spot in 67 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CO4-PT-18-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 144 ms.
Product exploration explored 100000 steps with 50000 reset in 147 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 691 edges and 434 vertex of which 429 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 112 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-18-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-18-LTLFireability-14 finished in 60964 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
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((p0&&X(G(p1)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0) U (F((p1&&X((p1 U (!p0||G(p1)))))) U p2))))'
[2024-06-02 20:55:17] [INFO ] Flatten gal took : 23 ms
[2024-06-02 20:55:17] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-02 20:55:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 456 places, 570 transitions and 1280 arcs took 11 ms.
Total runtime 851551 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running CO4-PT-18
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: 456
TRANSITIONS: 570
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.002s]
SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.001s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1890
MODEL NAME: /home/mcc/execution/413/model
456 places, 570 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.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA CO4-PT-18-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CO4-PT-18-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CO4-PT-18-LTLFireability-04 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1717362192666
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CO4-PT-18"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is CO4-PT-18, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r549-tall-171734897900140"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-18.tgz
mv CO4-PT-18 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;