About the Execution of GreatSPN+red for ParamProductionCell-PT-4
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3654.779 | 827805.00 | 1001214.00 | 2886.80 | FFFTFFFFT?TFFTFF | 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.r267-smll-171654405600044.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 ParamProductionCell-PT-4, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654405600044
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 20:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Apr 12 20:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 20:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 20:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 174K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-00
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-01
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-02
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-03
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-04
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-05
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-06
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-07
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-08
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-09
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-10
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-11
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-12
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-13
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-14
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716651147589
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 15:32:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 15:32:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:32:30] [INFO ] Load time of PNML (sax parser for PT used): 206 ms
[2024-05-25 15:32:30] [INFO ] Transformed 231 places.
[2024-05-25 15:32:30] [INFO ] Transformed 202 transitions.
[2024-05-25 15:32:30] [INFO ] Found NUPN structural information;
[2024-05-25 15:32:30] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 611 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ParamProductionCell-PT-4-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 227 transition count 198
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 227 transition count 198
Applied a total of 8 rules in 71 ms. Remains 227 /231 variables (removed 4) and now considering 198/202 (removed 4) transitions.
// Phase 1: matrix 198 rows 227 cols
[2024-05-25 15:32:30] [INFO ] Computed 59 invariants in 30 ms
[2024-05-25 15:32:31] [INFO ] Implicit Places using invariants in 876 ms returned [16, 18, 24, 35, 36, 41, 42, 46, 47, 59, 64, 73, 79, 113, 118, 119, 161, 163, 165, 166, 192, 193, 196, 197, 207, 218]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 928 ms to find 26 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 201/231 places, 198/202 transitions.
Applied a total of 0 rules in 23 ms. Remains 201 /201 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1053 ms. Remains : 201/231 places, 198/202 transitions.
Support contains 51 out of 201 places after structural reductions.
[2024-05-25 15:32:32] [INFO ] Flatten gal took : 88 ms
[2024-05-25 15:32:32] [INFO ] Flatten gal took : 37 ms
[2024-05-25 15:32:32] [INFO ] Input system was already deterministic with 198 transitions.
Reduction of identical properties reduced properties to check from 31 to 30
RANDOM walk for 40000 steps (8 resets) in 2364 ms. (16 steps per ms) remains 2/30 properties
BEST_FIRST walk for 40003 steps (8 resets) in 484 ms. (82 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 257 ms. (155 steps per ms) remains 1/2 properties
// Phase 1: matrix 198 rows 201 cols
[2024-05-25 15:32:33] [INFO ] Computed 33 invariants in 6 ms
[2024-05-25 15:32:33] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 96/101 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/130 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 15/145 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/159 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 9/168 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/169 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/169 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp2 is UNSAT
After SMT solving in domain Real declared 182/399 variables, and 25 constraints, problems are : Problem set: 1 solved, 0 unsolved in 255 ms.
Refiners :[Positive P Invariants (semi-flows): 15/23 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/201 constraints, ReadFeed: 0/68 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 313ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA ParamProductionCell-PT-4-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G(p1))))'
Support contains 4 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 199 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 199 transition count 196
Applied a total of 4 rules in 12 ms. Remains 199 /201 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 199 cols
[2024-05-25 15:32:34] [INFO ] Computed 33 invariants in 4 ms
[2024-05-25 15:32:34] [INFO ] Implicit Places using invariants in 336 ms returned [15, 17, 28, 54, 66, 85, 86, 88, 100, 102, 176, 177]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 339 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/201 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 20 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2024-05-25 15:32:34] [INFO ] Computed 21 invariants in 2 ms
[2024-05-25 15:32:34] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-25 15:32:34] [INFO ] Invariant cache hit.
[2024-05-25 15:32:34] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:32:35] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 691 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/201 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1062 ms. Remains : 185/201 places, 194/198 transitions.
Stuttering acceptance computed with spot in 473 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-01
Entered a terminal (fully accepting) state of product in 69 steps with 0 reset in 5 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-01 finished in 1645 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||(G(p2)&&p1))) U X(p3)))'
Support contains 6 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 199 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 199 transition count 196
Applied a total of 4 rules in 19 ms. Remains 199 /201 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 199 cols
[2024-05-25 15:32:35] [INFO ] Computed 33 invariants in 6 ms
[2024-05-25 15:32:35] [INFO ] Implicit Places using invariants in 222 ms returned [15, 17, 28, 54, 66, 85, 86, 100, 143, 176, 177]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 225 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/201 places, 196/198 transitions.
Applied a total of 0 rules in 6 ms. Remains 188 /188 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 250 ms. Remains : 188/201 places, 196/198 transitions.
Stuttering acceptance computed with spot in 377 ms :[(NOT p3), (NOT p3), (AND p0 (NOT p2) (NOT p3)), (NOT p3), true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-02 finished in 658 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 199 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 199 transition count 196
Applied a total of 4 rules in 11 ms. Remains 199 /201 variables (removed 2) and now considering 196/198 (removed 2) transitions.
[2024-05-25 15:32:36] [INFO ] Invariant cache hit.
[2024-05-25 15:32:36] [INFO ] Implicit Places using invariants in 288 ms returned [15, 17, 28, 54, 66, 85, 86, 88, 102, 143, 176, 177]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 290 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/201 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 11 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2024-05-25 15:32:36] [INFO ] Computed 21 invariants in 2 ms
[2024-05-25 15:32:36] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-25 15:32:36] [INFO ] Invariant cache hit.
[2024-05-25 15:32:37] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:32:37] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/201 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 979 ms. Remains : 185/201 places, 194/198 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-03
Product exploration explored 100000 steps with 1578 reset in 508 ms.
Product exploration explored 100000 steps with 1544 reset in 356 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 242 steps (0 resets) in 7 ms. (30 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
[2024-05-25 15:32:38] [INFO ] Invariant cache hit.
[2024-05-25 15:32:38] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-25 15:32:38] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-25 15:32:39] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2024-05-25 15:32:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:32:39] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-25 15:32:39] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-25 15:32:39] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2024-05-25 15:32:39] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:32:39] [INFO ] [Nat]Added 68 Read/Feed constraints in 26 ms returned sat
[2024-05-25 15:32:39] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 9 ms to minimize.
[2024-05-25 15:32:39] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 3 ms to minimize.
[2024-05-25 15:32:39] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-25 15:32:40] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 2 ms to minimize.
[2024-05-25 15:32:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 449 ms
[2024-05-25 15:32:40] [INFO ] Computed and/alt/rep : 190/309/190 causal constraints (skipped 0 transitions) in 22 ms.
[2024-05-25 15:32:41] [INFO ] Added : 144 causal constraints over 29 iterations in 963 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 185 transition count 159
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 150 transition count 159
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 70 place count 150 transition count 145
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 98 place count 136 transition count 145
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 7 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 178 place count 96 transition count 105
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 2 with 4 rules applied. Total rules applied 182 place count 94 transition count 103
Applied a total of 182 rules in 67 ms. Remains 94 /185 variables (removed 91) and now considering 103/194 (removed 91) transitions.
// Phase 1: matrix 103 rows 94 cols
[2024-05-25 15:32:41] [INFO ] Computed 21 invariants in 1 ms
[2024-05-25 15:32:41] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-25 15:32:41] [INFO ] Invariant cache hit.
[2024-05-25 15:32:41] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:32:41] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2024-05-25 15:32:41] [INFO ] Redundant transitions in 4 ms returned []
Running 100 sub problems to find dead transitions.
[2024-05-25 15:32:41] [INFO ] Invariant cache hit.
[2024-05-25 15:32:41] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:32:42] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 2 ms to minimize.
[2024-05-25 15:32:42] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 2 ms to minimize.
[2024-05-25 15:32:42] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:32:42] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 2 ms to minimize.
[2024-05-25 15:32:42] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 2 ms to minimize.
[2024-05-25 15:32:42] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:32:42] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 2 ms to minimize.
[2024-05-25 15:32:42] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-05-25 15:32:42] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 2 ms to minimize.
[2024-05-25 15:32:42] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:32:42] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:32:42] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:32:42] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:32:42] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-25 15:32:42] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 2 ms to minimize.
[2024-05-25 15:32:42] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 2 ms to minimize.
[2024-05-25 15:32:43] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 2 ms to minimize.
[2024-05-25 15:32:43] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 2 ms to minimize.
[2024-05-25 15:32:43] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:32:43] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:32:43] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-25 15:32:43] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 2 ms to minimize.
[2024-05-25 15:32:43] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:32:43] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:32:43] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:32:43] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:32:43] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:32:43] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:32:43] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:32:43] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 2 ms to minimize.
[2024-05-25 15:32:43] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 6 ms to minimize.
[2024-05-25 15:32:43] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:32:43] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:32:44] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 14/53 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:32:44] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 2 ms to minimize.
[2024-05-25 15:32:44] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 1/93 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:32:45] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:32:45] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-05-25 15:32:45] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 1/94 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:32:46] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:32:46] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 2 ms to minimize.
[2024-05-25 15:32:46] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/94 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/94 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 13 (OVERLAPS) 103/197 variables, 94/157 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/197 variables, 66/223 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/197 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 16 (OVERLAPS) 0/197 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 223 constraints, problems are : Problem set: 0 solved, 100 unsolved in 8337 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 39/58 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:32:50] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:32:50] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:32:51] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
[2024-05-25 15:32:51] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:32:52] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:32:52] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 1/93 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/93 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:32:53] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/93 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/93 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 13 (OVERLAPS) 1/94 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/94 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 15 (OVERLAPS) 103/197 variables, 94/164 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/197 variables, 66/230 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/197 variables, 100/330 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/197 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 19 (OVERLAPS) 0/197 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 330 constraints, problems are : Problem set: 0 solved, 100 unsolved in 8243 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 49/49 constraints]
After SMT, in 16660ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 16667ms
Starting structural reductions in SI_LTL mode, iteration 1 : 94/185 places, 103/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17127 ms. Remains : 94/185 places, 103/194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 132 steps (0 resets) in 5 ms. (22 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
[2024-05-25 15:32:58] [INFO ] Invariant cache hit.
[2024-05-25 15:32:58] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2024-05-25 15:32:58] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-25 15:32:59] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2024-05-25 15:32:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:32:59] [INFO ] [Nat]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-05-25 15:32:59] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-25 15:32:59] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2024-05-25 15:32:59] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:32:59] [INFO ] [Nat]Added 66 Read/Feed constraints in 10 ms returned sat
[2024-05-25 15:32:59] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 3 ms to minimize.
[2024-05-25 15:32:59] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 2 ms to minimize.
[2024-05-25 15:32:59] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 2 ms to minimize.
[2024-05-25 15:32:59] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 2 ms to minimize.
[2024-05-25 15:32:59] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 2 ms to minimize.
[2024-05-25 15:32:59] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-25 15:32:59] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 467 ms
[2024-05-25 15:32:59] [INFO ] Computed and/alt/rep : 100/220/100 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-25 15:33:00] [INFO ] Added : 83 causal constraints over 17 iterations in 263 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2951 reset in 252 ms.
Product exploration explored 100000 steps with 2941 reset in 535 ms.
Support contains 2 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 103/103 transitions.
Applied a total of 0 rules in 6 ms. Remains 94 /94 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-05-25 15:33:00] [INFO ] Invariant cache hit.
[2024-05-25 15:33:00] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-25 15:33:00] [INFO ] Invariant cache hit.
[2024-05-25 15:33:01] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:33:01] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2024-05-25 15:33:01] [INFO ] Redundant transitions in 2 ms returned []
Running 100 sub problems to find dead transitions.
[2024-05-25 15:33:01] [INFO ] Invariant cache hit.
[2024-05-25 15:33:01] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:33:01] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-25 15:33:01] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 2 ms to minimize.
[2024-05-25 15:33:01] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-25 15:33:01] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-25 15:33:01] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 3 ms to minimize.
[2024-05-25 15:33:01] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-25 15:33:01] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:33:01] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:33:01] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:33:02] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:33:02] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:33:02] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:33:02] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:33:02] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:33:02] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:33:02] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:33:02] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:33:02] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:33:02] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 2 ms to minimize.
[2024-05-25 15:33:02] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:33:02] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:33:02] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:33:02] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 2 ms to minimize.
[2024-05-25 15:33:02] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:33:02] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:33:02] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:33:02] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:33:02] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:33:02] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:33:02] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:33:03] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:33:03] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:33:03] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-25 15:33:03] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 14/53 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:33:03] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:33:03] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 1/93 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:33:04] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-25 15:33:04] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-05-25 15:33:04] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 1/94 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:33:05] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:33:06] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-25 15:33:06] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/94 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/94 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 13 (OVERLAPS) 103/197 variables, 94/157 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/197 variables, 66/223 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/197 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 16 (OVERLAPS) 0/197 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 223 constraints, problems are : Problem set: 0 solved, 100 unsolved in 8194 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 39/58 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:33:09] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:33:10] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:33:10] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-25 15:33:10] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:33:11] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:33:11] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 1/93 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/93 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:33:12] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/93 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/93 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 13 (OVERLAPS) 1/94 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/94 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 15 (OVERLAPS) 103/197 variables, 94/164 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/197 variables, 66/230 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/197 variables, 100/330 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/197 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 19 (OVERLAPS) 0/197 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 330 constraints, problems are : Problem set: 0 solved, 100 unsolved in 7268 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 49/49 constraints]
After SMT, in 15491ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 15494ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15811 ms. Remains : 94/94 places, 103/103 transitions.
Treatment of property ParamProductionCell-PT-4-LTLFireability-03 finished in 40449 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)||G((!p0&&X((F(!p1)||G(!p0))))))))'
Support contains 3 out of 201 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 200 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 200 transition count 197
Applied a total of 2 rules in 8 ms. Remains 200 /201 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 200 cols
[2024-05-25 15:33:16] [INFO ] Computed 33 invariants in 1 ms
[2024-05-25 15:33:17] [INFO ] Implicit Places using invariants in 216 ms returned [15, 17, 28, 54, 66, 86, 88, 100, 102, 143, 177, 178]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 220 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/201 places, 197/198 transitions.
Applied a total of 0 rules in 3 ms. Remains 188 /188 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 234 ms. Remains : 188/201 places, 197/198 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, p0, (NOT p0), false, false]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-05
Entered a terminal (fully accepting) state of product in 8531 steps with 0 reset in 17 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-05 finished in 444 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 198/198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 201 transition count 173
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 176 transition count 173
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 50 place count 176 transition count 159
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 78 place count 162 transition count 159
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 80 place count 160 transition count 157
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 160 transition count 157
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 134 place count 134 transition count 131
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 2 with 2 rules applied. Total rules applied 136 place count 133 transition count 130
Applied a total of 136 rules in 40 ms. Remains 133 /201 variables (removed 68) and now considering 130/198 (removed 68) transitions.
// Phase 1: matrix 130 rows 133 cols
[2024-05-25 15:33:17] [INFO ] Computed 33 invariants in 2 ms
[2024-05-25 15:33:17] [INFO ] Implicit Places using invariants in 148 ms returned [9, 10, 17, 33, 40, 51, 52, 66, 68, 98, 121, 122]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 151 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/201 places, 130/198 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 121 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 120 transition count 129
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 120 transition count 128
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 119 transition count 128
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 42 place count 100 transition count 109
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 99 transition count 108
Applied a total of 44 rules in 17 ms. Remains 99 /121 variables (removed 22) and now considering 108/130 (removed 22) transitions.
// Phase 1: matrix 108 rows 99 cols
[2024-05-25 15:33:17] [INFO ] Computed 21 invariants in 1 ms
[2024-05-25 15:33:17] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-25 15:33:17] [INFO ] Invariant cache hit.
[2024-05-25 15:33:17] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:33:17] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/201 places, 108/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 523 ms. Remains : 99/201 places, 108/198 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 174 ms.
Stack based approach found an accepted trace after 111 steps with 0 reset with depth 112 and stack size 112 in 1 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-06 finished in 748 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 198/198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 201 transition count 172
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 175 transition count 172
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 52 place count 175 transition count 158
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 80 place count 161 transition count 158
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 159 transition count 156
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 159 transition count 156
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 132 place count 135 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 134 place count 134 transition count 131
Applied a total of 134 rules in 25 ms. Remains 134 /201 variables (removed 67) and now considering 131/198 (removed 67) transitions.
// Phase 1: matrix 131 rows 134 cols
[2024-05-25 15:33:18] [INFO ] Computed 33 invariants in 2 ms
[2024-05-25 15:33:18] [INFO ] Implicit Places using invariants in 156 ms returned [9, 10, 17, 41, 52, 53, 55, 67, 69, 99, 122, 123]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 158 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/201 places, 131/198 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 0 with 1 rules applied. Total rules applied 1 place count 122 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 121 transition count 130
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 121 transition count 127
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 118 transition count 127
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 116 transition count 125
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 116 transition count 125
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 66 place count 89 transition count 98
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 2 with 2 rules applied. Total rules applied 68 place count 88 transition count 97
Applied a total of 68 rules in 17 ms. Remains 88 /122 variables (removed 34) and now considering 97/131 (removed 34) transitions.
// Phase 1: matrix 97 rows 88 cols
[2024-05-25 15:33:18] [INFO ] Computed 21 invariants in 1 ms
[2024-05-25 15:33:18] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-25 15:33:18] [INFO ] Invariant cache hit.
[2024-05-25 15:33:18] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:33:18] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 88/201 places, 97/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 528 ms. Remains : 88/201 places, 97/198 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 132 ms.
Stack based approach found an accepted trace after 283 steps with 0 reset with depth 284 and stack size 284 in 2 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-07 finished in 712 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 199 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 199 transition count 196
Applied a total of 4 rules in 6 ms. Remains 199 /201 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 199 cols
[2024-05-25 15:33:18] [INFO ] Computed 33 invariants in 2 ms
[2024-05-25 15:33:18] [INFO ] Implicit Places using invariants in 216 ms returned [15, 17, 28, 54, 66, 85, 86, 88, 100, 102, 143, 176]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 218 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/201 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 6 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2024-05-25 15:33:18] [INFO ] Computed 21 invariants in 2 ms
[2024-05-25 15:33:19] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-25 15:33:19] [INFO ] Invariant cache hit.
[2024-05-25 15:33:19] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:33:19] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/201 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 756 ms. Remains : 185/201 places, 194/198 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-08
Product exploration explored 100000 steps with 664 reset in 115 ms.
Product exploration explored 100000 steps with 671 reset in 142 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 546 steps (0 resets) in 6 ms. (78 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-25 15:33:20] [INFO ] Invariant cache hit.
[2024-05-25 15:33:20] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2024-05-25 15:33:20] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-25 15:33:20] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2024-05-25 15:33:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:33:20] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2024-05-25 15:33:20] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-25 15:33:21] [INFO ] [Nat]Absence check using state equation in 541 ms returned sat
[2024-05-25 15:33:21] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:33:21] [INFO ] [Nat]Added 68 Read/Feed constraints in 35 ms returned sat
[2024-05-25 15:33:21] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 2 ms to minimize.
[2024-05-25 15:33:21] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 2 ms to minimize.
[2024-05-25 15:33:21] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 2 ms to minimize.
[2024-05-25 15:33:21] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 3 ms to minimize.
[2024-05-25 15:33:22] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 2 ms to minimize.
[2024-05-25 15:33:22] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 3 ms to minimize.
[2024-05-25 15:33:22] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:33:22] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 2 ms to minimize.
[2024-05-25 15:33:22] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 3 ms to minimize.
[2024-05-25 15:33:22] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 2 ms to minimize.
[2024-05-25 15:33:22] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-25 15:33:22] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 2 ms to minimize.
[2024-05-25 15:33:22] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 2 ms to minimize.
[2024-05-25 15:33:23] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 3 ms to minimize.
[2024-05-25 15:33:23] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 2 ms to minimize.
[2024-05-25 15:33:23] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 3 ms to minimize.
[2024-05-25 15:33:23] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 3 ms to minimize.
[2024-05-25 15:33:23] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 2 ms to minimize.
[2024-05-25 15:33:23] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 2 ms to minimize.
[2024-05-25 15:33:23] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:33:24] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 2 ms to minimize.
[2024-05-25 15:33:24] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 2 ms to minimize.
[2024-05-25 15:33:24] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 2 ms to minimize.
[2024-05-25 15:33:24] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-25 15:33:24] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 2 ms to minimize.
[2024-05-25 15:33:24] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-25 15:33:24] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 3121 ms
[2024-05-25 15:33:24] [INFO ] Computed and/alt/rep : 190/309/190 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-25 15:33:26] [INFO ] Added : 163 causal constraints over 33 iterations in 2016 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Applied a total of 0 rules in 4 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2024-05-25 15:33:26] [INFO ] Invariant cache hit.
[2024-05-25 15:33:26] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-25 15:33:26] [INFO ] Invariant cache hit.
[2024-05-25 15:33:27] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:33:27] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2024-05-25 15:33:27] [INFO ] Invariant cache hit.
[2024-05-25 15:33:27] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-25 15:33:28] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 2 ms to minimize.
[2024-05-25 15:33:28] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:33:28] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 2 ms to minimize.
[2024-05-25 15:33:28] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:33:28] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:33:28] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-25 15:33:28] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-25 15:33:29] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 2 ms to minimize.
[2024-05-25 15:33:29] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:33:29] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 3 ms to minimize.
[2024-05-25 15:33:29] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 2 ms to minimize.
[2024-05-25 15:33:29] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 2 ms to minimize.
[2024-05-25 15:33:29] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-25 15:33:29] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 2 ms to minimize.
[2024-05-25 15:33:29] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 2 ms to minimize.
[2024-05-25 15:33:29] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 2 ms to minimize.
[2024-05-25 15:33:29] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 2 ms to minimize.
[2024-05-25 15:33:29] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 2 ms to minimize.
[2024-05-25 15:33:29] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 2 ms to minimize.
[2024-05-25 15:33:30] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-25 15:33:30] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-25 15:33:30] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:33:30] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-25 15:33:31] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-25 15:33:34] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 4/184 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-25 15:33:37] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 2 ms to minimize.
[2024-05-25 15:33:37] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-25 15:33:37] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:33:37] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:33:37] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:33:37] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:33:37] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:33:37] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:33:37] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:33:38] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 2 ms to minimize.
[2024-05-25 15:33:38] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 5 ms to minimize.
[2024-05-25 15:33:38] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-25 15:33:38] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 2 ms to minimize.
[2024-05-25 15:33:38] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 2 ms to minimize.
[2024-05-25 15:33:38] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-05-25 15:33:38] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 2 ms to minimize.
[2024-05-25 15:33:39] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 2 ms to minimize.
[2024-05-25 15:33:39] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 2 ms to minimize.
[2024-05-25 15:33:39] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 2 ms to minimize.
[2024-05-25 15:33:39] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-25 15:33:40] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 2 ms to minimize.
[2024-05-25 15:33:40] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 2 ms to minimize.
[2024-05-25 15:33:41] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 2 ms to minimize.
[2024-05-25 15:33:41] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-25 15:33:41] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-25 15:33:43] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:33:43] [INFO ] Deduced a trap composed of 53 places in 87 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 12 (OVERLAPS) 1/185 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/185 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 14 (OVERLAPS) 194/379 variables, 185/258 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/379 variables, 68/326 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/379 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 (/ 1.0 16.0))
(s1 (/ 7.0 8.0))
(s2 (/ 15.0 16.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 1.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 1.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 (/ 1.0 16.0))
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 (/ 1.0 16.0))
(s42 0.0)
(s43 (/ 7.0 8.0))
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.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 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 379/379 variables, and 326 constraints, problems are : Problem set: 0 solved, 190 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 185/185 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 44/59 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-25 15:33:59] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 4/184 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (OVERLAPS) 1/185 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-25 15:34:02] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (OVERLAPS) 194/379 variables, 185/260 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 68/328 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/379 variables, 190/518 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/379 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 15 (OVERLAPS) 0/379 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 518 constraints, problems are : Problem set: 0 solved, 190 unsolved in 22351 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 185/185 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 54/54 constraints]
After SMT, in 52414ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 52418ms
Finished structural reductions in LTL mode , in 1 iterations and 53016 ms. Remains : 185/185 places, 194/194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 611 steps (0 resets) in 6 ms. (87 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-25 15:34:20] [INFO ] Invariant cache hit.
[2024-05-25 15:34:20] [INFO ] [Real]Absence check using 19 positive place invariants in 16 ms returned sat
[2024-05-25 15:34:20] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-25 15:34:20] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2024-05-25 15:34:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:34:20] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-25 15:34:20] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-25 15:34:21] [INFO ] [Nat]Absence check using state equation in 537 ms returned sat
[2024-05-25 15:34:21] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:34:21] [INFO ] [Nat]Added 68 Read/Feed constraints in 45 ms returned sat
[2024-05-25 15:34:21] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 3 ms to minimize.
[2024-05-25 15:34:21] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-05-25 15:34:21] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 2 ms to minimize.
[2024-05-25 15:34:22] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 2 ms to minimize.
[2024-05-25 15:34:22] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 2 ms to minimize.
[2024-05-25 15:34:22] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 2 ms to minimize.
[2024-05-25 15:34:22] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:34:22] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 2 ms to minimize.
[2024-05-25 15:34:22] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 2 ms to minimize.
[2024-05-25 15:34:22] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 2 ms to minimize.
[2024-05-25 15:34:22] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-25 15:34:22] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 2 ms to minimize.
[2024-05-25 15:34:23] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 2 ms to minimize.
[2024-05-25 15:34:23] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 2 ms to minimize.
[2024-05-25 15:34:23] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-05-25 15:34:23] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 2 ms to minimize.
[2024-05-25 15:34:23] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-05-25 15:34:23] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2024-05-25 15:34:23] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 2 ms to minimize.
[2024-05-25 15:34:23] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:34:23] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-25 15:34:24] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 2 ms to minimize.
[2024-05-25 15:34:24] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 2 ms to minimize.
[2024-05-25 15:34:24] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
[2024-05-25 15:34:24] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 2 ms to minimize.
[2024-05-25 15:34:24] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 3 ms to minimize.
[2024-05-25 15:34:24] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 3029 ms
[2024-05-25 15:34:24] [INFO ] Computed and/alt/rep : 190/309/190 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-25 15:34:25] [INFO ] Added : 163 causal constraints over 33 iterations in 1344 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 665 reset in 193 ms.
Product exploration explored 100000 steps with 669 reset in 225 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 185 transition count 194
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 34 place count 185 transition count 196
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 48 place count 185 transition count 196
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 58 place count 175 transition count 185
Deduced a syphon composed of 38 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 68 place count 175 transition count 185
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 110 place count 175 transition count 185
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 133 place count 152 transition count 162
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 156 place count 152 transition count 162
Deduced a syphon composed of 57 places in 1 ms
Applied a total of 156 rules in 61 ms. Remains 152 /185 variables (removed 33) and now considering 162/194 (removed 32) transitions.
[2024-05-25 15:34:27] [INFO ] Redundant transitions in 10 ms returned []
Running 159 sub problems to find dead transitions.
// Phase 1: matrix 162 rows 152 cols
[2024-05-25 15:34:27] [INFO ] Computed 21 invariants in 2 ms
[2024-05-25 15:34:27] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-25 15:34:28] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-25 15:34:28] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 2 ms to minimize.
[2024-05-25 15:34:28] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
[2024-05-25 15:34:28] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 2 ms to minimize.
[2024-05-25 15:34:28] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
[2024-05-25 15:34:28] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-25 15:34:28] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
[2024-05-25 15:34:28] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
[2024-05-25 15:34:28] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 2 ms to minimize.
[2024-05-25 15:34:28] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-25 15:34:29] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 2 ms to minimize.
[2024-05-25 15:34:29] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
[2024-05-25 15:34:29] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-25 15:34:29] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 2 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-05-25 15:34:29] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-05-25 15:34:29] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
[2024-05-25 15:34:29] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 2 ms to minimize.
[2024-05-25 15:34:29] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 3 ms to minimize.
Problem TDEAD95 is UNSAT
[2024-05-25 15:34:29] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
Problem TDEAD97 is UNSAT
[2024-05-25 15:34:29] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 20/36 constraints. Problems are: Problem set: 43 solved, 116 unsolved
[2024-05-25 15:34:29] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:34:29] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
[2024-05-25 15:34:29] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:34:30] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 2 ms to minimize.
[2024-05-25 15:34:30] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:34:30] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 2 ms to minimize.
[2024-05-25 15:34:30] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 2 ms to minimize.
[2024-05-25 15:34:30] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-05-25 15:34:30] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 2 ms to minimize.
[2024-05-25 15:34:30] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-25 15:34:30] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 2 ms to minimize.
[2024-05-25 15:34:30] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 12/48 constraints. Problems are: Problem set: 43 solved, 116 unsolved
[2024-05-25 15:34:31] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 1/49 constraints. Problems are: Problem set: 43 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/49 constraints. Problems are: Problem set: 43 solved, 116 unsolved
At refinement iteration 5 (OVERLAPS) 3/151 variables, 3/52 constraints. Problems are: Problem set: 43 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 1/53 constraints. Problems are: Problem set: 43 solved, 116 unsolved
[2024-05-25 15:34:32] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
[2024-05-25 15:34:33] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
[2024-05-25 15:34:33] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-25 15:34:33] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:34:33] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-25 15:34:33] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-25 15:34:33] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:34:33] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 2 ms to minimize.
[2024-05-25 15:34:33] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 2 ms to minimize.
[2024-05-25 15:34:33] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 2 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-05-25 15:34:33] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 3 ms to minimize.
[2024-05-25 15:34:33] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 2 ms to minimize.
[2024-05-25 15:34:33] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 2 ms to minimize.
[2024-05-25 15:34:33] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-25 15:34:34] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 2 ms to minimize.
Problem TDEAD74 is UNSAT
Problem TDEAD84 is UNSAT
[2024-05-25 15:34:34] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 2 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD92 is UNSAT
[2024-05-25 15:34:34] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
[2024-05-25 15:34:34] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-25 15:34:34] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
Problem TDEAD105 is UNSAT
Problem TDEAD113 is UNSAT
[2024-05-25 15:34:34] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD113 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 20/73 constraints. Problems are: Problem set: 58 solved, 101 unsolved
[2024-05-25 15:34:34] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:34:34] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 2/75 constraints. Problems are: Problem set: 58 solved, 101 unsolved
[2024-05-25 15:34:35] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 2 ms to minimize.
[2024-05-25 15:34:35] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 2 ms to minimize.
[2024-05-25 15:34:35] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 3/78 constraints. Problems are: Problem set: 58 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 0/78 constraints. Problems are: Problem set: 58 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 1/152 variables, 1/79 constraints. Problems are: Problem set: 58 solved, 101 unsolved
[2024-05-25 15:34:37] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/152 variables, 1/80 constraints. Problems are: Problem set: 58 solved, 101 unsolved
[2024-05-25 15:34:38] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/152 variables, 1/81 constraints. Problems are: Problem set: 58 solved, 101 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/152 variables, 0/81 constraints. Problems are: Problem set: 58 solved, 101 unsolved
At refinement iteration 15 (OVERLAPS) 162/314 variables, 152/233 constraints. Problems are: Problem set: 58 solved, 101 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/314 variables, 68/301 constraints. Problems are: Problem set: 58 solved, 101 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/314 variables, 0/301 constraints. Problems are: Problem set: 58 solved, 101 unsolved
At refinement iteration 18 (OVERLAPS) 0/314 variables, 0/301 constraints. Problems are: Problem set: 58 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 301 constraints, problems are : Problem set: 58 solved, 101 unsolved in 16277 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 152/152 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 58 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 11/11 constraints. Problems are: Problem set: 58 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 47/58 constraints. Problems are: Problem set: 58 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/58 constraints. Problems are: Problem set: 58 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 60/151 variables, 8/66 constraints. Problems are: Problem set: 58 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 1/67 constraints. Problems are: Problem set: 58 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 13/80 constraints. Problems are: Problem set: 58 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/80 constraints. Problems are: Problem set: 58 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 1/152 variables, 1/81 constraints. Problems are: Problem set: 58 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 0/81 constraints. Problems are: Problem set: 58 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 162/314 variables, 152/233 constraints. Problems are: Problem set: 58 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 68/301 constraints. Problems are: Problem set: 58 solved, 101 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/314 variables, 101/402 constraints. Problems are: Problem set: 58 solved, 101 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 0/402 constraints. Problems are: Problem set: 58 solved, 101 unsolved
At refinement iteration 13 (OVERLAPS) 0/314 variables, 0/402 constraints. Problems are: Problem set: 58 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 402 constraints, problems are : Problem set: 58 solved, 101 unsolved in 7206 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 152/152 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 101/159 constraints, Known Traps: 60/60 constraints]
After SMT, in 23549ms problems are : Problem set: 58 solved, 101 unsolved
Search for dead transitions found 58 dead transitions in 23554ms
Found 58 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 58 transitions
Dead transitions reduction (with SMT) removed 58 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 152/185 places, 104/194 transitions.
Graph (complete) has 309 edges and 152 vertex of which 95 are kept as prefixes of interest. Removing 57 places using SCC suffix rule.2 ms
Discarding 57 places :
Also discarding 0 output transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 95 transition count 104
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 95 transition count 104
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 4 rules in 13 ms. Remains 95 /152 variables (removed 57) and now considering 104/104 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 95/185 places, 104/194 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 23649 ms. Remains : 95/185 places, 104/194 transitions.
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Applied a total of 0 rules in 3 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
// Phase 1: matrix 194 rows 185 cols
[2024-05-25 15:34:50] [INFO ] Computed 21 invariants in 2 ms
[2024-05-25 15:34:50] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-25 15:34:50] [INFO ] Invariant cache hit.
[2024-05-25 15:34:50] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:34:51] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2024-05-25 15:34:51] [INFO ] Invariant cache hit.
[2024-05-25 15:34:51] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-25 15:34:52] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-25 15:34:52] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:34:52] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:34:52] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 2 ms to minimize.
[2024-05-25 15:34:52] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:34:52] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:34:52] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 2 ms to minimize.
[2024-05-25 15:34:52] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 3 ms to minimize.
[2024-05-25 15:34:53] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2024-05-25 15:34:53] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 2 ms to minimize.
[2024-05-25 15:34:53] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 2 ms to minimize.
[2024-05-25 15:34:53] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 2 ms to minimize.
[2024-05-25 15:34:53] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-05-25 15:34:53] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 2 ms to minimize.
[2024-05-25 15:34:53] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 2 ms to minimize.
[2024-05-25 15:34:53] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 2 ms to minimize.
[2024-05-25 15:34:53] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 2 ms to minimize.
[2024-05-25 15:34:53] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 2 ms to minimize.
[2024-05-25 15:34:53] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 2 ms to minimize.
[2024-05-25 15:34:54] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-25 15:34:54] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 2 ms to minimize.
[2024-05-25 15:34:54] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-05-25 15:34:54] [INFO ] Deduced a trap composed of 63 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-25 15:34:55] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-25 15:34:57] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 4/184 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-25 15:35:01] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 2 ms to minimize.
[2024-05-25 15:35:01] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-25 15:35:01] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:35:01] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:35:01] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:35:01] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:35:01] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 2 ms to minimize.
[2024-05-25 15:35:02] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:35:02] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:35:02] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 2 ms to minimize.
[2024-05-25 15:35:02] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 2 ms to minimize.
[2024-05-25 15:35:02] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-05-25 15:35:02] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 2 ms to minimize.
[2024-05-25 15:35:02] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 3 ms to minimize.
[2024-05-25 15:35:02] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-25 15:35:03] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 2 ms to minimize.
[2024-05-25 15:35:03] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 2 ms to minimize.
[2024-05-25 15:35:03] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 2 ms to minimize.
[2024-05-25 15:35:03] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:35:04] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-25 15:35:04] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 2 ms to minimize.
[2024-05-25 15:35:05] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 3 ms to minimize.
[2024-05-25 15:35:05] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 2 ms to minimize.
[2024-05-25 15:35:05] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 2 ms to minimize.
[2024-05-25 15:35:05] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-25 15:35:07] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-25 15:35:08] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 12 (OVERLAPS) 1/185 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/185 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 14 (OVERLAPS) 194/379 variables, 185/258 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/379 variables, 68/326 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/379 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 379/379 variables, and 326 constraints, problems are : Problem set: 0 solved, 190 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 185/185 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 44/59 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-25 15:35:22] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 4/184 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (OVERLAPS) 1/185 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-25 15:35:27] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (OVERLAPS) 194/379 variables, 185/260 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 68/328 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/379 variables, 190/518 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/379 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 15 (OVERLAPS) 0/379 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 518 constraints, problems are : Problem set: 0 solved, 190 unsolved in 21284 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 185/185 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 54/54 constraints]
After SMT, in 51332ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 51335ms
Finished structural reductions in LTL mode , in 1 iterations and 51825 ms. Remains : 185/185 places, 194/194 transitions.
Treatment of property ParamProductionCell-PT-4-LTLFireability-08 finished in 143827 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 4 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 198/198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 201 transition count 172
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 175 transition count 172
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 52 place count 175 transition count 158
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 80 place count 161 transition count 158
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 159 transition count 156
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 159 transition count 156
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 136 place count 133 transition count 130
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 2 with 2 rules applied. Total rules applied 138 place count 132 transition count 129
Applied a total of 138 rules in 35 ms. Remains 132 /201 variables (removed 69) and now considering 129/198 (removed 69) transitions.
// Phase 1: matrix 129 rows 132 cols
[2024-05-25 15:35:42] [INFO ] Computed 33 invariants in 2 ms
[2024-05-25 15:35:42] [INFO ] Implicit Places using invariants in 309 ms returned [9, 10, 17, 32, 39, 50, 51, 53, 65, 67, 97, 121]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 310 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/201 places, 129/198 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 0 with 1 rules applied. Total rules applied 1 place count 120 transition count 128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 119 transition count 128
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 119 transition count 125
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 116 transition count 125
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 114 transition count 123
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 114 transition count 123
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 64 place count 88 transition count 97
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 2 with 2 rules applied. Total rules applied 66 place count 87 transition count 96
Applied a total of 66 rules in 23 ms. Remains 87 /120 variables (removed 33) and now considering 96/129 (removed 33) transitions.
// Phase 1: matrix 96 rows 87 cols
[2024-05-25 15:35:42] [INFO ] Computed 21 invariants in 1 ms
[2024-05-25 15:35:43] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-25 15:35:43] [INFO ] Invariant cache hit.
[2024-05-25 15:35:43] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:35:43] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 87/201 places, 96/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 862 ms. Remains : 87/201 places, 96/198 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-09
Product exploration explored 100000 steps with 1356 reset in 124 ms.
Product exploration explored 100000 steps with 1346 reset in 220 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 127 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 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 3738 steps (1 resets) in 19 ms. (186 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 194 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 167 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-25 15:35:44] [INFO ] Invariant cache hit.
[2024-05-25 15:35:44] [INFO ] [Real]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-05-25 15:35:44] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-25 15:35:44] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2024-05-25 15:35:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:35:45] [INFO ] [Nat]Absence check using 18 positive place invariants in 12 ms returned sat
[2024-05-25 15:35:45] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-25 15:35:45] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2024-05-25 15:35:45] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:35:45] [INFO ] [Nat]Added 66 Read/Feed constraints in 38 ms returned sat
[2024-05-25 15:35:45] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 2 ms to minimize.
[2024-05-25 15:35:45] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 2 ms to minimize.
[2024-05-25 15:35:45] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 2 ms to minimize.
[2024-05-25 15:35:45] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-25 15:35:45] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 2 ms to minimize.
[2024-05-25 15:35:45] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 2 ms to minimize.
[2024-05-25 15:35:45] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 2 ms to minimize.
[2024-05-25 15:35:45] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 2 ms to minimize.
[2024-05-25 15:35:46] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-25 15:35:46] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-25 15:35:46] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:35:46] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-25 15:35:46] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:35:46] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 2 ms to minimize.
[2024-05-25 15:35:46] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 2 ms to minimize.
[2024-05-25 15:35:46] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 2 ms to minimize.
[2024-05-25 15:35:46] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-25 15:35:46] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-25 15:35:46] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-25 15:35:46] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:35:46] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:35:46] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 1418 ms
[2024-05-25 15:35:46] [INFO ] Computed and/alt/rep : 93/219/93 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-25 15:35:47] [INFO ] Added : 81 causal constraints over 17 iterations in 306 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 96/96 transitions.
Applied a total of 0 rules in 8 ms. Remains 87 /87 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-25 15:35:47] [INFO ] Invariant cache hit.
[2024-05-25 15:35:47] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-25 15:35:47] [INFO ] Invariant cache hit.
[2024-05-25 15:35:47] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:35:47] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
[2024-05-25 15:35:47] [INFO ] Redundant transitions in 3 ms returned []
Running 93 sub problems to find dead transitions.
[2024-05-25 15:35:47] [INFO ] Invariant cache hit.
[2024-05-25 15:35:47] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-25 15:35:48] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 2 ms to minimize.
[2024-05-25 15:35:48] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
[2024-05-25 15:35:48] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:35:48] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-25 15:35:48] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:35:48] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:35:48] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:35:48] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-25 15:35:48] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:35:48] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:35:48] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 3 ms to minimize.
[2024-05-25 15:35:48] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:35:48] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:35:48] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-25 15:35:48] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 2 ms to minimize.
[2024-05-25 15:35:48] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-25 15:35:48] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:35:48] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 2 ms to minimize.
[2024-05-25 15:35:49] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 2 ms to minimize.
[2024-05-25 15:35:49] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-25 15:35:49] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 2 ms to minimize.
[2024-05-25 15:35:49] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-05-25 15:35:49] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 2 ms to minimize.
[2024-05-25 15:35:49] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-25 15:35:49] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:35:49] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:35:49] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 2 ms to minimize.
[2024-05-25 15:35:49] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 2 ms to minimize.
[2024-05-25 15:35:49] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:35:49] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 2 ms to minimize.
[2024-05-25 15:35:49] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:35:49] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:35:49] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:35:50] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:35:50] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 2 ms to minimize.
[2024-05-25 15:35:50] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 16/55 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (OVERLAPS) 2/87 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-25 15:35:50] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:35:51] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:35:51] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:35:51] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 2 ms to minimize.
[2024-05-25 15:35:51] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-25 15:35:51] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-25 15:35:52] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (OVERLAPS) 96/183 variables, 87/151 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 66/217 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 12 (OVERLAPS) 0/183 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 217 constraints, problems are : Problem set: 0 solved, 93 unsolved in 8408 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 41/60 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 2/87 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 96/183 variables, 87/151 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 66/217 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 93/310 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-25 15:35:59] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/183 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 13 (OVERLAPS) 0/183 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 311 constraints, problems are : Problem set: 0 solved, 93 unsolved in 5872 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 44/44 constraints]
After SMT, in 14317ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 14320ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14874 ms. Remains : 87/87 places, 96/96 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 106 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 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 4537 steps (0 resets) in 22 ms. (197 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 171 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 139 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-25 15:36:02] [INFO ] Invariant cache hit.
[2024-05-25 15:36:02] [INFO ] [Real]Absence check using 18 positive place invariants in 12 ms returned sat
[2024-05-25 15:36:02] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-25 15:36:02] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2024-05-25 15:36:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:36:03] [INFO ] [Nat]Absence check using 18 positive place invariants in 10 ms returned sat
[2024-05-25 15:36:03] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 15:36:03] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2024-05-25 15:36:03] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:36:03] [INFO ] [Nat]Added 66 Read/Feed constraints in 37 ms returned sat
[2024-05-25 15:36:03] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-05-25 15:36:03] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-25 15:36:03] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-25 15:36:03] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 2 ms to minimize.
[2024-05-25 15:36:03] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
[2024-05-25 15:36:03] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 2 ms to minimize.
[2024-05-25 15:36:03] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
[2024-05-25 15:36:03] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-25 15:36:03] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 2 ms to minimize.
[2024-05-25 15:36:03] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 2 ms to minimize.
[2024-05-25 15:36:03] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 2 ms to minimize.
[2024-05-25 15:36:04] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 2 ms to minimize.
[2024-05-25 15:36:04] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:36:04] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
[2024-05-25 15:36:04] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-25 15:36:04] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-25 15:36:04] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-25 15:36:04] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 6 ms to minimize.
[2024-05-25 15:36:04] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2024-05-25 15:36:04] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:36:04] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:36:04] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 1488 ms
[2024-05-25 15:36:04] [INFO ] Computed and/alt/rep : 93/219/93 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-25 15:36:04] [INFO ] Added : 81 causal constraints over 17 iterations in 213 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1345 reset in 122 ms.
Product exploration explored 100000 steps with 1354 reset in 180 ms.
Support contains 4 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 96/96 transitions.
Applied a total of 0 rules in 7 ms. Remains 87 /87 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-25 15:36:05] [INFO ] Invariant cache hit.
[2024-05-25 15:36:05] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-25 15:36:05] [INFO ] Invariant cache hit.
[2024-05-25 15:36:05] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:36:05] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
[2024-05-25 15:36:05] [INFO ] Redundant transitions in 3 ms returned []
Running 93 sub problems to find dead transitions.
[2024-05-25 15:36:05] [INFO ] Invariant cache hit.
[2024-05-25 15:36:05] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-25 15:36:06] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-05-25 15:36:06] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-05-25 15:36:06] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:36:06] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:36:06] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:36:06] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:36:06] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-25 15:36:06] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
[2024-05-25 15:36:06] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-25 15:36:06] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:36:07] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:36:07] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-25 15:36:07] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:36:07] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 2 ms to minimize.
[2024-05-25 15:36:07] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 2 ms to minimize.
[2024-05-25 15:36:07] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:36:07] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:36:07] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:36:07] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-25 15:36:07] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-25 15:36:07] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 2 ms to minimize.
[2024-05-25 15:36:07] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-25 15:36:07] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 2 ms to minimize.
[2024-05-25 15:36:07] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:36:07] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:36:08] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:36:08] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 2 ms to minimize.
[2024-05-25 15:36:08] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:36:08] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:36:08] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-25 15:36:08] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:36:08] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:36:08] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:36:08] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-25 15:36:08] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:36:08] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 16/55 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (OVERLAPS) 2/87 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-25 15:36:09] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 2 ms to minimize.
[2024-05-25 15:36:09] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:36:09] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:36:10] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:36:10] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-25 15:36:10] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
[2024-05-25 15:36:11] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (OVERLAPS) 96/183 variables, 87/151 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 66/217 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 12 (OVERLAPS) 0/183 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 217 constraints, problems are : Problem set: 0 solved, 93 unsolved in 8782 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 41/60 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 2/87 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 96/183 variables, 87/151 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 66/217 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 93/310 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-25 15:36:18] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/183 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 13 (OVERLAPS) 0/183 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 311 constraints, problems are : Problem set: 0 solved, 93 unsolved in 6372 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 44/44 constraints]
After SMT, in 15186ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 15189ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15767 ms. Remains : 87/87 places, 96/96 transitions.
Treatment of property ParamProductionCell-PT-4-LTLFireability-09 finished in 38579 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||G((F(p1)&&F(p2)))))))'
Support contains 5 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 199 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 199 transition count 196
Applied a total of 4 rules in 7 ms. Remains 199 /201 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 199 cols
[2024-05-25 15:36:21] [INFO ] Computed 33 invariants in 2 ms
[2024-05-25 15:36:21] [INFO ] Implicit Places using invariants in 352 ms returned [15, 17, 28, 54, 66, 85, 86, 100, 102, 143, 176, 177]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 354 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/201 places, 196/198 transitions.
Applied a total of 0 rules in 2 ms. Remains 187 /187 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 365 ms. Remains : 187/201 places, 196/198 transitions.
Stuttering acceptance computed with spot in 334 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-10
Product exploration explored 100000 steps with 1178 reset in 199 ms.
Product exploration explored 100000 steps with 1180 reset in 238 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 108 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
RANDOM walk for 342 steps (0 resets) in 5 ms. (57 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p2))]
Knowledge based reduction with 6 factoid took 189 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
// Phase 1: matrix 196 rows 187 cols
[2024-05-25 15:36:22] [INFO ] Computed 21 invariants in 2 ms
[2024-05-25 15:36:23] [INFO ] [Real]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-05-25 15:36:23] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-25 15:36:23] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2024-05-25 15:36:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:36:23] [INFO ] [Nat]Absence check using 18 positive place invariants in 14 ms returned sat
[2024-05-25 15:36:23] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-25 15:36:24] [INFO ] [Nat]Absence check using state equation in 550 ms returned sat
[2024-05-25 15:36:24] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:36:24] [INFO ] [Nat]Added 68 Read/Feed constraints in 92 ms returned sat
[2024-05-25 15:36:24] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 2 ms to minimize.
[2024-05-25 15:36:24] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 2 ms to minimize.
[2024-05-25 15:36:24] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 2 ms to minimize.
[2024-05-25 15:36:24] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 2 ms to minimize.
[2024-05-25 15:36:24] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-05-25 15:36:25] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 2 ms to minimize.
[2024-05-25 15:36:25] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 2 ms to minimize.
[2024-05-25 15:36:25] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 3 ms to minimize.
[2024-05-25 15:36:25] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 3 ms to minimize.
[2024-05-25 15:36:25] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 2 ms to minimize.
[2024-05-25 15:36:25] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-05-25 15:36:26] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 3 ms to minimize.
[2024-05-25 15:36:26] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 3 ms to minimize.
[2024-05-25 15:36:26] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 3 ms to minimize.
[2024-05-25 15:36:26] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 3 ms to minimize.
[2024-05-25 15:36:26] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 3 ms to minimize.
[2024-05-25 15:36:26] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 3 ms to minimize.
[2024-05-25 15:36:27] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2024-05-25 15:36:27] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 3 ms to minimize.
[2024-05-25 15:36:27] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 3 ms to minimize.
[2024-05-25 15:36:27] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:36:27] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 3 ms to minimize.
[2024-05-25 15:36:27] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 2 ms to minimize.
[2024-05-25 15:36:28] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 2 ms to minimize.
[2024-05-25 15:36:28] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3752 ms
[2024-05-25 15:36:28] [INFO ] Computed and/alt/rep : 185/325/185 causal constraints (skipped 7 transitions) in 27 ms.
[2024-05-25 15:36:30] [INFO ] Added : 171 causal constraints over 35 iterations in 2081 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 187 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 187/187 places, 196/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 187 transition count 158
Reduce places removed 38 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 40 rules applied. Total rules applied 78 place count 149 transition count 156
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 80 place count 147 transition count 156
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 80 place count 147 transition count 144
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 104 place count 135 transition count 144
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 174 place count 100 transition count 109
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 3 with 4 rules applied. Total rules applied 178 place count 98 transition count 107
Applied a total of 178 rules in 25 ms. Remains 98 /187 variables (removed 89) and now considering 107/196 (removed 89) transitions.
// Phase 1: matrix 107 rows 98 cols
[2024-05-25 15:36:30] [INFO ] Computed 21 invariants in 2 ms
[2024-05-25 15:36:30] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-25 15:36:30] [INFO ] Invariant cache hit.
[2024-05-25 15:36:30] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:36:30] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
[2024-05-25 15:36:30] [INFO ] Redundant transitions in 1 ms returned []
Running 104 sub problems to find dead transitions.
[2024-05-25 15:36:30] [INFO ] Invariant cache hit.
[2024-05-25 15:36:30] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-25 15:36:31] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-25 15:36:31] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:36:31] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 2 ms to minimize.
[2024-05-25 15:36:31] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 2 ms to minimize.
[2024-05-25 15:36:31] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-25 15:36:31] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 2 ms to minimize.
[2024-05-25 15:36:31] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:36:31] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:36:31] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-25 15:36:31] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 2 ms to minimize.
[2024-05-25 15:36:31] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-25 15:36:32] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 2 ms to minimize.
[2024-05-25 15:36:32] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 2 ms to minimize.
[2024-05-25 15:36:32] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-25 15:36:32] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-25 15:36:32] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:36:32] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:36:32] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-25 15:36:32] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:36:32] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-25 15:36:32] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-25 15:36:32] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-25 15:36:32] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 2 ms to minimize.
[2024-05-25 15:36:32] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 2 ms to minimize.
[2024-05-25 15:36:32] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-25 15:36:33] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-05-25 15:36:33] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-25 15:36:33] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-25 15:36:33] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-25 15:36:33] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 6 ms to minimize.
[2024-05-25 15:36:33] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-05-25 15:36:33] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:36:33] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 2 ms to minimize.
[2024-05-25 15:36:33] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:36:33] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:36:33] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:36:33] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 2 ms to minimize.
[2024-05-25 15:36:33] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 18/57 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-25 15:36:34] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-25 15:36:35] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-25 15:36:35] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-25 15:36:35] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-25 15:36:36] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (OVERLAPS) 2/98 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-25 15:36:37] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2024-05-25 15:36:38] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:36:38] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2024-05-25 15:36:38] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 11 (OVERLAPS) 107/205 variables, 98/166 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 66/232 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/205 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 14 (OVERLAPS) 0/205 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 232 constraints, problems are : Problem set: 0 solved, 104 unsolved in 11515 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 46/65 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 2/98 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-25 15:36:43] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (OVERLAPS) 107/205 variables, 98/167 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 66/233 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 104/337 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 12 (OVERLAPS) 0/205 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 337 constraints, problems are : Problem set: 0 solved, 104 unsolved in 7016 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 48/48 constraints]
After SMT, in 18560ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 18562ms
Starting structural reductions in SI_LTL mode, iteration 1 : 98/187 places, 107/196 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19119 ms. Remains : 98/187 places, 107/196 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT p1)), (X p2), (X (X (NOT p1))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 121 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
RANDOM walk for 170 steps (0 resets) in 4 ms. (34 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT p1)), (X p2), (X (X (NOT p1))), (X (X p2))]
False Knowledge obtained : [(F p1), (F (NOT p2))]
Knowledge based reduction with 5 factoid took 189 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
[2024-05-25 15:36:50] [INFO ] Invariant cache hit.
[2024-05-25 15:36:50] [INFO ] [Real]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-05-25 15:36:50] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-25 15:36:50] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2024-05-25 15:36:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:36:50] [INFO ] [Nat]Absence check using 18 positive place invariants in 14 ms returned sat
[2024-05-25 15:36:50] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-25 15:36:50] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2024-05-25 15:36:50] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:36:50] [INFO ] [Nat]Added 66 Read/Feed constraints in 27 ms returned sat
[2024-05-25 15:36:50] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 2 ms to minimize.
[2024-05-25 15:36:50] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 2 ms to minimize.
[2024-05-25 15:36:51] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 2 ms to minimize.
[2024-05-25 15:36:51] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 2 ms to minimize.
[2024-05-25 15:36:51] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 2 ms to minimize.
[2024-05-25 15:36:51] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 2 ms to minimize.
[2024-05-25 15:36:51] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 2 ms to minimize.
[2024-05-25 15:36:51] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 2 ms to minimize.
[2024-05-25 15:36:51] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
[2024-05-25 15:36:51] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-25 15:36:51] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 2 ms to minimize.
[2024-05-25 15:36:51] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-25 15:36:51] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 2 ms to minimize.
[2024-05-25 15:36:51] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-25 15:36:51] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
[2024-05-25 15:36:51] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1282 ms
[2024-05-25 15:36:52] [INFO ] Computed and/alt/rep : 97/238/97 causal constraints (skipped 7 transitions) in 14 ms.
[2024-05-25 15:36:52] [INFO ] Added : 77 causal constraints over 16 iterations in 380 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 2294 reset in 217 ms.
Product exploration explored 100000 steps with 2311 reset in 253 ms.
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 107/107 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 90 transition count 99
Applied a total of 16 rules in 11 ms. Remains 90 /98 variables (removed 8) and now considering 99/107 (removed 8) transitions.
// Phase 1: matrix 99 rows 90 cols
[2024-05-25 15:36:53] [INFO ] Computed 21 invariants in 1 ms
[2024-05-25 15:36:53] [INFO ] Implicit Places using invariants in 187 ms returned [39]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 192 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/98 places, 99/107 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 85 transition count 95
Applied a total of 8 rules in 7 ms. Remains 85 /89 variables (removed 4) and now considering 95/99 (removed 4) transitions.
// Phase 1: matrix 95 rows 85 cols
[2024-05-25 15:36:53] [INFO ] Computed 20 invariants in 1 ms
[2024-05-25 15:36:53] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-25 15:36:53] [INFO ] Invariant cache hit.
[2024-05-25 15:36:53] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:36:53] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/98 places, 95/107 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 582 ms. Remains : 85/98 places, 95/107 transitions.
Treatment of property ParamProductionCell-PT-4-LTLFireability-10 finished in 32500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(X(G(p0)))))))'
Support contains 1 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 199 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 199 transition count 196
Applied a total of 4 rules in 5 ms. Remains 199 /201 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 199 cols
[2024-05-25 15:36:53] [INFO ] Computed 33 invariants in 1 ms
[2024-05-25 15:36:53] [INFO ] Implicit Places using invariants in 336 ms returned [15, 17, 28, 54, 66, 85, 86, 88, 100, 102, 143, 176, 177]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 337 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/201 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 184 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 184 transition count 194
Applied a total of 4 rules in 4 ms. Remains 184 /186 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 184 cols
[2024-05-25 15:36:53] [INFO ] Computed 20 invariants in 1 ms
[2024-05-25 15:36:54] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-25 15:36:54] [INFO ] Invariant cache hit.
[2024-05-25 15:36:54] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:36:54] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 184/201 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1106 ms. Remains : 184/201 places, 194/198 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-11 finished in 1240 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(F(p2)&&p1))))'
Support contains 6 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 198/198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 201 transition count 178
Reduce places removed 20 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 22 rules applied. Total rules applied 42 place count 181 transition count 176
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 44 place count 179 transition count 176
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 44 place count 179 transition count 159
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 78 place count 162 transition count 159
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 80 place count 160 transition count 157
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 160 transition count 157
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 130 place count 136 transition count 133
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 3 with 2 rules applied. Total rules applied 132 place count 135 transition count 132
Applied a total of 132 rules in 20 ms. Remains 135 /201 variables (removed 66) and now considering 132/198 (removed 66) transitions.
// Phase 1: matrix 132 rows 135 cols
[2024-05-25 15:36:54] [INFO ] Computed 33 invariants in 1 ms
[2024-05-25 15:36:55] [INFO ] Implicit Places using invariants in 317 ms returned [10, 11, 34, 53, 54, 56, 68, 70, 100, 123, 124]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 319 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/201 places, 132/198 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 0 with 1 rules applied. Total rules applied 1 place count 124 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 123 transition count 131
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 123 transition count 129
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 121 transition count 129
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 119 transition count 127
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 119 transition count 127
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 62 place count 93 transition count 101
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 2 with 2 rules applied. Total rules applied 64 place count 92 transition count 100
Applied a total of 64 rules in 12 ms. Remains 92 /124 variables (removed 32) and now considering 100/132 (removed 32) transitions.
// Phase 1: matrix 100 rows 92 cols
[2024-05-25 15:36:55] [INFO ] Computed 22 invariants in 0 ms
[2024-05-25 15:36:55] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-25 15:36:55] [INFO ] Invariant cache hit.
[2024-05-25 15:36:55] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:36:55] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 92/201 places, 100/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 836 ms. Remains : 92/201 places, 100/198 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-13
Product exploration explored 100000 steps with 1261 reset in 258 ms.
Product exploration explored 100000 steps with 1268 reset in 298 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 195 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 181 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 222 steps (0 resets) in 5 ms. (37 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1))), (F p2), (F (NOT (OR p2 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p1)]
Knowledge based reduction with 17 factoid took 567 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 86 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
[2024-05-25 15:36:57] [INFO ] Invariant cache hit.
[2024-05-25 15:36:57] [INFO ] [Real]Absence check using 18 positive place invariants in 10 ms returned sat
[2024-05-25 15:36:57] [INFO ] [Real]Absence check using 18 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-25 15:36:57] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2024-05-25 15:36:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:36:57] [INFO ] [Nat]Absence check using 18 positive place invariants in 13 ms returned sat
[2024-05-25 15:36:57] [INFO ] [Nat]Absence check using 18 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-25 15:36:58] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-05-25 15:36:58] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:36:58] [INFO ] [Nat]Added 66 Read/Feed constraints in 27 ms returned sat
[2024-05-25 15:36:58] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 2 ms to minimize.
[2024-05-25 15:36:58] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-05-25 15:36:58] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 2 ms to minimize.
[2024-05-25 15:36:58] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 2 ms to minimize.
[2024-05-25 15:36:58] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 2 ms to minimize.
[2024-05-25 15:36:58] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-05-25 15:36:58] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
[2024-05-25 15:36:58] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 2 ms to minimize.
[2024-05-25 15:36:58] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
[2024-05-25 15:36:58] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 2 ms to minimize.
[2024-05-25 15:36:58] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 2 ms to minimize.
[2024-05-25 15:36:58] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 2 ms to minimize.
[2024-05-25 15:36:59] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-25 15:36:59] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-25 15:36:59] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-25 15:36:59] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
[2024-05-25 15:36:59] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 2 ms to minimize.
[2024-05-25 15:36:59] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 2 ms to minimize.
[2024-05-25 15:36:59] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-25 15:36:59] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-25 15:36:59] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-25 15:36:59] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-25 15:36:59] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-25 15:36:59] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:36:59] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:36:59] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:36:59] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-25 15:36:59] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 1770 ms
[2024-05-25 15:36:59] [INFO ] Computed and/alt/rep : 97/231/97 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-25 15:37:00] [INFO ] Added : 85 causal constraints over 17 iterations in 258 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2024-05-25 15:37:00] [INFO ] Invariant cache hit.
[2024-05-25 15:37:00] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-05-25 15:37:00] [INFO ] [Real]Absence check using 18 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-25 15:37:00] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-05-25 15:37:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:37:00] [INFO ] [Nat]Absence check using 18 positive place invariants in 10 ms returned sat
[2024-05-25 15:37:00] [INFO ] [Nat]Absence check using 18 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-25 15:37:00] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2024-05-25 15:37:00] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:37:00] [INFO ] [Nat]Added 66 Read/Feed constraints in 16 ms returned sat
[2024-05-25 15:37:00] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-25 15:37:00] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-25 15:37:00] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 2 ms to minimize.
[2024-05-25 15:37:00] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 2 ms to minimize.
[2024-05-25 15:37:00] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 2 ms to minimize.
[2024-05-25 15:37:00] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 2 ms to minimize.
[2024-05-25 15:37:01] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-05-25 15:37:01] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-05-25 15:37:01] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 2 ms to minimize.
[2024-05-25 15:37:01] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:37:01] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:37:01] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:37:01] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 2 ms to minimize.
[2024-05-25 15:37:01] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 2 ms to minimize.
[2024-05-25 15:37:01] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 950 ms
[2024-05-25 15:37:01] [INFO ] Computed and/alt/rep : 97/231/97 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-25 15:37:01] [INFO ] Added : 77 causal constraints over 16 iterations in 258 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 6 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 92 /92 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-25 15:37:01] [INFO ] Invariant cache hit.
[2024-05-25 15:37:01] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-25 15:37:01] [INFO ] Invariant cache hit.
[2024-05-25 15:37:01] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:37:02] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2024-05-25 15:37:02] [INFO ] Redundant transitions in 1 ms returned []
Running 97 sub problems to find dead transitions.
[2024-05-25 15:37:02] [INFO ] Invariant cache hit.
[2024-05-25 15:37:02] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:37:02] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:37:02] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:37:02] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-25 15:37:02] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:37:02] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:37:02] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:37:02] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:37:02] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:37:02] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:37:02] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:37:03] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-25 15:37:03] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 2 ms to minimize.
[2024-05-25 15:37:03] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-25 15:37:03] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
[2024-05-25 15:37:03] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:37:03] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:37:03] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:37:03] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:37:03] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-25 15:37:03] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:37:03] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-25 15:37:03] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 2 ms to minimize.
[2024-05-25 15:37:03] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:37:03] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 2 ms to minimize.
[2024-05-25 15:37:03] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 2 ms to minimize.
[2024-05-25 15:37:03] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-25 15:37:04] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 2 ms to minimize.
[2024-05-25 15:37:04] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-25 15:37:04] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:37:04] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:37:04] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:37:04] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:37:04] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:37:04] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:37:04] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:37:04] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:37:04] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-25 15:37:04] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-25 15:37:05] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:37:05] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:37:05] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:37:05] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:37:05] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:37:05] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:37:06] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 1/91 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:37:07] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-25 15:37:07] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-25 15:37:07] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-25 15:37:07] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/91 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 1/92 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/92 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (OVERLAPS) 100/192 variables, 92/163 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/192 variables, 66/229 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/192 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 17 (OVERLAPS) 0/192 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 229 constraints, problems are : Problem set: 0 solved, 97 unsolved in 8454 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 92/92 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 48/68 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:37:11] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:37:11] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 1/91 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 1/92 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (OVERLAPS) 100/192 variables, 92/165 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 66/231 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 97/328 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/192 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:37:15] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/192 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/192 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 17 (OVERLAPS) 0/192 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 329 constraints, problems are : Problem set: 0 solved, 97 unsolved in 7784 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 92/92 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 52/52 constraints]
After SMT, in 16263ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 16266ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16617 ms. Remains : 92/92 places, 100/100 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 142 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 212 steps (0 resets) in 6 ms. (30 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1))), (F p2), (F (NOT (OR p2 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p1)]
Knowledge based reduction with 17 factoid took 402 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 76 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
[2024-05-25 15:37:19] [INFO ] Invariant cache hit.
[2024-05-25 15:37:19] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2024-05-25 15:37:19] [INFO ] [Real]Absence check using 18 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-25 15:37:19] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-05-25 15:37:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:37:19] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-25 15:37:19] [INFO ] [Nat]Absence check using 18 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-25 15:37:19] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2024-05-25 15:37:19] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:37:19] [INFO ] [Nat]Added 66 Read/Feed constraints in 18 ms returned sat
[2024-05-25 15:37:19] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-05-25 15:37:19] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-25 15:37:19] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-25 15:37:19] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 2 ms to minimize.
[2024-05-25 15:37:19] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-25 15:37:19] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2024-05-25 15:37:20] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:37:20] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:37:20] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:37:20] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-05-25 15:37:20] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:37:20] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
[2024-05-25 15:37:20] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:37:20] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:37:20] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:37:20] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:37:20] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:37:20] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:37:20] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-25 15:37:20] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:37:20] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:37:20] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:37:20] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:37:20] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:37:20] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:37:20] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:37:20] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-25 15:37:20] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 1353 ms
[2024-05-25 15:37:20] [INFO ] Computed and/alt/rep : 97/231/97 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-25 15:37:21] [INFO ] Added : 85 causal constraints over 17 iterations in 266 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2024-05-25 15:37:21] [INFO ] Invariant cache hit.
[2024-05-25 15:37:21] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2024-05-25 15:37:21] [INFO ] [Real]Absence check using 18 positive and 4 generalized place invariants in 5 ms returned sat
[2024-05-25 15:37:21] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-25 15:37:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:37:21] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2024-05-25 15:37:21] [INFO ] [Nat]Absence check using 18 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-25 15:37:21] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-05-25 15:37:21] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:37:21] [INFO ] [Nat]Added 66 Read/Feed constraints in 14 ms returned sat
[2024-05-25 15:37:21] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
[2024-05-25 15:37:21] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-25 15:37:21] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-05-25 15:37:21] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 2 ms to minimize.
[2024-05-25 15:37:21] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-25 15:37:21] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 2 ms to minimize.
[2024-05-25 15:37:21] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-25 15:37:22] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-25 15:37:22] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 2 ms to minimize.
[2024-05-25 15:37:22] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:37:22] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:37:22] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 2 ms to minimize.
[2024-05-25 15:37:22] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:37:22] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:37:22] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 748 ms
[2024-05-25 15:37:22] [INFO ] Computed and/alt/rep : 97/231/97 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-25 15:37:22] [INFO ] Added : 77 causal constraints over 16 iterations in 209 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 84 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1281 reset in 164 ms.
Product exploration explored 100000 steps with 1255 reset in 188 ms.
Support contains 6 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-25 15:37:22] [INFO ] Invariant cache hit.
[2024-05-25 15:37:23] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-25 15:37:23] [INFO ] Invariant cache hit.
[2024-05-25 15:37:23] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:37:23] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2024-05-25 15:37:23] [INFO ] Redundant transitions in 1 ms returned []
Running 97 sub problems to find dead transitions.
[2024-05-25 15:37:23] [INFO ] Invariant cache hit.
[2024-05-25 15:37:23] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:37:23] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:37:23] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:37:23] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:37:23] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:37:23] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:37:24] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:37:24] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-25 15:37:24] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:37:24] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:37:24] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:37:24] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:37:24] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:37:24] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:37:24] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:37:24] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:37:24] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:37:24] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:37:24] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:37:24] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-25 15:37:24] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:37:24] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:37:24] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 2 ms to minimize.
[2024-05-25 15:37:24] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-25 15:37:24] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:37:24] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:37:24] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:37:25] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-25 15:37:25] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-25 15:37:25] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:37:25] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-25 15:37:25] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:37:25] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:37:25] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:37:25] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:37:25] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:37:25] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:37:25] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-25 15:37:25] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-25 15:37:26] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:37:26] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:37:26] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:37:26] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:37:26] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:37:26] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:37:27] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 1/91 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:37:28] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:37:28] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:37:28] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-25 15:37:28] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/91 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 1/92 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/92 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (OVERLAPS) 100/192 variables, 92/163 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/192 variables, 66/229 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/192 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 17 (OVERLAPS) 0/192 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 229 constraints, problems are : Problem set: 0 solved, 97 unsolved in 8465 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 92/92 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 48/68 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:37:32] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:37:32] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 1/91 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 1/92 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (OVERLAPS) 100/192 variables, 92/165 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 66/231 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 97/328 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/192 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:37:36] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/192 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/192 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 17 (OVERLAPS) 0/192 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 329 constraints, problems are : Problem set: 0 solved, 97 unsolved in 7437 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 92/92 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 52/52 constraints]
After SMT, in 15935ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 15936ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16274 ms. Remains : 92/92 places, 100/100 transitions.
Treatment of property ParamProductionCell-PT-4-LTLFireability-13 finished in 44438 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(p1)&&G(p2)&&p0)))'
Support contains 6 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 200 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 200 transition count 197
Applied a total of 2 rules in 4 ms. Remains 200 /201 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 200 cols
[2024-05-25 15:37:39] [INFO ] Computed 33 invariants in 2 ms
[2024-05-25 15:37:39] [INFO ] Implicit Places using invariants in 248 ms returned [17, 28, 54, 66, 85, 100, 102, 144, 177, 178]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 250 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 190/201 places, 197/198 transitions.
Applied a total of 0 rules in 2 ms. Remains 190 /190 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 256 ms. Remains : 190/201 places, 197/198 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-14 finished in 459 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&&F(p1)&&F(G(p2))))))'
Support contains 6 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 199 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 199 transition count 196
Applied a total of 4 rules in 4 ms. Remains 199 /201 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 199 cols
[2024-05-25 15:37:39] [INFO ] Computed 33 invariants in 1 ms
[2024-05-25 15:37:39] [INFO ] Implicit Places using invariants in 187 ms returned [15, 17, 28, 54, 66, 85, 86, 88, 100, 102, 143, 176, 177]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 189 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/201 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 184 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 184 transition count 194
Applied a total of 4 rules in 3 ms. Remains 184 /186 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 184 cols
[2024-05-25 15:37:39] [INFO ] Computed 20 invariants in 1 ms
[2024-05-25 15:37:40] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-25 15:37:40] [INFO ] Invariant cache hit.
[2024-05-25 15:37:40] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:37:40] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 184/201 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 730 ms. Remains : 184/201 places, 194/198 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 128 ms.
Stack based approach found an accepted trace after 207 steps with 0 reset with depth 208 and stack size 208 in 0 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-15 finished in 1055 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)))'
Found a Shortening insensitive property : ParamProductionCell-PT-4-LTLFireability-03
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 201/201 places, 198/198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 201 transition count 172
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 175 transition count 172
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 52 place count 175 transition count 159
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 78 place count 162 transition count 159
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 80 place count 160 transition count 157
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 160 transition count 157
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 130 place count 136 transition count 133
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 2 with 2 rules applied. Total rules applied 132 place count 135 transition count 132
Applied a total of 132 rules in 14 ms. Remains 135 /201 variables (removed 66) and now considering 132/198 (removed 66) transitions.
// Phase 1: matrix 132 rows 135 cols
[2024-05-25 15:37:41] [INFO ] Computed 33 invariants in 1 ms
[2024-05-25 15:37:41] [INFO ] Implicit Places using invariants in 208 ms returned [9, 10, 17, 32, 39, 50, 51, 53, 67, 100, 123, 124]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 210 ms to find 12 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 123/201 places, 132/198 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 123 transition count 128
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 119 transition count 128
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 117 transition count 126
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 117 transition count 126
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 56 place count 95 transition count 104
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 0 with 2 rules applied. Total rules applied 58 place count 94 transition count 103
Applied a total of 58 rules in 8 ms. Remains 94 /123 variables (removed 29) and now considering 103/132 (removed 29) transitions.
// Phase 1: matrix 103 rows 94 cols
[2024-05-25 15:37:41] [INFO ] Computed 21 invariants in 1 ms
[2024-05-25 15:37:41] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-25 15:37:41] [INFO ] Invariant cache hit.
[2024-05-25 15:37:41] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:37:41] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 94/201 places, 103/198 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 566 ms. Remains : 94/201 places, 103/198 transitions.
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-03
Product exploration explored 100000 steps with 2945 reset in 127 ms.
Product exploration explored 100000 steps with 2919 reset in 145 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 171 steps (0 resets) in 5 ms. (28 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
[2024-05-25 15:37:42] [INFO ] Invariant cache hit.
[2024-05-25 15:37:42] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-25 15:37:42] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-25 15:37:42] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-05-25 15:37:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:37:42] [INFO ] [Nat]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-05-25 15:37:42] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-25 15:37:42] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-05-25 15:37:42] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:37:42] [INFO ] [Nat]Added 66 Read/Feed constraints in 16 ms returned sat
[2024-05-25 15:37:42] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-25 15:37:42] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2024-05-25 15:37:42] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2024-05-25 15:37:42] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-25 15:37:42] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-25 15:37:43] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-25 15:37:43] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:37:43] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:37:43] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 2 ms to minimize.
[2024-05-25 15:37:43] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:37:43] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 555 ms
[2024-05-25 15:37:43] [INFO ] Computed and/alt/rep : 100/220/100 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-25 15:37:43] [INFO ] Added : 94 causal constraints over 19 iterations in 256 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 103/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 94 /94 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-05-25 15:37:43] [INFO ] Invariant cache hit.
[2024-05-25 15:37:43] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-25 15:37:43] [INFO ] Invariant cache hit.
[2024-05-25 15:37:43] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:37:43] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2024-05-25 15:37:43] [INFO ] Redundant transitions in 0 ms returned []
Running 100 sub problems to find dead transitions.
[2024-05-25 15:37:43] [INFO ] Invariant cache hit.
[2024-05-25 15:37:43] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:37:44] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:37:44] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-25 15:37:44] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-25 15:37:44] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:37:44] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:37:44] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-25 15:37:44] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:37:44] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:37:44] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:37:44] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:37:44] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-25 15:37:44] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:37:44] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:37:44] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:37:45] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-25 15:37:45] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-25 15:37:45] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:37:45] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:37:45] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-25 15:37:45] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:37:45] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-25 15:37:45] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:37:45] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 2 ms to minimize.
[2024-05-25 15:37:45] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:37:45] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:37:45] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-25 15:37:45] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:37:45] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:37:45] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-25 15:37:45] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-25 15:37:45] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:37:45] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:37:46] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 2 ms to minimize.
[2024-05-25 15:37:46] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:37:46] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 15/54 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:37:46] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:37:47] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:37:47] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:37:47] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 1/93 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:37:48] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-25 15:37:48] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:37:48] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-05-25 15:37:48] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/93 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 1/94 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:37:49] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/94 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/94 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 14 (OVERLAPS) 103/197 variables, 94/159 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/197 variables, 66/225 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/197 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 17 (OVERLAPS) 0/197 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 225 constraints, problems are : Problem set: 0 solved, 100 unsolved in 8273 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 42/61 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 1/93 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 1/94 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 103/197 variables, 94/159 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 66/225 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/197 variables, 100/325 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 13 (OVERLAPS) 0/197 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 325 constraints, problems are : Problem set: 0 solved, 100 unsolved in 4365 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 44/44 constraints]
After SMT, in 12656ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 12658ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13046 ms. Remains : 94/94 places, 103/103 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 94 steps (0 resets) in 4 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
[2024-05-25 15:37:56] [INFO ] Invariant cache hit.
[2024-05-25 15:37:57] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-25 15:37:57] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 15:37:57] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-25 15:37:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:37:57] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-25 15:37:57] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-25 15:37:57] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-05-25 15:37:57] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:37:57] [INFO ] [Nat]Added 66 Read/Feed constraints in 16 ms returned sat
[2024-05-25 15:37:57] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-05-25 15:37:57] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 4 ms to minimize.
[2024-05-25 15:37:57] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2024-05-25 15:37:57] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 2 ms to minimize.
[2024-05-25 15:37:57] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 2 ms to minimize.
[2024-05-25 15:37:57] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-25 15:37:57] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 2 ms to minimize.
[2024-05-25 15:37:57] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 2 ms to minimize.
[2024-05-25 15:37:57] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:37:57] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:37:57] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 581 ms
[2024-05-25 15:37:57] [INFO ] Computed and/alt/rep : 100/220/100 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-25 15:37:58] [INFO ] Added : 94 causal constraints over 19 iterations in 245 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2920 reset in 131 ms.
Product exploration explored 100000 steps with 2942 reset in 152 ms.
Support contains 2 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 103/103 transitions.
Applied a total of 0 rules in 3 ms. Remains 94 /94 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-05-25 15:37:58] [INFO ] Invariant cache hit.
[2024-05-25 15:37:58] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-25 15:37:58] [INFO ] Invariant cache hit.
[2024-05-25 15:37:58] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:37:58] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2024-05-25 15:37:58] [INFO ] Redundant transitions in 0 ms returned []
Running 100 sub problems to find dead transitions.
[2024-05-25 15:37:58] [INFO ] Invariant cache hit.
[2024-05-25 15:37:58] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:37:59] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:37:59] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-25 15:37:59] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-25 15:37:59] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:37:59] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:37:59] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-25 15:37:59] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:37:59] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:37:59] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:37:59] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 2 ms to minimize.
[2024-05-25 15:37:59] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-25 15:37:59] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:37:59] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:37:59] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-05-25 15:37:59] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:37:59] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:38:00] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:38:00] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:38:00] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-25 15:38:00] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:38:00] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:38:00] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:38:00] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:38:00] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:38:00] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:38:00] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-25 15:38:00] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:38:00] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:38:00] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:38:00] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-25 15:38:00] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:38:00] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:38:00] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 2 ms to minimize.
[2024-05-25 15:38:00] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:38:00] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 15/54 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:38:01] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:38:01] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:38:02] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 2 ms to minimize.
[2024-05-25 15:38:02] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 1/93 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:38:03] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:38:03] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-25 15:38:03] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-25 15:38:03] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/93 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 1/94 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:38:04] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/94 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/94 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 14 (OVERLAPS) 103/197 variables, 94/159 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/197 variables, 66/225 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/197 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 17 (OVERLAPS) 0/197 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 225 constraints, problems are : Problem set: 0 solved, 100 unsolved in 8031 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 42/61 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 1/93 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 1/94 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 103/197 variables, 94/159 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 66/225 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/197 variables, 100/325 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 13 (OVERLAPS) 0/197 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 325 constraints, problems are : Problem set: 0 solved, 100 unsolved in 4310 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 44/44 constraints]
After SMT, in 12360ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 12361ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12694 ms. Remains : 94/94 places, 103/103 transitions.
Treatment of property ParamProductionCell-PT-4-LTLFireability-03 finished in 30475 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a Shortening insensitive property : ParamProductionCell-PT-4-LTLFireability-08
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 201/201 places, 198/198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 201 transition count 172
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 175 transition count 172
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 52 place count 175 transition count 159
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 78 place count 162 transition count 159
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 80 place count 160 transition count 157
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 160 transition count 157
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 132 place count 135 transition count 132
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 2 with 2 rules applied. Total rules applied 134 place count 134 transition count 131
Applied a total of 134 rules in 12 ms. Remains 134 /201 variables (removed 67) and now considering 131/198 (removed 67) transitions.
// Phase 1: matrix 131 rows 134 cols
[2024-05-25 15:38:11] [INFO ] Computed 33 invariants in 1 ms
[2024-05-25 15:38:11] [INFO ] Implicit Places using invariants in 277 ms returned [9, 10, 17, 32, 39, 50, 51, 53, 65, 67, 97, 121]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 278 ms to find 12 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 122/201 places, 131/198 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 0 with 1 rules applied. Total rules applied 1 place count 122 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 121 transition count 130
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 121 transition count 127
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 118 transition count 127
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 116 transition count 125
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 116 transition count 125
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 62 place count 91 transition count 100
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 2 with 2 rules applied. Total rules applied 64 place count 90 transition count 99
Applied a total of 64 rules in 9 ms. Remains 90 /122 variables (removed 32) and now considering 99/131 (removed 32) transitions.
// Phase 1: matrix 99 rows 90 cols
[2024-05-25 15:38:11] [INFO ] Computed 21 invariants in 1 ms
[2024-05-25 15:38:12] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-25 15:38:12] [INFO ] Invariant cache hit.
[2024-05-25 15:38:12] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:38:12] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 90/201 places, 99/198 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 701 ms. Remains : 90/201 places, 99/198 transitions.
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-08
Product exploration explored 100000 steps with 1403 reset in 130 ms.
Product exploration explored 100000 steps with 1412 reset in 147 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 253 steps (0 resets) in 4 ms. (50 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-25 15:38:13] [INFO ] Invariant cache hit.
[2024-05-25 15:38:13] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-25 15:38:13] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-25 15:38:13] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-05-25 15:38:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:38:13] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-25 15:38:13] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-25 15:38:13] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-05-25 15:38:13] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:38:13] [INFO ] [Nat]Added 66 Read/Feed constraints in 23 ms returned sat
[2024-05-25 15:38:13] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-25 15:38:13] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
[2024-05-25 15:38:13] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-25 15:38:13] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:38:13] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:38:13] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:38:13] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:38:13] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:38:13] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:38:14] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 2 ms to minimize.
[2024-05-25 15:38:14] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:38:14] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:38:14] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:38:14] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-25 15:38:14] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-25 15:38:14] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-25 15:38:14] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:38:14] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-25 15:38:14] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 2 ms to minimize.
[2024-05-25 15:38:14] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:38:14] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-25 15:38:14] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:38:14] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:38:14] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-05-25 15:38:14] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:38:14] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:38:14] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 1346 ms
[2024-05-25 15:38:14] [INFO ] Computed and/alt/rep : 96/220/96 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-25 15:38:15] [INFO ] Added : 88 causal constraints over 18 iterations in 301 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 90 /90 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-25 15:38:15] [INFO ] Invariant cache hit.
[2024-05-25 15:38:15] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-25 15:38:15] [INFO ] Invariant cache hit.
[2024-05-25 15:38:15] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:38:15] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-25 15:38:15] [INFO ] Invariant cache hit.
[2024-05-25 15:38:15] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:38:15] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:38:15] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:38:15] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:38:15] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-25 15:38:16] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:38:16] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:38:16] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:38:16] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 2 ms to minimize.
[2024-05-25 15:38:16] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:38:16] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:38:16] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 2 ms to minimize.
[2024-05-25 15:38:16] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:38:16] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-25 15:38:16] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:38:16] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:38:16] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:38:16] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:38:16] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-25 15:38:16] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:38:16] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:38:16] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-25 15:38:16] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:38:16] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-25 15:38:16] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 5 ms to minimize.
[2024-05-25 15:38:17] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-25 15:38:17] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:38:17] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:38:17] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:38:17] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:38:18] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:38:18] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:38:18] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:38:18] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 1/89 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:38:19] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:38:19] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-05-25 15:38:19] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (OVERLAPS) 1/90 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/90 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (OVERLAPS) 99/189 variables, 90/147 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 66/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/189 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 16 (OVERLAPS) 0/189 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 213 constraints, problems are : Problem set: 0 solved, 96 unsolved in 7015 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 1/89 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 1/90 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:38:23] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 99/189 variables, 90/148 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 66/214 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 96/310 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:38:24] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-25 15:38:24] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2024-05-25 15:38:25] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:38:25] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:38:25] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 5/315 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 15 (OVERLAPS) 0/189 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 315 constraints, problems are : Problem set: 0 solved, 96 unsolved in 5440 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 42/42 constraints]
After SMT, in 12475ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 12476ms
Finished structural reductions in LTL mode , in 1 iterations and 12810 ms. Remains : 90/90 places, 99/99 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 271 steps (0 resets) in 4 ms. (54 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-25 15:38:28] [INFO ] Invariant cache hit.
[2024-05-25 15:38:28] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-25 15:38:28] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-25 15:38:28] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-05-25 15:38:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:38:28] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-25 15:38:28] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-25 15:38:28] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-05-25 15:38:28] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:38:28] [INFO ] [Nat]Added 66 Read/Feed constraints in 15 ms returned sat
[2024-05-25 15:38:28] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-25 15:38:29] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 2 ms to minimize.
[2024-05-25 15:38:29] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-25 15:38:29] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 2 ms to minimize.
[2024-05-25 15:38:29] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 2 ms to minimize.
[2024-05-25 15:38:29] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-25 15:38:29] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
[2024-05-25 15:38:29] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 2 ms to minimize.
[2024-05-25 15:38:29] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:38:29] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:38:29] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 2 ms to minimize.
[2024-05-25 15:38:29] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:38:29] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:38:29] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-25 15:38:29] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 2 ms to minimize.
[2024-05-25 15:38:29] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:38:29] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-25 15:38:30] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-25 15:38:30] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-25 15:38:30] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:38:30] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:38:30] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:38:30] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-25 15:38:30] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:38:30] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:38:30] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 2 ms to minimize.
[2024-05-25 15:38:30] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 1522 ms
[2024-05-25 15:38:30] [INFO ] Computed and/alt/rep : 96/220/96 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-25 15:38:30] [INFO ] Added : 88 causal constraints over 18 iterations in 298 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1414 reset in 128 ms.
Product exploration explored 100000 steps with 1413 reset in 149 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 256 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 99/99 transitions.
Applied a total of 0 rules in 4 ms. Remains 90 /90 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-25 15:38:31] [INFO ] Redundant transitions in 0 ms returned []
Running 96 sub problems to find dead transitions.
[2024-05-25 15:38:31] [INFO ] Invariant cache hit.
[2024-05-25 15:38:31] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:38:31] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-25 15:38:31] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 0 ms to minimize.
[2024-05-25 15:38:32] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2024-05-25 15:38:32] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-25 15:38:32] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:38:32] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:38:32] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:38:32] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:38:32] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-25 15:38:32] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:38:32] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:38:32] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:38:32] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-25 15:38:32] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:38:32] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:38:32] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:38:32] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:38:32] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:38:32] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:38:32] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:38:32] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-25 15:38:32] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:38:32] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-25 15:38:33] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:38:33] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-25 15:38:33] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:38:33] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:38:33] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:38:33] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:38:34] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-25 15:38:34] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:38:34] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:38:34] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 1/89 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:38:35] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:38:35] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-05-25 15:38:35] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (OVERLAPS) 1/90 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/90 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (OVERLAPS) 99/189 variables, 90/147 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 66/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/189 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 16 (OVERLAPS) 0/189 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 213 constraints, problems are : Problem set: 0 solved, 96 unsolved in 7030 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 1/89 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 1/90 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:38:39] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 99/189 variables, 90/148 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 66/214 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 96/310 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:38:40] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:38:40] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 2 ms to minimize.
[2024-05-25 15:38:41] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:38:41] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:38:41] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 5/315 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 15 (OVERLAPS) 0/189 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 315 constraints, problems are : Problem set: 0 solved, 96 unsolved in 5401 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 42/42 constraints]
After SMT, in 12477ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 12478ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12489 ms. Remains : 90/90 places, 99/99 transitions.
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 99/99 transitions.
Applied a total of 0 rules in 0 ms. Remains 90 /90 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-25 15:38:43] [INFO ] Invariant cache hit.
[2024-05-25 15:38:44] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-25 15:38:44] [INFO ] Invariant cache hit.
[2024-05-25 15:38:44] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:38:44] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-25 15:38:44] [INFO ] Invariant cache hit.
[2024-05-25 15:38:44] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:38:44] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 2 ms to minimize.
[2024-05-25 15:38:44] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:38:44] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-25 15:38:44] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-25 15:38:44] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:38:44] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:38:44] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 2 ms to minimize.
[2024-05-25 15:38:45] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-25 15:38:45] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 2 ms to minimize.
[2024-05-25 15:38:45] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-25 15:38:45] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:38:45] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:38:45] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-25 15:38:45] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:38:45] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:38:45] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:38:45] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:38:45] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 2 ms to minimize.
[2024-05-25 15:38:45] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:38:45] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:38:45] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-25 15:38:45] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:38:45] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-25 15:38:45] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-25 15:38:45] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-25 15:38:45] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-25 15:38:45] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:38:46] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:38:46] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:38:46] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:38:46] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:38:47] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:38:47] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 1/89 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:38:48] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:38:48] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-25 15:38:48] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (OVERLAPS) 1/90 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/90 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (OVERLAPS) 99/189 variables, 90/147 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 66/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/189 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 16 (OVERLAPS) 0/189 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 213 constraints, problems are : Problem set: 0 solved, 96 unsolved in 7412 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 1/89 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 1/90 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:38:52] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 99/189 variables, 90/148 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 66/214 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 96/310 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:38:53] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:38:54] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:38:54] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:38:54] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:38:54] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 5/315 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 15 (OVERLAPS) 0/189 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 315 constraints, problems are : Problem set: 0 solved, 96 unsolved in 5440 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 42/42 constraints]
After SMT, in 12868ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 12870ms
Finished structural reductions in LTL mode , in 1 iterations and 13231 ms. Remains : 90/90 places, 99/99 transitions.
Treatment of property ParamProductionCell-PT-4-LTLFireability-08 finished in 45950 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((p0||G((F(p1)&&F(p2)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(F(p2)&&p1))))'
[2024-05-25 15:38:57] [INFO ] Flatten gal took : 16 ms
[2024-05-25 15:38:57] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 6 ms.
[2024-05-25 15:38:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 201 places, 198 transitions and 710 arcs took 10 ms.
Total runtime 387970 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running ParamProductionCell-PT-4
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 201
TRANSITIONS: 198
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.006s, Sys 0.000s]
SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 5161
MODEL NAME: /home/mcc/execution/412/model
201 places, 198 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ParamProductionCell-PT-4-LTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ParamProductionCell-PT-4-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ParamProductionCell-PT-4-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ParamProductionCell-PT-4-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ParamProductionCell-PT-4-LTLFireability-09 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716651975394
--------------------
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="ParamProductionCell-PT-4"
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 ParamProductionCell-PT-4, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r267-smll-171654405600044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-4.tgz
mv ParamProductionCell-PT-4 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;