About the Execution of GreatSPN+red for Peterson-COL-3
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4226.008 | 3022922.00 | 3234472.00 | 8471.50 | FFFFFFFFF?FFFFFF | 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-171654405900212.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 Peterson-COL-3, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654405900212
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.3K Apr 12 02:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 12 02:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 02:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 12 02:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 02:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 12 02:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 02:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 02:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 43K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-COL-3-LTLFireability-00
FORMULA_NAME Peterson-COL-3-LTLFireability-01
FORMULA_NAME Peterson-COL-3-LTLFireability-02
FORMULA_NAME Peterson-COL-3-LTLFireability-03
FORMULA_NAME Peterson-COL-3-LTLFireability-04
FORMULA_NAME Peterson-COL-3-LTLFireability-05
FORMULA_NAME Peterson-COL-3-LTLFireability-06
FORMULA_NAME Peterson-COL-3-LTLFireability-07
FORMULA_NAME Peterson-COL-3-LTLFireability-08
FORMULA_NAME Peterson-COL-3-LTLFireability-09
FORMULA_NAME Peterson-COL-3-LTLFireability-10
FORMULA_NAME Peterson-COL-3-LTLFireability-11
FORMULA_NAME Peterson-COL-3-LTLFireability-12
FORMULA_NAME Peterson-COL-3-LTLFireability-13
FORMULA_NAME Peterson-COL-3-LTLFireability-14
FORMULA_NAME Peterson-COL-3-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716728430178
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 13:00:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-26 13:00:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 13:00:32] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-26 13:00:32] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 13:00:33] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1206 ms
[2024-05-26 13:00:33] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 256 PT places and 396.0 transition bindings in 31 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2024-05-26 13:00:33] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 5 ms.
[2024-05-26 13:00:33] [INFO ] Skeletonized 15 HLPN properties in 2 ms. Removed 1 properties that had guard overlaps.
Computed a total of 2 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 5564 steps (1 resets) in 103 ms. (53 steps per ms) remains 0/15 properties
[2024-05-26 13:00:34] [INFO ] Flatten gal took : 36 ms
[2024-05-26 13:00:34] [INFO ] Flatten gal took : 17 ms
Domain [Process(4), Tour(3), Process(4)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 3)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-26 13:00:34] [INFO ] Unfolded HLPN to a Petri net with 256 places and 356 transitions 1112 arcs in 56 ms.
[2024-05-26 13:00:34] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Deduced a syphon composed of 12 places in 4 ms
Reduce places removed 12 places and 24 transitions.
Support contains 244 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 25 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-26 13:00:34] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-26 13:00:34] [INFO ] Computed 15 invariants in 64 ms
[2024-05-26 13:00:34] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-05-26 13:00:34] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 13:00:34] [INFO ] Invariant cache hit.
[2024-05-26 13:00:35] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-26 13:00:35] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 890 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2024-05-26 13:00:35] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 13:00:35] [INFO ] Invariant cache hit.
[2024-05-26 13:00:35] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:00:38] [INFO ] Deduced a trap composed of 12 places in 470 ms of which 55 ms to minimize.
[2024-05-26 13:00:38] [INFO ] Deduced a trap composed of 22 places in 170 ms of which 2 ms to minimize.
[2024-05-26 13:00:38] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-26 13:00:39] [INFO ] Deduced a trap composed of 56 places in 143 ms of which 3 ms to minimize.
[2024-05-26 13:00:39] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 3 ms to minimize.
[2024-05-26 13:00:39] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 3 ms to minimize.
[2024-05-26 13:00:39] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 3 ms to minimize.
[2024-05-26 13:00:39] [INFO ] Deduced a trap composed of 56 places in 141 ms of which 7 ms to minimize.
[2024-05-26 13:00:39] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 3 ms to minimize.
[2024-05-26 13:00:39] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
[2024-05-26 13:00:39] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 2 ms to minimize.
[2024-05-26 13:00:40] [INFO ] Deduced a trap composed of 62 places in 101 ms of which 3 ms to minimize.
[2024-05-26 13:00:40] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 3 ms to minimize.
[2024-05-26 13:00:40] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-05-26 13:00:40] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 3 ms to minimize.
[2024-05-26 13:00:40] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 2 ms to minimize.
[2024-05-26 13:00:40] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 3 ms to minimize.
[2024-05-26 13:00:40] [INFO ] Deduced a trap composed of 9 places in 208 ms of which 2 ms to minimize.
[2024-05-26 13:00:40] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2024-05-26 13:00:41] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:00:41] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 3 ms to minimize.
[2024-05-26 13:00:41] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 3 ms to minimize.
[2024-05-26 13:00:41] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 3 ms to minimize.
[2024-05-26 13:00:41] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-05-26 13:00:41] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-26 13:00:41] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 4 ms to minimize.
[2024-05-26 13:00:41] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 2 ms to minimize.
[2024-05-26 13:00:42] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 2 ms to minimize.
[2024-05-26 13:00:42] [INFO ] Deduced a trap composed of 56 places in 108 ms of which 2 ms to minimize.
[2024-05-26 13:00:42] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
[2024-05-26 13:00:42] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 2 ms to minimize.
[2024-05-26 13:00:42] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 2 ms to minimize.
[2024-05-26 13:00:42] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-05-26 13:00:43] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 2 ms to minimize.
[2024-05-26 13:00:43] [INFO ] Deduced a trap composed of 50 places in 100 ms of which 7 ms to minimize.
[2024-05-26 13:00:43] [INFO ] Deduced a trap composed of 53 places in 116 ms of which 2 ms to minimize.
[2024-05-26 13:00:43] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 2 ms to minimize.
[2024-05-26 13:00:43] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 1 ms to minimize.
[2024-05-26 13:00:43] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 2 ms to minimize.
[2024-05-26 13:00:44] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:00:46] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 2 ms to minimize.
[2024-05-26 13:00:46] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 3 ms to minimize.
[2024-05-26 13:00:46] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 3 ms to minimize.
[2024-05-26 13:00:46] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-05-26 13:00:47] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 2 ms to minimize.
[2024-05-26 13:00:47] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
[2024-05-26 13:00:47] [INFO ] Deduced a trap composed of 49 places in 88 ms of which 2 ms to minimize.
[2024-05-26 13:00:47] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 2 ms to minimize.
[2024-05-26 13:00:47] [INFO ] Deduced a trap composed of 89 places in 77 ms of which 2 ms to minimize.
[2024-05-26 13:00:47] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
[2024-05-26 13:00:47] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 2 ms to minimize.
[2024-05-26 13:00:48] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 2 ms to minimize.
[2024-05-26 13:00:48] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 2 ms to minimize.
[2024-05-26 13:00:48] [INFO ] Deduced a trap composed of 49 places in 90 ms of which 2 ms to minimize.
[2024-05-26 13:00:48] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
[2024-05-26 13:00:48] [INFO ] Deduced a trap composed of 68 places in 78 ms of which 2 ms to minimize.
[2024-05-26 13:00:49] [INFO ] Deduced a trap composed of 52 places in 74 ms of which 4 ms to minimize.
[2024-05-26 13:00:49] [INFO ] Deduced a trap composed of 69 places in 84 ms of which 2 ms to minimize.
[2024-05-26 13:00:49] [INFO ] Deduced a trap composed of 87 places in 84 ms of which 2 ms to minimize.
[2024-05-26 13:00:49] [INFO ] Deduced a trap composed of 51 places in 132 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:00:50] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 2 ms to minimize.
[2024-05-26 13:00:51] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 2 ms to minimize.
[2024-05-26 13:00:51] [INFO ] Deduced a trap composed of 73 places in 128 ms of which 2 ms to minimize.
[2024-05-26 13:00:51] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 3 ms to minimize.
[2024-05-26 13:00:51] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 2 ms to minimize.
[2024-05-26 13:00:51] [INFO ] Deduced a trap composed of 70 places in 74 ms of which 1 ms to minimize.
[2024-05-26 13:00:52] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 2 ms to minimize.
[2024-05-26 13:00:52] [INFO ] Deduced a trap composed of 54 places in 110 ms of which 2 ms to minimize.
[2024-05-26 13:00:52] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 2 ms to minimize.
[2024-05-26 13:00:52] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 1 ms to minimize.
[2024-05-26 13:00:53] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 2 ms to minimize.
[2024-05-26 13:00:53] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 2 ms to minimize.
[2024-05-26 13:00:53] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 2 ms to minimize.
[2024-05-26 13:00:53] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 2 ms to minimize.
[2024-05-26 13:00:54] [INFO ] Deduced a trap composed of 31 places in 180 ms of which 3 ms to minimize.
[2024-05-26 13:00:54] [INFO ] Deduced a trap composed of 51 places in 173 ms of which 4 ms to minimize.
[2024-05-26 13:00:54] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 2 ms to minimize.
[2024-05-26 13:00:55] [INFO ] Deduced a trap composed of 56 places in 91 ms of which 2 ms to minimize.
[2024-05-26 13:00:55] [INFO ] Deduced a trap composed of 71 places in 87 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 19/90 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:00:57] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 1 ms to minimize.
[2024-05-26 13:00:58] [INFO ] Deduced a trap composed of 57 places in 139 ms of which 2 ms to minimize.
[2024-05-26 13:00:58] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 2 ms to minimize.
[2024-05-26 13:00:58] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 2 ms to minimize.
[2024-05-26 13:00:58] [INFO ] Deduced a trap composed of 70 places in 100 ms of which 2 ms to minimize.
[2024-05-26 13:00:59] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 6/96 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:01:02] [INFO ] Deduced a trap composed of 70 places in 91 ms of which 2 ms to minimize.
[2024-05-26 13:01:04] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 2 ms to minimize.
[2024-05-26 13:01:04] [INFO ] Deduced a trap composed of 62 places in 113 ms of which 2 ms to minimize.
[2024-05-26 13:01:04] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 1 ms to minimize.
[2024-05-26 13:01:04] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 2 ms to minimize.
[2024-05-26 13:01:04] [INFO ] Deduced a trap composed of 71 places in 99 ms of which 2 ms to minimize.
[2024-05-26 13:01:05] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 7/103 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/552 variables, and 103 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 7/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/244 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 92/92 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 92/103 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:01:07] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
[2024-05-26 13:01:09] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (OVERLAPS) 4/244 variables, 4/109 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (OVERLAPS) 308/552 variables, 244/353 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 57/410 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/552 variables, 328/738 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/552 variables, and 738 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 94/94 constraints]
After SMT, in 60419ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60474ms
Finished structural reductions in LTL mode , in 1 iterations and 61422 ms. Remains : 244/244 places, 332/332 transitions.
Support contains 244 out of 244 places after structural reductions.
[2024-05-26 13:01:35] [INFO ] Flatten gal took : 80 ms
[2024-05-26 13:01:36] [INFO ] Flatten gal took : 63 ms
[2024-05-26 13:01:36] [INFO ] Input system was already deterministic with 332 transitions.
Reduction of identical properties reduced properties to check from 23 to 22
RANDOM walk for 40000 steps (8 resets) in 2045 ms. (19 steps per ms) remains 2/22 properties
BEST_FIRST walk for 40004 steps (8 resets) in 551 ms. (72 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 556 ms. (71 steps per ms) remains 2/2 properties
[2024-05-26 13:01:37] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 13:01:37] [INFO ] Invariant cache hit.
[2024-05-26 13:01:37] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 204/228 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/232 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 308/540 variables, 232/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 57/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 12/552 variables, 12/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/552 variables, 3/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/552 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 316 constraints, problems are : Problem set: 0 solved, 2 unsolved in 631 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 204/228 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/232 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 308/540 variables, 232/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 57/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 12/552 variables, 12/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 3/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 13:01:38] [INFO ] Deduced a trap composed of 16 places in 267 ms of which 3 ms to minimize.
[2024-05-26 13:01:39] [INFO ] Deduced a trap composed of 17 places in 271 ms of which 3 ms to minimize.
[2024-05-26 13:01:39] [INFO ] Deduced a trap composed of 35 places in 177 ms of which 2 ms to minimize.
[2024-05-26 13:01:39] [INFO ] Deduced a trap composed of 53 places in 130 ms of which 3 ms to minimize.
[2024-05-26 13:01:39] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 2 ms to minimize.
[2024-05-26 13:01:39] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-05-26 13:01:39] [INFO ] Deduced a trap composed of 9 places in 270 ms of which 4 ms to minimize.
[2024-05-26 13:01:40] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 4 ms to minimize.
[2024-05-26 13:01:40] [INFO ] Deduced a trap composed of 94 places in 408 ms of which 42 ms to minimize.
[2024-05-26 13:01:41] [INFO ] Deduced a trap composed of 75 places in 531 ms of which 2 ms to minimize.
[2024-05-26 13:01:41] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 2 ms to minimize.
[2024-05-26 13:01:41] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 2 ms to minimize.
[2024-05-26 13:01:41] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 2 ms to minimize.
[2024-05-26 13:01:41] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 2 ms to minimize.
[2024-05-26 13:01:41] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 2 ms to minimize.
[2024-05-26 13:01:41] [INFO ] Deduced a trap composed of 55 places in 120 ms of which 2 ms to minimize.
[2024-05-26 13:01:42] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 2 ms to minimize.
[2024-05-26 13:01:42] [INFO ] Deduced a trap composed of 57 places in 105 ms of which 2 ms to minimize.
[2024-05-26 13:01:42] [INFO ] Deduced a trap composed of 55 places in 115 ms of which 2 ms to minimize.
[2024-05-26 13:01:42] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/552 variables, 20/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 13:01:42] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 2 ms to minimize.
[2024-05-26 13:01:42] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 2 ms to minimize.
[2024-05-26 13:01:42] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 2 ms to minimize.
[2024-05-26 13:01:43] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 2 ms to minimize.
SMT process timed out in 5700ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 24 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 244 transition count 242
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 154 transition count 242
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 180 place count 154 transition count 195
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 274 place count 107 transition count 195
Applied a total of 274 rules in 59 ms. Remains 107 /244 variables (removed 137) and now considering 195/332 (removed 137) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 107/244 places, 195/332 transitions.
RANDOM walk for 40000 steps (8 resets) in 413 ms. (96 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
[2024-05-26 13:01:43] [INFO ] Flow matrix only has 171 transitions (discarded 24 similar events)
// Phase 1: matrix 171 rows 107 cols
[2024-05-26 13:01:43] [INFO ] Computed 15 invariants in 5 ms
[2024-05-26 13:01:43] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 79/91 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/95 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 171/266 variables, 95/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 57/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/278 variables, 12/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 3/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/278 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/278 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/278 variables, and 179 constraints, problems are : Problem set: 0 solved, 1 unsolved in 227 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 107/107 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 79/91 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/95 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 171/266 variables, 95/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 57/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/278 variables, 12/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 3/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/278 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 13:01:43] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-26 13:01:43] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-26 13:01:43] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-26 13:01:44] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-26 13:01:44] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2024-05-26 13:01:44] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
[2024-05-26 13:01:44] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 2 ms to minimize.
[2024-05-26 13:01:44] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-26 13:01:44] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-26 13:01:44] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-26 13:01:44] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 2 ms to minimize.
[2024-05-26 13:01:44] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-26 13:01:44] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-26 13:01:44] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-26 13:01:44] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-26 13:01:44] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-26 13:01:44] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-26 13:01:44] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-26 13:01:44] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-26 13:01:44] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/278 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 13:01:45] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 2 ms to minimize.
[2024-05-26 13:01:45] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/278 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/278 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/278 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 278/278 variables, and 202 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1520 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 107/107 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 22/22 constraints]
After SMT, in 1776ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 12 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 195/195 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 107 transition count 193
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 105 transition count 193
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 105 transition count 192
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 6 place count 104 transition count 192
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 2 with 16 rules applied. Total rules applied 22 place count 96 transition count 184
Applied a total of 22 rules in 26 ms. Remains 96 /107 variables (removed 11) and now considering 184/195 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 96/107 places, 184/195 transitions.
RANDOM walk for 40000 steps (8 resets) in 521 ms. (76 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 83 steps, run visited all 1 properties in 9 ms. (steps per millisecond=9 )
Probabilistic random walk after 83 steps, saw 69 distinct states, run finished after 15 ms. (steps per millisecond=5 ) properties seen :1
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(F((p0||G(p1)))))'
Support contains 16 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 244 transition count 238
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 1 with 94 rules applied. Total rules applied 188 place count 150 transition count 238
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 188 place count 150 transition count 196
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 272 place count 108 transition count 196
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 2 with 8 rules applied. Total rules applied 280 place count 104 transition count 192
Applied a total of 280 rules in 42 ms. Remains 104 /244 variables (removed 140) and now considering 192/332 (removed 140) transitions.
[2024-05-26 13:01:45] [INFO ] Flow matrix only has 168 transitions (discarded 24 similar events)
// Phase 1: matrix 168 rows 104 cols
[2024-05-26 13:01:45] [INFO ] Computed 15 invariants in 3 ms
[2024-05-26 13:01:46] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-26 13:01:46] [INFO ] Flow matrix only has 168 transitions (discarded 24 similar events)
[2024-05-26 13:01:46] [INFO ] Invariant cache hit.
[2024-05-26 13:01:46] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-26 13:01:46] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
[2024-05-26 13:01:46] [INFO ] Redundant transitions in 8 ms returned []
Running 188 sub problems to find dead transitions.
[2024-05-26 13:01:46] [INFO ] Flow matrix only has 168 transitions (discarded 24 similar events)
[2024-05-26 13:01:46] [INFO ] Invariant cache hit.
[2024-05-26 13:01:46] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-26 13:01:47] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-26 13:01:47] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-05-26 13:01:47] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 2 ms to minimize.
[2024-05-26 13:01:47] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-05-26 13:01:47] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-26 13:01:47] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-26 13:01:47] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-05-26 13:01:47] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-26 13:01:47] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-26 13:01:47] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-05-26 13:01:47] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 2 ms to minimize.
[2024-05-26 13:01:48] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 2 ms to minimize.
[2024-05-26 13:01:48] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-26 13:01:48] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-26 13:01:48] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-05-26 13:01:48] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-05-26 13:01:48] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-26 13:01:48] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-26 13:01:48] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-26 13:01:48] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-26 13:01:48] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 2 ms to minimize.
[2024-05-26 13:01:48] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-26 13:01:48] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-26 13:01:48] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 2 ms to minimize.
[2024-05-26 13:01:48] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-26 13:01:49] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-26 13:01:49] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 2 ms to minimize.
[2024-05-26 13:01:49] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-26 13:01:49] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 2 ms to minimize.
[2024-05-26 13:01:49] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-26 13:01:49] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-26 13:01:49] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-26 13:01:49] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-26 13:01:49] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-26 13:01:49] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-26 13:01:49] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-26 13:01:49] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-26 13:01:49] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-26 13:01:49] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 2 ms to minimize.
[2024-05-26 13:01:49] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-26 13:01:50] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-26 13:01:50] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-26 13:01:51] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-26 13:01:51] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-26 13:01:51] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-26 13:01:51] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-26 13:01:51] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-26 13:01:51] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-26 13:01:51] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 2 ms to minimize.
[2024-05-26 13:01:51] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-26 13:01:51] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-26 13:01:51] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-26 13:01:51] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 13/64 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-26 13:01:52] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-26 13:01:52] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-26 13:01:52] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-26 13:01:53] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-26 13:01:53] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 2 ms to minimize.
[2024-05-26 13:01:53] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 2 ms to minimize.
[2024-05-26 13:01:53] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 2 ms to minimize.
[2024-05-26 13:01:53] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-26 13:01:53] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-26 13:01:53] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 7/74 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 8 (OVERLAPS) 4/104 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-26 13:01:55] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 11 (OVERLAPS) 168/272 variables, 104/183 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 57/240 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 14 (OVERLAPS) 0/272 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 240 constraints, problems are : Problem set: 0 solved, 188 unsolved in 17285 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 64/64 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 4/104 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-26 13:02:05] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-26 13:02:06] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-26 13:02:06] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-26 13:02:07] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-26 13:02:08] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 1 ms to minimize.
[2024-05-26 13:02:08] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
[2024-05-26 13:02:08] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-26 13:02:09] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 12 (OVERLAPS) 168/272 variables, 104/191 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 57/248 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/272 variables, 188/436 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/272 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 16 (OVERLAPS) 0/272 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 436 constraints, problems are : Problem set: 0 solved, 188 unsolved in 16425 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 72/72 constraints]
After SMT, in 33774ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 33778ms
Starting structural reductions in SI_LTL mode, iteration 1 : 104/244 places, 192/332 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34251 ms. Remains : 104/244 places, 192/332 transitions.
Stuttering acceptance computed with spot in 391 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-3-LTLFireability-00
Product exploration explored 100000 steps with 9723 reset in 591 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA Peterson-COL-3-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-00 finished in 35316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(X(G(p1))))))'
Support contains 76 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 14 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-26 13:02:21] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-26 13:02:21] [INFO ] Computed 15 invariants in 2 ms
[2024-05-26 13:02:21] [INFO ] Implicit Places using invariants in 196 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 202 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 28 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 245 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : Peterson-COL-3-LTLFireability-01
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA Peterson-COL-3-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-3-LTLFireability-01 finished in 503 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0&&(G(p1)||G(p0)))))'
Support contains 56 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-26 13:02:21] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 13:02:21] [INFO ] Invariant cache hit.
[2024-05-26 13:02:21] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-26 13:02:21] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 13:02:21] [INFO ] Invariant cache hit.
[2024-05-26 13:02:22] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-26 13:02:22] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2024-05-26 13:02:22] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 13:02:22] [INFO ] Invariant cache hit.
[2024-05-26 13:02:22] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:02:24] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 2 ms to minimize.
[2024-05-26 13:02:24] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 2 ms to minimize.
[2024-05-26 13:02:25] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-26 13:02:25] [INFO ] Deduced a trap composed of 56 places in 119 ms of which 2 ms to minimize.
[2024-05-26 13:02:25] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 2 ms to minimize.
[2024-05-26 13:02:25] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 2 ms to minimize.
[2024-05-26 13:02:25] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 2 ms to minimize.
[2024-05-26 13:02:25] [INFO ] Deduced a trap composed of 56 places in 119 ms of which 2 ms to minimize.
[2024-05-26 13:02:25] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 2 ms to minimize.
[2024-05-26 13:02:25] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 2 ms to minimize.
[2024-05-26 13:02:26] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 2 ms to minimize.
[2024-05-26 13:02:26] [INFO ] Deduced a trap composed of 62 places in 116 ms of which 2 ms to minimize.
[2024-05-26 13:02:26] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 2 ms to minimize.
[2024-05-26 13:02:26] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2024-05-26 13:02:26] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 2 ms to minimize.
[2024-05-26 13:02:26] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 4 ms to minimize.
[2024-05-26 13:02:26] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 2 ms to minimize.
[2024-05-26 13:02:27] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 2 ms to minimize.
[2024-05-26 13:02:27] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 2 ms to minimize.
[2024-05-26 13:02:27] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:02:27] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 2 ms to minimize.
[2024-05-26 13:02:27] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 2 ms to minimize.
[2024-05-26 13:02:27] [INFO ] Deduced a trap composed of 56 places in 100 ms of which 2 ms to minimize.
[2024-05-26 13:02:27] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 2 ms to minimize.
[2024-05-26 13:02:27] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-26 13:02:27] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 2 ms to minimize.
[2024-05-26 13:02:28] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
[2024-05-26 13:02:28] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 2 ms to minimize.
[2024-05-26 13:02:28] [INFO ] Deduced a trap composed of 56 places in 167 ms of which 5 ms to minimize.
[2024-05-26 13:02:28] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-05-26 13:02:28] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 6 ms to minimize.
[2024-05-26 13:02:28] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 2 ms to minimize.
[2024-05-26 13:02:28] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 1 ms to minimize.
[2024-05-26 13:02:29] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 2 ms to minimize.
[2024-05-26 13:02:29] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2024-05-26 13:02:29] [INFO ] Deduced a trap composed of 53 places in 89 ms of which 1 ms to minimize.
[2024-05-26 13:02:29] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 2 ms to minimize.
[2024-05-26 13:02:29] [INFO ] Deduced a trap composed of 52 places in 96 ms of which 1 ms to minimize.
[2024-05-26 13:02:29] [INFO ] Deduced a trap composed of 52 places in 93 ms of which 1 ms to minimize.
[2024-05-26 13:02:29] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:02:31] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2024-05-26 13:02:32] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 2 ms to minimize.
[2024-05-26 13:02:32] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 2 ms to minimize.
[2024-05-26 13:02:32] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 4 ms to minimize.
[2024-05-26 13:02:32] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 1 ms to minimize.
[2024-05-26 13:02:32] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 1 ms to minimize.
[2024-05-26 13:02:33] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 2 ms to minimize.
[2024-05-26 13:02:33] [INFO ] Deduced a trap composed of 48 places in 80 ms of which 1 ms to minimize.
[2024-05-26 13:02:33] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 2 ms to minimize.
[2024-05-26 13:02:33] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 3 ms to minimize.
[2024-05-26 13:02:33] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 2 ms to minimize.
[2024-05-26 13:02:33] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 2 ms to minimize.
[2024-05-26 13:02:34] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 1 ms to minimize.
[2024-05-26 13:02:34] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 2 ms to minimize.
[2024-05-26 13:02:34] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 2 ms to minimize.
[2024-05-26 13:02:34] [INFO ] Deduced a trap composed of 68 places in 98 ms of which 2 ms to minimize.
[2024-05-26 13:02:35] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 2 ms to minimize.
[2024-05-26 13:02:35] [INFO ] Deduced a trap composed of 69 places in 106 ms of which 2 ms to minimize.
[2024-05-26 13:02:35] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 2 ms to minimize.
[2024-05-26 13:02:35] [INFO ] Deduced a trap composed of 51 places in 104 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:02:36] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 2 ms to minimize.
[2024-05-26 13:02:37] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 2 ms to minimize.
[2024-05-26 13:02:37] [INFO ] Deduced a trap composed of 73 places in 113 ms of which 5 ms to minimize.
[2024-05-26 13:02:37] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 2 ms to minimize.
[2024-05-26 13:02:37] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 2 ms to minimize.
[2024-05-26 13:02:37] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 2 ms to minimize.
[2024-05-26 13:02:38] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 1 ms to minimize.
[2024-05-26 13:02:38] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 2 ms to minimize.
[2024-05-26 13:02:38] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 2 ms to minimize.
[2024-05-26 13:02:38] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 1 ms to minimize.
[2024-05-26 13:02:39] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 3 ms to minimize.
[2024-05-26 13:02:39] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 2 ms to minimize.
[2024-05-26 13:02:39] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 1 ms to minimize.
[2024-05-26 13:02:39] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 2 ms to minimize.
[2024-05-26 13:02:39] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-26 13:02:40] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 2 ms to minimize.
[2024-05-26 13:02:40] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 2 ms to minimize.
[2024-05-26 13:02:40] [INFO ] Deduced a trap composed of 56 places in 95 ms of which 2 ms to minimize.
[2024-05-26 13:02:40] [INFO ] Deduced a trap composed of 71 places in 77 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 19/90 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:02:42] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 2 ms to minimize.
[2024-05-26 13:02:43] [INFO ] Deduced a trap composed of 57 places in 110 ms of which 2 ms to minimize.
[2024-05-26 13:02:43] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 1 ms to minimize.
[2024-05-26 13:02:43] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 1 ms to minimize.
[2024-05-26 13:02:43] [INFO ] Deduced a trap composed of 70 places in 88 ms of which 1 ms to minimize.
[2024-05-26 13:02:43] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 6/96 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:02:47] [INFO ] Deduced a trap composed of 70 places in 98 ms of which 1 ms to minimize.
[2024-05-26 13:02:49] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 2 ms to minimize.
[2024-05-26 13:02:49] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 2 ms to minimize.
[2024-05-26 13:02:49] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
[2024-05-26 13:02:49] [INFO ] Deduced a trap composed of 69 places in 91 ms of which 2 ms to minimize.
[2024-05-26 13:02:49] [INFO ] Deduced a trap composed of 71 places in 115 ms of which 1 ms to minimize.
[2024-05-26 13:02:49] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 7/103 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:02:51] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 2 ms to minimize.
SMT process timed out in 30116ms, After SMT, problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 30121ms
Finished structural reductions in LTL mode , in 1 iterations and 30771 ms. Remains : 244/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 191 ms :[true, (OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : Peterson-COL-3-LTLFireability-02
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 1 ms.
FORMULA Peterson-COL-3-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-3-LTLFireability-02 finished in 31026 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U ((X(!p2)||p1) U p3))))'
Support contains 72 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-26 13:02:52] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 13:02:52] [INFO ] Invariant cache hit.
[2024-05-26 13:02:52] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-26 13:02:52] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 13:02:52] [INFO ] Invariant cache hit.
[2024-05-26 13:02:53] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-26 13:02:53] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2024-05-26 13:02:53] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 13:02:53] [INFO ] Invariant cache hit.
[2024-05-26 13:02:53] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:02:55] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 3 ms to minimize.
[2024-05-26 13:02:55] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 4 ms to minimize.
[2024-05-26 13:02:55] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-26 13:02:55] [INFO ] Deduced a trap composed of 56 places in 135 ms of which 2 ms to minimize.
[2024-05-26 13:02:55] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 2 ms to minimize.
[2024-05-26 13:02:55] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 3 ms to minimize.
[2024-05-26 13:02:56] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 2 ms to minimize.
[2024-05-26 13:02:56] [INFO ] Deduced a trap composed of 56 places in 111 ms of which 2 ms to minimize.
[2024-05-26 13:02:56] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 2 ms to minimize.
[2024-05-26 13:02:56] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2024-05-26 13:02:56] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 2 ms to minimize.
[2024-05-26 13:02:56] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 2 ms to minimize.
[2024-05-26 13:02:56] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 2 ms to minimize.
[2024-05-26 13:02:56] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2024-05-26 13:02:56] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 2 ms to minimize.
[2024-05-26 13:02:57] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 2 ms to minimize.
[2024-05-26 13:02:57] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 3 ms to minimize.
[2024-05-26 13:02:57] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2024-05-26 13:02:57] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 2 ms to minimize.
[2024-05-26 13:02:57] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:02:57] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 1 ms to minimize.
[2024-05-26 13:02:57] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
[2024-05-26 13:02:58] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 2 ms to minimize.
[2024-05-26 13:02:58] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 2 ms to minimize.
[2024-05-26 13:02:58] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-26 13:02:58] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 2 ms to minimize.
[2024-05-26 13:02:58] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 2 ms to minimize.
[2024-05-26 13:02:58] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 1 ms to minimize.
[2024-05-26 13:02:58] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 2 ms to minimize.
[2024-05-26 13:02:58] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-05-26 13:02:58] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-05-26 13:02:59] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 2 ms to minimize.
[2024-05-26 13:02:59] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-05-26 13:02:59] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 2 ms to minimize.
[2024-05-26 13:02:59] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 2 ms to minimize.
[2024-05-26 13:02:59] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 2 ms to minimize.
[2024-05-26 13:02:59] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 2 ms to minimize.
[2024-05-26 13:02:59] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 2 ms to minimize.
[2024-05-26 13:02:59] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 2 ms to minimize.
[2024-05-26 13:02:59] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:03:01] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 2 ms to minimize.
[2024-05-26 13:03:02] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 2 ms to minimize.
[2024-05-26 13:03:02] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 2 ms to minimize.
[2024-05-26 13:03:02] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 2 ms to minimize.
[2024-05-26 13:03:02] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 1 ms to minimize.
[2024-05-26 13:03:02] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2024-05-26 13:03:03] [INFO ] Deduced a trap composed of 49 places in 101 ms of which 1 ms to minimize.
[2024-05-26 13:03:03] [INFO ] Deduced a trap composed of 48 places in 80 ms of which 2 ms to minimize.
[2024-05-26 13:03:03] [INFO ] Deduced a trap composed of 89 places in 85 ms of which 1 ms to minimize.
[2024-05-26 13:03:03] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 3 ms to minimize.
[2024-05-26 13:03:03] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 2 ms to minimize.
[2024-05-26 13:03:04] [INFO ] Deduced a trap composed of 53 places in 97 ms of which 2 ms to minimize.
[2024-05-26 13:03:04] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 1 ms to minimize.
[2024-05-26 13:03:04] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 3 ms to minimize.
[2024-05-26 13:03:04] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 2 ms to minimize.
[2024-05-26 13:03:04] [INFO ] Deduced a trap composed of 68 places in 94 ms of which 1 ms to minimize.
[2024-05-26 13:03:05] [INFO ] Deduced a trap composed of 52 places in 102 ms of which 1 ms to minimize.
[2024-05-26 13:03:05] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 1 ms to minimize.
[2024-05-26 13:03:05] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 1 ms to minimize.
[2024-05-26 13:03:05] [INFO ] Deduced a trap composed of 51 places in 119 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:03:06] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 1 ms to minimize.
[2024-05-26 13:03:07] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 2 ms to minimize.
[2024-05-26 13:03:07] [INFO ] Deduced a trap composed of 73 places in 112 ms of which 2 ms to minimize.
[2024-05-26 13:03:07] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 2 ms to minimize.
[2024-05-26 13:03:07] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 1 ms to minimize.
[2024-05-26 13:03:08] [INFO ] Deduced a trap composed of 70 places in 87 ms of which 2 ms to minimize.
[2024-05-26 13:03:08] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 1 ms to minimize.
[2024-05-26 13:03:08] [INFO ] Deduced a trap composed of 54 places in 93 ms of which 2 ms to minimize.
[2024-05-26 13:03:08] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 2 ms to minimize.
[2024-05-26 13:03:08] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 2 ms to minimize.
[2024-05-26 13:03:09] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 2 ms to minimize.
[2024-05-26 13:03:09] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 3 ms to minimize.
[2024-05-26 13:03:09] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 1 ms to minimize.
[2024-05-26 13:03:09] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 2 ms to minimize.
[2024-05-26 13:03:09] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-26 13:03:10] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 2 ms to minimize.
[2024-05-26 13:03:10] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 2 ms to minimize.
[2024-05-26 13:03:10] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 1 ms to minimize.
[2024-05-26 13:03:10] [INFO ] Deduced a trap composed of 71 places in 84 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 19/90 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:03:12] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2024-05-26 13:03:13] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 2 ms to minimize.
[2024-05-26 13:03:13] [INFO ] Deduced a trap composed of 61 places in 95 ms of which 2 ms to minimize.
[2024-05-26 13:03:13] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 2 ms to minimize.
[2024-05-26 13:03:13] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 2 ms to minimize.
[2024-05-26 13:03:14] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 6/96 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:03:17] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 2 ms to minimize.
[2024-05-26 13:03:19] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 2 ms to minimize.
[2024-05-26 13:03:19] [INFO ] Deduced a trap composed of 62 places in 104 ms of which 2 ms to minimize.
[2024-05-26 13:03:19] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 1 ms to minimize.
[2024-05-26 13:03:19] [INFO ] Deduced a trap composed of 69 places in 94 ms of which 2 ms to minimize.
[2024-05-26 13:03:19] [INFO ] Deduced a trap composed of 71 places in 115 ms of which 2 ms to minimize.
[2024-05-26 13:03:19] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 7/103 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:03:21] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/552 variables, and 104 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/244 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 93/93 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 93/104 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:03:26] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 2 ms to minimize.
[2024-05-26 13:03:27] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (OVERLAPS) 4/244 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (OVERLAPS) 308/552 variables, 244/354 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 57/411 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/552 variables, 328/739 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/552 variables, and 739 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 95/95 constraints]
After SMT, in 60123ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60130ms
Finished structural reductions in LTL mode , in 1 iterations and 60576 ms. Remains : 244/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p3) p2), true, (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : Peterson-COL-3-LTLFireability-03
Product exploration explored 100000 steps with 3831 reset in 520 ms.
Stack based approach found an accepted trace after 1278 steps with 45 reset with depth 44 and stack size 44 in 23 ms.
FORMULA Peterson-COL-3-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-03 finished in 61387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(X(G(p1))||G(p2))))'
Support contains 100 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-26 13:03:54] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 13:03:54] [INFO ] Invariant cache hit.
[2024-05-26 13:03:54] [INFO ] Implicit Places using invariants in 226 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 229 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 238 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 344 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : Peterson-COL-3-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-3-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-3-LTLFireability-04 finished in 628 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G(p0))&&G(p1)))))'
Support contains 88 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-26 13:03:54] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 13:03:54] [INFO ] Invariant cache hit.
[2024-05-26 13:03:54] [INFO ] Implicit Places using invariants in 218 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 233 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 240 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 347 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-COL-3-LTLFireability-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-3-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-3-LTLFireability-05 finished in 607 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&&X(G(p1))))))'
Support contains 64 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-26 13:03:55] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 13:03:55] [INFO ] Invariant cache hit.
[2024-05-26 13:03:55] [INFO ] Implicit Places using invariants in 144 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 161 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 166 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Peterson-COL-3-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 342 ms.
Stack based approach found an accepted trace after 58 steps with 0 reset with depth 59 and stack size 59 in 1 ms.
FORMULA Peterson-COL-3-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-06 finished in 675 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 40 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 244 transition count 272
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 120 place count 184 transition count 272
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 120 place count 184 transition count 224
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 216 place count 136 transition count 224
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 240 place count 124 transition count 212
Applied a total of 240 rules in 22 ms. Remains 124 /244 variables (removed 120) and now considering 212/332 (removed 120) transitions.
[2024-05-26 13:03:56] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
// Phase 1: matrix 188 rows 124 cols
[2024-05-26 13:03:56] [INFO ] Computed 15 invariants in 2 ms
[2024-05-26 13:03:56] [INFO ] Implicit Places using invariants in 143 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 158 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/244 places, 212/332 transitions.
Applied a total of 0 rules in 6 ms. Remains 120 /120 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 189 ms. Remains : 120/244 places, 212/332 transitions.
Stuttering acceptance computed with spot in 38 ms :[p0]
Running random walk in product with property : Peterson-COL-3-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 482 ms.
Stack based approach found an accepted trace after 101 steps with 0 reset with depth 102 and stack size 100 in 0 ms.
FORMULA Peterson-COL-3-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-07 finished in 725 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 24 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-26 13:03:56] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-26 13:03:56] [INFO ] Computed 15 invariants in 2 ms
[2024-05-26 13:03:56] [INFO ] Implicit Places using invariants in 176 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 192 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 197 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-3-LTLFireability-08
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-3-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-3-LTLFireability-08 finished in 296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(((!p1&&(!p1 U (p2||G(!p1)))) U ((!p1 U (p2||G(!p1)))&&p3)))||p0))))'
Support contains 64 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-26 13:03:57] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 13:03:57] [INFO ] Invariant cache hit.
[2024-05-26 13:03:57] [INFO ] Implicit Places using invariants in 158 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 175 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 1 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 180 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : Peterson-COL-3-LTLFireability-09
Product exploration explored 100000 steps with 12368 reset in 946 ms.
Product exploration explored 100000 steps with 12434 reset in 959 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 p3) p2 (NOT p1)), (X (NOT p0)), (X (X p2)), (X (X (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p3 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 102 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) p1 (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 805 ms. (49 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 880 ms. (45 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 400 ms. (99 steps per ms) remains 2/2 properties
[2024-05-26 13:04:00] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2024-05-26 13:04:00] [INFO ] Computed 11 invariants in 2 ms
[2024-05-26 13:04:00] [INFO ] State equation strengthened by 57 read => feed constraints.
Problem apf4 is UNSAT
Problem apf7 is UNSAT
After SMT solving in domain Real declared 64/548 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 0/11 constraints, State Equation: 0/240 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 77ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p3) p2 (NOT p1)), (X (NOT p0)), (X (X p2)), (X (X (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p3 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR p0 (NOT p3) p1 p2)), (G (OR p0 (NOT p1) p2))]
False Knowledge obtained : [(F (NOT (OR p0 p1 p2))), (F p1), (F p0), (F (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p1 (NOT p2))))), (F p3), (F (NOT p2))]
Knowledge based reduction with 10 factoid took 278 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
[2024-05-26 13:04:01] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 13:04:01] [INFO ] Invariant cache hit.
[2024-05-26 13:04:01] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-26 13:04:01] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2024-05-26 13:04:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 13:04:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-26 13:04:02] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2024-05-26 13:04:02] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-26 13:04:02] [INFO ] [Nat]Added 57 Read/Feed constraints in 23 ms returned sat
[2024-05-26 13:04:02] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 30 ms.
[2024-05-26 13:04:03] [INFO ] Added : 165 causal constraints over 33 iterations in 1315 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Support contains 60 out of 240 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-26 13:04:03] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 13:04:03] [INFO ] Invariant cache hit.
[2024-05-26 13:04:03] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-26 13:04:03] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 13:04:03] [INFO ] Invariant cache hit.
[2024-05-26 13:04:04] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-26 13:04:04] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2024-05-26 13:04:04] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 13:04:04] [INFO ] Invariant cache hit.
[2024-05-26 13:04:04] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:04:06] [INFO ] Deduced a trap composed of 20 places in 160 ms of which 3 ms to minimize.
[2024-05-26 13:04:06] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 3 ms to minimize.
[2024-05-26 13:04:06] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 31 ms to minimize.
[2024-05-26 13:04:06] [INFO ] Deduced a trap composed of 20 places in 216 ms of which 11 ms to minimize.
[2024-05-26 13:04:07] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-26 13:04:07] [INFO ] Deduced a trap composed of 16 places in 253 ms of which 4 ms to minimize.
[2024-05-26 13:04:07] [INFO ] Deduced a trap composed of 33 places in 288 ms of which 9 ms to minimize.
[2024-05-26 13:04:07] [INFO ] Deduced a trap composed of 31 places in 255 ms of which 3 ms to minimize.
[2024-05-26 13:04:08] [INFO ] Deduced a trap composed of 58 places in 367 ms of which 2 ms to minimize.
[2024-05-26 13:04:08] [INFO ] Deduced a trap composed of 21 places in 317 ms of which 2 ms to minimize.
[2024-05-26 13:04:08] [INFO ] Deduced a trap composed of 29 places in 267 ms of which 31 ms to minimize.
[2024-05-26 13:04:09] [INFO ] Deduced a trap composed of 24 places in 213 ms of which 3 ms to minimize.
[2024-05-26 13:04:09] [INFO ] Deduced a trap composed of 58 places in 282 ms of which 42 ms to minimize.
[2024-05-26 13:04:09] [INFO ] Deduced a trap composed of 39 places in 230 ms of which 9 ms to minimize.
[2024-05-26 13:04:09] [INFO ] Deduced a trap composed of 17 places in 259 ms of which 4 ms to minimize.
[2024-05-26 13:04:10] [INFO ] Deduced a trap composed of 51 places in 113 ms of which 2 ms to minimize.
[2024-05-26 13:04:10] [INFO ] Deduced a trap composed of 53 places in 95 ms of which 2 ms to minimize.
[2024-05-26 13:04:10] [INFO ] Deduced a trap composed of 56 places in 120 ms of which 2 ms to minimize.
[2024-05-26 13:04:10] [INFO ] Deduced a trap composed of 56 places in 106 ms of which 2 ms to minimize.
[2024-05-26 13:04:10] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:04:10] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 2 ms to minimize.
[2024-05-26 13:04:11] [INFO ] Deduced a trap composed of 61 places in 138 ms of which 2 ms to minimize.
[2024-05-26 13:04:11] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 2 ms to minimize.
[2024-05-26 13:04:11] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 2 ms to minimize.
[2024-05-26 13:04:11] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 1 ms to minimize.
[2024-05-26 13:04:11] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2024-05-26 13:04:11] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 2 ms to minimize.
[2024-05-26 13:04:11] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 2 ms to minimize.
[2024-05-26 13:04:11] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-26 13:04:11] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-26 13:04:12] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 2 ms to minimize.
[2024-05-26 13:04:12] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 1 ms to minimize.
[2024-05-26 13:04:12] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
[2024-05-26 13:04:12] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 2 ms to minimize.
[2024-05-26 13:04:12] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 2 ms to minimize.
[2024-05-26 13:04:12] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 1 ms to minimize.
[2024-05-26 13:04:12] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 2 ms to minimize.
[2024-05-26 13:04:12] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 2 ms to minimize.
[2024-05-26 13:04:13] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 2 ms to minimize.
[2024-05-26 13:04:13] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:04:13] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 12 ms to minimize.
[2024-05-26 13:04:13] [INFO ] Deduced a trap composed of 58 places in 113 ms of which 2 ms to minimize.
[2024-05-26 13:04:14] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 2 ms to minimize.
[2024-05-26 13:04:14] [INFO ] Deduced a trap composed of 51 places in 118 ms of which 2 ms to minimize.
[2024-05-26 13:04:14] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 2 ms to minimize.
[2024-05-26 13:04:14] [INFO ] Deduced a trap composed of 58 places in 107 ms of which 2 ms to minimize.
[2024-05-26 13:04:14] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 2 ms to minimize.
[2024-05-26 13:04:14] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 2 ms to minimize.
[2024-05-26 13:04:14] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 2 ms to minimize.
[2024-05-26 13:04:14] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 2 ms to minimize.
[2024-05-26 13:04:15] [INFO ] Deduced a trap composed of 61 places in 126 ms of which 2 ms to minimize.
[2024-05-26 13:04:15] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 2 ms to minimize.
[2024-05-26 13:04:15] [INFO ] Deduced a trap composed of 53 places in 101 ms of which 2 ms to minimize.
[2024-05-26 13:04:15] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 2 ms to minimize.
[2024-05-26 13:04:15] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 2 ms to minimize.
[2024-05-26 13:04:15] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
[2024-05-26 13:04:15] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 2 ms to minimize.
[2024-05-26 13:04:16] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 2 ms to minimize.
[2024-05-26 13:04:16] [INFO ] Deduced a trap composed of 49 places in 90 ms of which 2 ms to minimize.
[2024-05-26 13:04:16] [INFO ] Deduced a trap composed of 48 places in 86 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:04:18] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 1 ms to minimize.
[2024-05-26 13:04:19] [INFO ] Deduced a trap composed of 52 places in 193 ms of which 2 ms to minimize.
[2024-05-26 13:04:19] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 2 ms to minimize.
[2024-05-26 13:04:19] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
[2024-05-26 13:04:19] [INFO ] Deduced a trap composed of 49 places in 95 ms of which 2 ms to minimize.
[2024-05-26 13:04:20] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 2 ms to minimize.
[2024-05-26 13:04:20] [INFO ] Deduced a trap composed of 52 places in 99 ms of which 2 ms to minimize.
[2024-05-26 13:04:21] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2024-05-26 13:04:21] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 2 ms to minimize.
[2024-05-26 13:04:21] [INFO ] Deduced a trap composed of 53 places in 108 ms of which 1 ms to minimize.
[2024-05-26 13:04:21] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 2 ms to minimize.
[2024-05-26 13:04:22] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 2 ms to minimize.
[2024-05-26 13:04:22] [INFO ] Deduced a trap composed of 80 places in 118 ms of which 1 ms to minimize.
[2024-05-26 13:04:22] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 14/85 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:04:23] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 2 ms to minimize.
[2024-05-26 13:04:24] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-26 13:04:24] [INFO ] Deduced a trap composed of 85 places in 75 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:04:26] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 2 ms to minimize.
[2024-05-26 13:04:28] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:04:32] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 1 ms to minimize.
[2024-05-26 13:04:33] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/548 variables, and 92 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/240 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 81/81 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 81/92 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:04:36] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 2 ms to minimize.
[2024-05-26 13:04:37] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:04:40] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:04:43] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (OVERLAPS) 308/548 variables, 240/336 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 57/393 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 328/721 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 721 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 240/240 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 85/85 constraints]
After SMT, in 60126ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60134ms
Finished structural reductions in LTL mode , in 1 iterations and 60688 ms. Remains : 240/240 places, 332/332 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 p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 123 steps (0 resets) in 6 ms. (17 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p3), (F p0), (F (NOT (AND (NOT p0) (NOT p3))))]
Knowledge based reduction with 4 factoid took 157 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
[2024-05-26 13:05:05] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 13:05:05] [INFO ] Invariant cache hit.
[2024-05-26 13:05:05] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-26 13:05:05] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2024-05-26 13:05:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 13:05:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-26 13:05:06] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2024-05-26 13:05:06] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-26 13:05:06] [INFO ] [Nat]Added 57 Read/Feed constraints in 24 ms returned sat
[2024-05-26 13:05:06] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 65 ms.
[2024-05-26 13:05:07] [INFO ] Added : 165 causal constraints over 33 iterations in 1221 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 12476 reset in 540 ms.
Product exploration explored 100000 steps with 12438 reset in 553 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 60 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 240 transition count 332
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 39 place count 240 transition count 332
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 place count 240 transition count 332
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 60 place count 240 transition count 332
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 68 place count 232 transition count 324
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 76 place count 232 transition count 324
Deduced a syphon composed of 52 places in 0 ms
Applied a total of 76 rules in 50 ms. Remains 232 /240 variables (removed 8) and now considering 324/332 (removed 8) transitions.
[2024-05-26 13:05:08] [INFO ] Redundant transitions in 20 ms returned []
Running 320 sub problems to find dead transitions.
[2024-05-26 13:05:08] [INFO ] Flow matrix only has 300 transitions (discarded 24 similar events)
// Phase 1: matrix 300 rows 232 cols
[2024-05-26 13:05:08] [INFO ] Computed 11 invariants in 1 ms
[2024-05-26 13:05:08] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-05-26 13:05:10] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 2 ms to minimize.
[2024-05-26 13:05:10] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-26 13:05:11] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 2 ms to minimize.
[2024-05-26 13:05:11] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 2 ms to minimize.
[2024-05-26 13:05:11] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 2 ms to minimize.
[2024-05-26 13:05:11] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 2 ms to minimize.
[2024-05-26 13:05:11] [INFO ] Deduced a trap composed of 56 places in 192 ms of which 3 ms to minimize.
[2024-05-26 13:05:11] [INFO ] Deduced a trap composed of 37 places in 196 ms of which 2 ms to minimize.
[2024-05-26 13:05:12] [INFO ] Deduced a trap composed of 8 places in 199 ms of which 21 ms to minimize.
[2024-05-26 13:05:12] [INFO ] Deduced a trap composed of 8 places in 203 ms of which 9 ms to minimize.
[2024-05-26 13:05:12] [INFO ] Deduced a trap composed of 21 places in 286 ms of which 2 ms to minimize.
[2024-05-26 13:05:13] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 1 ms to minimize.
[2024-05-26 13:05:13] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2024-05-26 13:05:13] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 1 ms to minimize.
[2024-05-26 13:05:13] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 4 ms to minimize.
[2024-05-26 13:05:13] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-05-26 13:05:13] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 1 ms to minimize.
[2024-05-26 13:05:13] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 2 ms to minimize.
[2024-05-26 13:05:13] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-26 13:05:13] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-05-26 13:05:14] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
[2024-05-26 13:05:14] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-05-26 13:05:14] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
[2024-05-26 13:05:14] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
[2024-05-26 13:05:14] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 2 ms to minimize.
[2024-05-26 13:05:14] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 2 ms to minimize.
[2024-05-26 13:05:15] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 24 ms to minimize.
[2024-05-26 13:05:15] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
[2024-05-26 13:05:15] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 2 ms to minimize.
[2024-05-26 13:05:15] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 1 ms to minimize.
[2024-05-26 13:05:15] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
[2024-05-26 13:05:15] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 1 ms to minimize.
[2024-05-26 13:05:15] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 1 ms to minimize.
Problem TDEAD76 is UNSAT
[2024-05-26 13:05:15] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 1 ms to minimize.
Problem TDEAD77 is UNSAT
[2024-05-26 13:05:16] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 1 ms to minimize.
[2024-05-26 13:05:16] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-05-26 13:05:16] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
[2024-05-26 13:05:16] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 2 ms to minimize.
[2024-05-26 13:05:16] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 2 ms to minimize.
[2024-05-26 13:05:16] [INFO ] Deduced a trap composed of 55 places in 99 ms of which 2 ms to minimize.
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 20/51 constraints. Problems are: Problem set: 52 solved, 268 unsolved
[2024-05-26 13:05:16] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-26 13:05:16] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 2 ms to minimize.
[2024-05-26 13:05:17] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 2 ms to minimize.
[2024-05-26 13:05:17] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 2 ms to minimize.
[2024-05-26 13:05:17] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 2 ms to minimize.
[2024-05-26 13:05:17] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 2 ms to minimize.
[2024-05-26 13:05:17] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 5 ms to minimize.
[2024-05-26 13:05:18] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 2 ms to minimize.
[2024-05-26 13:05:18] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 3 ms to minimize.
[2024-05-26 13:05:18] [INFO ] Deduced a trap composed of 54 places in 108 ms of which 2 ms to minimize.
[2024-05-26 13:05:18] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 1 ms to minimize.
[2024-05-26 13:05:18] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 2 ms to minimize.
[2024-05-26 13:05:18] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 1 ms to minimize.
[2024-05-26 13:05:19] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 2 ms to minimize.
[2024-05-26 13:05:19] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 2 ms to minimize.
[2024-05-26 13:05:19] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2024-05-26 13:05:19] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 2 ms to minimize.
[2024-05-26 13:05:20] [INFO ] Deduced a trap composed of 53 places in 101 ms of which 2 ms to minimize.
[2024-05-26 13:05:20] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 2 ms to minimize.
[2024-05-26 13:05:20] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 20/71 constraints. Problems are: Problem set: 52 solved, 268 unsolved
[2024-05-26 13:05:23] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 1/72 constraints. Problems are: Problem set: 52 solved, 268 unsolved
[2024-05-26 13:05:26] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 1/73 constraints. Problems are: Problem set: 52 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/73 constraints. Problems are: Problem set: 52 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 300/532 variables, 232/305 constraints. Problems are: Problem set: 52 solved, 268 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 57/362 constraints. Problems are: Problem set: 52 solved, 268 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/532 variables, 0/362 constraints. Problems are: Problem set: 52 solved, 268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/532 variables, and 362 constraints, problems are : Problem set: 52 solved, 268 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 232/232 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 52 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 7/7 constraints. Problems are: Problem set: 52 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 62/69 constraints. Problems are: Problem set: 52 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/69 constraints. Problems are: Problem set: 52 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 52/232 variables, 4/73 constraints. Problems are: Problem set: 52 solved, 268 unsolved
[2024-05-26 13:05:42] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 2 ms to minimize.
[2024-05-26 13:05:44] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 2 ms to minimize.
[2024-05-26 13:05:44] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 3/76 constraints. Problems are: Problem set: 52 solved, 268 unsolved
[2024-05-26 13:05:46] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 1/77 constraints. Problems are: Problem set: 52 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/77 constraints. Problems are: Problem set: 52 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 300/532 variables, 232/309 constraints. Problems are: Problem set: 52 solved, 268 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 57/366 constraints. Problems are: Problem set: 52 solved, 268 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/532 variables, 268/634 constraints. Problems are: Problem set: 52 solved, 268 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 0/634 constraints. Problems are: Problem set: 52 solved, 268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/532 variables, and 634 constraints, problems are : Problem set: 52 solved, 268 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 232/232 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 268/320 constraints, Known Traps: 66/66 constraints]
After SMT, in 60097ms problems are : Problem set: 52 solved, 268 unsolved
Search for dead transitions found 52 dead transitions in 60102ms
Found 52 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 52 transitions
Dead transitions reduction (with SMT) removed 52 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 232/240 places, 272/332 transitions.
Graph (complete) has 576 edges and 232 vertex of which 180 are kept as prefixes of interest. Removing 52 places using SCC suffix rule.3 ms
Discarding 52 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 31 ms. Remains 180 /232 variables (removed 52) and now considering 272/272 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 180/240 places, 272/332 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60214 ms. Remains : 180/240 places, 272/332 transitions.
Support contains 60 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-26 13:06:09] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2024-05-26 13:06:09] [INFO ] Computed 11 invariants in 2 ms
[2024-05-26 13:06:09] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-26 13:06:09] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 13:06:09] [INFO ] Invariant cache hit.
[2024-05-26 13:06:09] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-26 13:06:09] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2024-05-26 13:06:09] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 13:06:09] [INFO ] Invariant cache hit.
[2024-05-26 13:06:09] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:06:11] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 3 ms to minimize.
[2024-05-26 13:06:11] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 2 ms to minimize.
[2024-05-26 13:06:12] [INFO ] Deduced a trap composed of 12 places in 203 ms of which 2 ms to minimize.
[2024-05-26 13:06:12] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 3 ms to minimize.
[2024-05-26 13:06:12] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-26 13:06:12] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 3 ms to minimize.
[2024-05-26 13:06:12] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 2 ms to minimize.
[2024-05-26 13:06:12] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 2 ms to minimize.
[2024-05-26 13:06:12] [INFO ] Deduced a trap composed of 58 places in 129 ms of which 2 ms to minimize.
[2024-05-26 13:06:13] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 2 ms to minimize.
[2024-05-26 13:06:13] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 3 ms to minimize.
[2024-05-26 13:06:13] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 2 ms to minimize.
[2024-05-26 13:06:13] [INFO ] Deduced a trap composed of 58 places in 126 ms of which 2 ms to minimize.
[2024-05-26 13:06:13] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 2 ms to minimize.
[2024-05-26 13:06:13] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 2 ms to minimize.
[2024-05-26 13:06:13] [INFO ] Deduced a trap composed of 51 places in 137 ms of which 2 ms to minimize.
[2024-05-26 13:06:13] [INFO ] Deduced a trap composed of 53 places in 93 ms of which 1 ms to minimize.
[2024-05-26 13:06:14] [INFO ] Deduced a trap composed of 56 places in 119 ms of which 2 ms to minimize.
[2024-05-26 13:06:14] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 2 ms to minimize.
[2024-05-26 13:06:14] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:06:14] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 2 ms to minimize.
[2024-05-26 13:06:14] [INFO ] Deduced a trap composed of 61 places in 133 ms of which 2 ms to minimize.
[2024-05-26 13:06:14] [INFO ] Deduced a trap composed of 50 places in 113 ms of which 3 ms to minimize.
[2024-05-26 13:06:15] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 3 ms to minimize.
[2024-05-26 13:06:15] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 1 ms to minimize.
[2024-05-26 13:06:15] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 1 ms to minimize.
[2024-05-26 13:06:15] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 2 ms to minimize.
[2024-05-26 13:06:15] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 2 ms to minimize.
[2024-05-26 13:06:15] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-26 13:06:15] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-26 13:06:15] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 3 ms to minimize.
[2024-05-26 13:06:15] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 2 ms to minimize.
[2024-05-26 13:06:16] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 2 ms to minimize.
[2024-05-26 13:06:16] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-05-26 13:06:16] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 2 ms to minimize.
[2024-05-26 13:06:16] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-05-26 13:06:16] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 2 ms to minimize.
[2024-05-26 13:06:16] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 2 ms to minimize.
[2024-05-26 13:06:16] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 2 ms to minimize.
[2024-05-26 13:06:16] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:06:17] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 2 ms to minimize.
[2024-05-26 13:06:17] [INFO ] Deduced a trap composed of 58 places in 88 ms of which 2 ms to minimize.
[2024-05-26 13:06:17] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 2 ms to minimize.
[2024-05-26 13:06:17] [INFO ] Deduced a trap composed of 51 places in 118 ms of which 2 ms to minimize.
[2024-05-26 13:06:17] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 2 ms to minimize.
[2024-05-26 13:06:18] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 1 ms to minimize.
[2024-05-26 13:06:18] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 2 ms to minimize.
[2024-05-26 13:06:18] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 2 ms to minimize.
[2024-05-26 13:06:18] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 2 ms to minimize.
[2024-05-26 13:06:18] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 2 ms to minimize.
[2024-05-26 13:06:18] [INFO ] Deduced a trap composed of 61 places in 120 ms of which 2 ms to minimize.
[2024-05-26 13:06:18] [INFO ] Deduced a trap composed of 73 places in 110 ms of which 2 ms to minimize.
[2024-05-26 13:06:18] [INFO ] Deduced a trap composed of 53 places in 98 ms of which 2 ms to minimize.
[2024-05-26 13:06:19] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 2 ms to minimize.
[2024-05-26 13:06:19] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 2 ms to minimize.
[2024-05-26 13:06:19] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 1 ms to minimize.
[2024-05-26 13:06:19] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2024-05-26 13:06:19] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 1 ms to minimize.
[2024-05-26 13:06:19] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 2 ms to minimize.
[2024-05-26 13:06:19] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:06:22] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 1 ms to minimize.
[2024-05-26 13:06:22] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 2 ms to minimize.
[2024-05-26 13:06:22] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-05-26 13:06:23] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
[2024-05-26 13:06:23] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 2 ms to minimize.
[2024-05-26 13:06:23] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 2 ms to minimize.
[2024-05-26 13:06:24] [INFO ] Deduced a trap composed of 52 places in 99 ms of which 1 ms to minimize.
[2024-05-26 13:06:24] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2024-05-26 13:06:25] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2024-05-26 13:06:25] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 2 ms to minimize.
[2024-05-26 13:06:25] [INFO ] Deduced a trap composed of 81 places in 79 ms of which 2 ms to minimize.
[2024-05-26 13:06:25] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 2 ms to minimize.
[2024-05-26 13:06:25] [INFO ] Deduced a trap composed of 80 places in 104 ms of which 1 ms to minimize.
[2024-05-26 13:06:25] [INFO ] Deduced a trap composed of 57 places in 91 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 14/85 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:06:26] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 1 ms to minimize.
[2024-05-26 13:06:27] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-26 13:06:28] [INFO ] Deduced a trap composed of 85 places in 84 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:06:29] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 2 ms to minimize.
[2024-05-26 13:06:31] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:06:35] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 1 ms to minimize.
[2024-05-26 13:06:36] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/548 variables, and 92 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/240 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 81/81 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 81/92 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:06:41] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 2 ms to minimize.
[2024-05-26 13:06:43] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:06:45] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 13:06:48] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (OVERLAPS) 308/548 variables, 240/336 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 57/393 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 328/721 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 721 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 240/240 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 85/85 constraints]
After SMT, in 60117ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60122ms
Finished structural reductions in LTL mode , in 1 iterations and 60772 ms. Remains : 240/240 places, 332/332 transitions.
Treatment of property Peterson-COL-3-LTLFireability-09 finished in 193038 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 40 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-26 13:07:10] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-26 13:07:10] [INFO ] Computed 15 invariants in 2 ms
[2024-05-26 13:07:10] [INFO ] Implicit Places using invariants in 453 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 454 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 463 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-3-LTLFireability-10
Product exploration explored 100000 steps with 489 reset in 308 ms.
Stack based approach found an accepted trace after 126 steps with 1 reset with depth 67 and stack size 67 in 1 ms.
FORMULA Peterson-COL-3-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-10 finished in 951 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||G(p1)))))'
Support contains 24 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 244 transition count 269
Reduce places removed 63 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 72 rules applied. Total rules applied 135 place count 181 transition count 260
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 144 place count 172 transition count 260
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 144 place count 172 transition count 212
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 240 place count 124 transition count 212
Applied a total of 240 rules in 17 ms. Remains 124 /244 variables (removed 120) and now considering 212/332 (removed 120) transitions.
[2024-05-26 13:07:11] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
// Phase 1: matrix 188 rows 124 cols
[2024-05-26 13:07:11] [INFO ] Computed 15 invariants in 2 ms
[2024-05-26 13:07:11] [INFO ] Implicit Places using invariants in 141 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 142 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/244 places, 212/332 transitions.
Applied a total of 0 rules in 6 ms. Remains 120 /120 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 165 ms. Remains : 120/244 places, 212/332 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-3-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 178 ms.
Product exploration explored 100000 steps with 0 reset in 233 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 p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 166 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 184 ms. (216 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
[2024-05-26 13:07:12] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
// Phase 1: matrix 188 rows 120 cols
[2024-05-26 13:07:12] [INFO ] Computed 11 invariants in 1 ms
[2024-05-26 13:07:12] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 80/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/108 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 188/296 variables, 108/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 57/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 12/308 variables, 12/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 3/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/308 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 188 constraints, problems are : Problem set: 0 solved, 2 unsolved in 195 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 120/120 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 80/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 13:07:12] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-26 13:07:12] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-05-26 13:07:12] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-26 13:07:12] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 4/108 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 188/296 variables, 108/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 57/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/296 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 12/308 variables, 12/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/308 variables, 3/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 13:07:12] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-26 13:07:12] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-26 13:07:12] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-26 13:07:13] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-26 13:07:13] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-26 13:07:13] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-26 13:07:13] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-26 13:07:13] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-26 13:07:13] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-26 13:07:13] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/308 variables, 10/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 13:07:13] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-26 13:07:13] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 2 ms to minimize.
[2024-05-26 13:07:13] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/308 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/308 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/308 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 207 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1268 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 120/120 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 17/17 constraints]
After SMT, in 1474ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 80 ms.
Support contains 24 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 212/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 120 /120 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 120/120 places, 212/212 transitions.
RANDOM walk for 40000 steps (8 resets) in 319 ms. (125 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 134378 steps, run visited all 2 properties in 442 ms. (steps per millisecond=304 )
Probabilistic random walk after 134378 steps, saw 27163 distinct states, run finished after 443 ms. (steps per millisecond=303 ) properties seen :2
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 239 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 24 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 212/212 transitions.
Applied a total of 0 rules in 4 ms. Remains 120 /120 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2024-05-26 13:07:14] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
[2024-05-26 13:07:14] [INFO ] Invariant cache hit.
[2024-05-26 13:07:14] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-26 13:07:14] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
[2024-05-26 13:07:14] [INFO ] Invariant cache hit.
[2024-05-26 13:07:15] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-26 13:07:15] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2024-05-26 13:07:15] [INFO ] Redundant transitions in 3 ms returned []
Running 208 sub problems to find dead transitions.
[2024-05-26 13:07:15] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
[2024-05-26 13:07:15] [INFO ] Invariant cache hit.
[2024-05-26 13:07:15] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 208 unsolved
[2024-05-26 13:07:16] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-26 13:07:16] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-26 13:07:16] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-26 13:07:16] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 2 ms to minimize.
[2024-05-26 13:07:16] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-26 13:07:16] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-26 13:07:16] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 2 ms to minimize.
[2024-05-26 13:07:16] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 2 ms to minimize.
[2024-05-26 13:07:16] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-26 13:07:16] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 2 ms to minimize.
[2024-05-26 13:07:16] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-26 13:07:16] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-26 13:07:16] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-26 13:07:16] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-26 13:07:16] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-26 13:07:17] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 2 ms to minimize.
[2024-05-26 13:07:17] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 2 ms to minimize.
[2024-05-26 13:07:17] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-26 13:07:17] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-26 13:07:17] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 208 unsolved
[2024-05-26 13:07:17] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-26 13:07:17] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 2 ms to minimize.
[2024-05-26 13:07:17] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 2 ms to minimize.
[2024-05-26 13:07:17] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 2 ms to minimize.
[2024-05-26 13:07:17] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-26 13:07:17] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 2 ms to minimize.
[2024-05-26 13:07:17] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-26 13:07:17] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-26 13:07:17] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-26 13:07:17] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-26 13:07:17] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 2 ms to minimize.
[2024-05-26 13:07:18] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-26 13:07:18] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-26 13:07:18] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-26 13:07:18] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 2 ms to minimize.
[2024-05-26 13:07:18] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 2 ms to minimize.
[2024-05-26 13:07:18] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-26 13:07:18] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-26 13:07:18] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-26 13:07:18] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 208 unsolved
[2024-05-26 13:07:18] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-26 13:07:18] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-26 13:07:18] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-26 13:07:18] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-26 13:07:19] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-26 13:07:19] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-26 13:07:19] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-26 13:07:19] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-26 13:07:19] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 2 ms to minimize.
[2024-05-26 13:07:19] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-26 13:07:19] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 2 ms to minimize.
[2024-05-26 13:07:19] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 2 ms to minimize.
[2024-05-26 13:07:19] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-26 13:07:19] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-26 13:07:19] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-05-26 13:07:19] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-26 13:07:19] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-26 13:07:20] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-26 13:07:20] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 2 ms to minimize.
[2024-05-26 13:07:20] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 208 unsolved
[2024-05-26 13:07:21] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-26 13:07:21] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 2 ms to minimize.
[2024-05-26 13:07:21] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 2 ms to minimize.
[2024-05-26 13:07:21] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-26 13:07:21] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-26 13:07:22] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-26 13:07:22] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-26 13:07:22] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
[2024-05-26 13:07:22] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-26 13:07:22] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 208 unsolved
[2024-05-26 13:07:22] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-26 13:07:23] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 2 ms to minimize.
[2024-05-26 13:07:23] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-26 13:07:23] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-05-26 13:07:23] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-05-26 13:07:23] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 2 ms to minimize.
[2024-05-26 13:07:23] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 7/88 constraints. Problems are: Problem set: 0 solved, 208 unsolved
[2024-05-26 13:07:24] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-26 13:07:24] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-05-26 13:07:24] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 2 ms to minimize.
[2024-05-26 13:07:24] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-26 13:07:25] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 5/93 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 188/308 variables, 120/213 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 57/270 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 11 (OVERLAPS) 0/308 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 270 constraints, problems are : Problem set: 0 solved, 208 unsolved in 21226 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 120/120 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 82/82 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 82/93 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (OVERLAPS) 188/308 variables, 120/213 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 57/270 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 208/478 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/308 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 478 constraints, problems are : Problem set: 0 solved, 208 unsolved in 15213 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 120/120 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 82/82 constraints]
After SMT, in 36517ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 36521ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36880 ms. Remains : 120/120 places, 212/212 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 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 137 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 341 ms. (116 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
[2024-05-26 13:07:52] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
[2024-05-26 13:07:52] [INFO ] Invariant cache hit.
[2024-05-26 13:07:52] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 80/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/108 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 188/296 variables, 108/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 57/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 12/308 variables, 12/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 3/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/308 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 188 constraints, problems are : Problem set: 0 solved, 2 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 120/120 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 80/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 13:07:52] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-26 13:07:52] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-05-26 13:07:52] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 1 ms to minimize.
[2024-05-26 13:07:52] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 13:07:52] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 2 ms to minimize.
[2024-05-26 13:07:52] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 1 ms to minimize.
[2024-05-26 13:07:52] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-05-26 13:07:53] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/108 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 188/296 variables, 108/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 57/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/296 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/296 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 12/308 variables, 12/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/308 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 13:07:53] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-05-26 13:07:53] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2024-05-26 13:07:53] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-05-26 13:07:53] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/308 variables, 4/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/308 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/308 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 202 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1204 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 120/120 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 12/12 constraints]
After SMT, in 1417ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 46 ms.
Support contains 24 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 212/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 120 /120 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 120/120 places, 212/212 transitions.
RANDOM walk for 40000 steps (8 resets) in 763 ms. (52 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 320 ms. (124 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 134378 steps, run visited all 2 properties in 323 ms. (steps per millisecond=416 )
Probabilistic random walk after 134378 steps, saw 27163 distinct states, run finished after 323 ms. (steps per millisecond=416 ) properties seen :2
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 242 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 178 ms.
Product exploration explored 100000 steps with 0 reset in 198 ms.
Support contains 24 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 212/212 transitions.
Applied a total of 0 rules in 4 ms. Remains 120 /120 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2024-05-26 13:07:55] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
[2024-05-26 13:07:55] [INFO ] Invariant cache hit.
[2024-05-26 13:07:55] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-26 13:07:55] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
[2024-05-26 13:07:55] [INFO ] Invariant cache hit.
[2024-05-26 13:07:55] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-26 13:07:55] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2024-05-26 13:07:55] [INFO ] Redundant transitions in 6 ms returned []
Running 208 sub problems to find dead transitions.
[2024-05-26 13:07:55] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
[2024-05-26 13:07:55] [INFO ] Invariant cache hit.
[2024-05-26 13:07:55] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 208 unsolved
[2024-05-26 13:07:56] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-26 13:07:56] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2024-05-26 13:07:56] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
[2024-05-26 13:07:56] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2024-05-26 13:07:56] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2024-05-26 13:07:57] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-26 13:07:57] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-05-26 13:07:57] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2024-05-26 13:07:57] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-26 13:07:57] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-05-26 13:07:57] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 0 ms to minimize.
[2024-05-26 13:07:57] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-26 13:07:57] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 0 ms to minimize.
[2024-05-26 13:07:57] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-26 13:07:57] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-26 13:07:57] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 2 ms to minimize.
[2024-05-26 13:07:57] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-05-26 13:07:57] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 0 ms to minimize.
[2024-05-26 13:07:58] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-26 13:07:58] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 208 unsolved
[2024-05-26 13:07:58] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 2 ms to minimize.
[2024-05-26 13:07:58] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2024-05-26 13:07:58] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2024-05-26 13:07:58] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-05-26 13:07:58] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2024-05-26 13:07:58] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-26 13:07:58] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-26 13:07:58] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-26 13:07:58] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-26 13:07:59] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-26 13:07:59] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-26 13:07:59] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-26 13:07:59] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-26 13:07:59] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-26 13:07:59] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-26 13:07:59] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-05-26 13:07:59] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2024-05-26 13:07:59] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-26 13:07:59] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2024-05-26 13:07:59] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 208 unsolved
[2024-05-26 13:08:00] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-26 13:08:00] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-05-26 13:08:00] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-26 13:08:00] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-26 13:08:00] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-05-26 13:08:00] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-26 13:08:00] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-26 13:08:00] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 0 ms to minimize.
[2024-05-26 13:08:00] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-05-26 13:08:00] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-26 13:08:01] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2024-05-26 13:08:01] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2024-05-26 13:08:01] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-05-26 13:08:01] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-05-26 13:08:01] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 1 ms to minimize.
[2024-05-26 13:08:01] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-05-26 13:08:01] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-05-26 13:08:01] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2024-05-26 13:08:01] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
[2024-05-26 13:08:01] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 208 unsolved
[2024-05-26 13:08:03] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-26 13:08:03] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 1 ms to minimize.
[2024-05-26 13:08:03] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-26 13:08:03] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-26 13:08:03] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-26 13:08:03] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-26 13:08:03] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-26 13:08:03] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-05-26 13:08:04] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-26 13:08:04] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 208 unsolved
[2024-05-26 13:08:04] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-26 13:08:04] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-26 13:08:04] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-05-26 13:08:05] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-26 13:08:05] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-05-26 13:08:05] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-26 13:08:05] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 7/88 constraints. Problems are: Problem set: 0 solved, 208 unsolved
[2024-05-26 13:08:06] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-26 13:08:06] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-26 13:08:06] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 1 ms to minimize.
[2024-05-26 13:08:06] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-26 13:08:07] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 5/93 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 188/308 variables, 120/213 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 57/270 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 11 (OVERLAPS) 0/308 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 270 constraints, problems are : Problem set: 0 solved, 208 unsolved in 22429 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 120/120 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 82/82 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 82/93 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (OVERLAPS) 188/308 variables, 120/213 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 57/270 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 208/478 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/308 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 478 constraints, problems are : Problem set: 0 solved, 208 unsolved in 15433 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 120/120 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 82/82 constraints]
After SMT, in 37904ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 37907ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38300 ms. Remains : 120/120 places, 212/212 transitions.
Treatment of property Peterson-COL-3-LTLFireability-11 finished in 82630 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0||G(p1))))'
Support contains 52 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 244 transition count 278
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 190 transition count 278
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 108 place count 190 transition count 227
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 210 place count 139 transition count 227
Applied a total of 210 rules in 11 ms. Remains 139 /244 variables (removed 105) and now considering 227/332 (removed 105) transitions.
[2024-05-26 13:08:33] [INFO ] Flow matrix only has 203 transitions (discarded 24 similar events)
// Phase 1: matrix 203 rows 139 cols
[2024-05-26 13:08:33] [INFO ] Computed 15 invariants in 1 ms
[2024-05-26 13:08:33] [INFO ] Implicit Places using invariants in 87 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 104 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 135/244 places, 227/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 135 /135 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 119 ms. Remains : 135/244 places, 227/332 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) p0)]
Running random walk in product with property : Peterson-COL-3-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 529 ms.
Stack based approach found an accepted trace after 26 steps with 0 reset with depth 27 and stack size 27 in 0 ms.
FORMULA Peterson-COL-3-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-12 finished in 754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 8 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 244 transition count 236
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 148 transition count 236
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 192 place count 148 transition count 192
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 280 place count 104 transition count 192
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 304 place count 92 transition count 180
Applied a total of 304 rules in 12 ms. Remains 92 /244 variables (removed 152) and now considering 180/332 (removed 152) transitions.
[2024-05-26 13:08:34] [INFO ] Flow matrix only has 156 transitions (discarded 24 similar events)
// Phase 1: matrix 156 rows 92 cols
[2024-05-26 13:08:34] [INFO ] Computed 15 invariants in 1 ms
[2024-05-26 13:08:34] [INFO ] Implicit Places using invariants in 193 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 208 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/244 places, 180/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 225 ms. Remains : 88/244 places, 180/332 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-3-LTLFireability-13
Product exploration explored 100000 steps with 2062 reset in 170 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA Peterson-COL-3-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-13 finished in 482 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 36 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 244 transition count 290
Reduce places removed 42 places and 0 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 1 with 78 rules applied. Total rules applied 120 place count 202 transition count 254
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 156 place count 166 transition count 254
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 156 place count 166 transition count 230
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 204 place count 142 transition count 230
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 222 place count 133 transition count 221
Applied a total of 222 rules in 15 ms. Remains 133 /244 variables (removed 111) and now considering 221/332 (removed 111) transitions.
[2024-05-26 13:08:34] [INFO ] Flow matrix only has 197 transitions (discarded 24 similar events)
// Phase 1: matrix 197 rows 133 cols
[2024-05-26 13:08:34] [INFO ] Computed 15 invariants in 1 ms
[2024-05-26 13:08:35] [INFO ] Implicit Places using invariants in 210 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 211 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/244 places, 221/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 129 /129 variables (removed 0) and now considering 221/221 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 232 ms. Remains : 129/244 places, 221/332 transitions.
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
Running random walk in product with property : Peterson-COL-3-LTLFireability-14
Product exploration explored 100000 steps with 3553 reset in 243 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 0 ms.
FORMULA Peterson-COL-3-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-14 finished in 560 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)||X(X(G(p1))))))'
Support contains 44 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 5 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-26 13:08:35] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-26 13:08:35] [INFO ] Computed 15 invariants in 2 ms
[2024-05-26 13:08:35] [INFO ] Implicit Places using invariants in 212 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 223 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 230 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 231 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-COL-3-LTLFireability-15
Product exploration explored 100000 steps with 1163 reset in 182 ms.
Stack based approach found an accepted trace after 223 steps with 4 reset with depth 63 and stack size 63 in 1 ms.
FORMULA Peterson-COL-3-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-15 finished in 661 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(((!p1&&(!p1 U (p2||G(!p1)))) U ((!p1 U (p2||G(!p1)))&&p3)))||p0))))'
Found a Shortening insensitive property : Peterson-COL-3-LTLFireability-09
Stuttering acceptance computed with spot in 253 ms :[(OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) p1 (NOT p2))]
Support contains 64 out of 244 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 244 transition count 294
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 206 transition count 294
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 76 place count 206 transition count 286
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 92 place count 198 transition count 286
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 104 place count 192 transition count 280
Applied a total of 104 rules in 17 ms. Remains 192 /244 variables (removed 52) and now considering 280/332 (removed 52) transitions.
[2024-05-26 13:08:36] [INFO ] Flow matrix only has 256 transitions (discarded 24 similar events)
// Phase 1: matrix 256 rows 192 cols
[2024-05-26 13:08:36] [INFO ] Computed 15 invariants in 2 ms
[2024-05-26 13:08:36] [INFO ] Implicit Places using invariants in 167 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 183 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 188/244 places, 280/332 transitions.
Applied a total of 0 rules in 5 ms. Remains 188 /188 variables (removed 0) and now considering 280/280 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 205 ms. Remains : 188/244 places, 280/332 transitions.
Running random walk in product with property : Peterson-COL-3-LTLFireability-09
Product exploration explored 100000 steps with 12743 reset in 964 ms.
Product exploration explored 100000 steps with 12763 reset in 974 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 p3) p2 (NOT p1)), (X (NOT p0)), (X (X p2)), (X (X (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p3 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 119 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) p1 (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 931 ms. (42 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 433 ms. (92 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 404 ms. (98 steps per ms) remains 2/2 properties
[2024-05-26 13:08:39] [INFO ] Flow matrix only has 256 transitions (discarded 24 similar events)
// Phase 1: matrix 256 rows 188 cols
[2024-05-26 13:08:39] [INFO ] Computed 11 invariants in 1 ms
[2024-05-26 13:08:39] [INFO ] State equation strengthened by 57 read => feed constraints.
Problem apf4 is UNSAT
Problem apf7 is UNSAT
After SMT solving in domain Real declared 64/444 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 0/11 constraints, State Equation: 0/188 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 73ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p3) p2 (NOT p1)), (X (NOT p0)), (X (X p2)), (X (X (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p3 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR p0 (NOT p3) p1 p2)), (G (OR p0 (NOT p1) p2))]
False Knowledge obtained : [(F (NOT (OR p0 p1 p2))), (F p1), (F p0), (F (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p1 (NOT p2))))), (F p3), (F (NOT p2))]
Knowledge based reduction with 10 factoid took 281 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
[2024-05-26 13:08:40] [INFO ] Flow matrix only has 256 transitions (discarded 24 similar events)
[2024-05-26 13:08:40] [INFO ] Invariant cache hit.
[2024-05-26 13:08:40] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-26 13:08:40] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-26 13:08:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 13:08:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-26 13:08:41] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-05-26 13:08:41] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-26 13:08:41] [INFO ] [Nat]Added 57 Read/Feed constraints in 26 ms returned sat
[2024-05-26 13:08:41] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 2 ms to minimize.
[2024-05-26 13:08:41] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 2 ms to minimize.
[2024-05-26 13:08:41] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 2 ms to minimize.
[2024-05-26 13:08:41] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 2 ms to minimize.
[2024-05-26 13:08:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 459 ms
[2024-05-26 13:08:41] [INFO ] Computed and/alt/rep : 231/433/231 causal constraints (skipped 21 transitions) in 22 ms.
[2024-05-26 13:08:42] [INFO ] Added : 95 causal constraints over 19 iterations in 526 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Support contains 60 out of 188 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 280/280 transitions.
Applied a total of 0 rules in 1 ms. Remains 188 /188 variables (removed 0) and now considering 280/280 (removed 0) transitions.
[2024-05-26 13:08:42] [INFO ] Flow matrix only has 256 transitions (discarded 24 similar events)
[2024-05-26 13:08:42] [INFO ] Invariant cache hit.
[2024-05-26 13:08:42] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-26 13:08:42] [INFO ] Flow matrix only has 256 transitions (discarded 24 similar events)
[2024-05-26 13:08:42] [INFO ] Invariant cache hit.
[2024-05-26 13:08:42] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-26 13:08:42] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-26 13:08:42] [INFO ] Flow matrix only has 256 transitions (discarded 24 similar events)
[2024-05-26 13:08:42] [INFO ] Invariant cache hit.
[2024-05-26 13:08:42] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-05-26 13:08:44] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2024-05-26 13:08:44] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 2 ms to minimize.
[2024-05-26 13:08:44] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 2 ms to minimize.
[2024-05-26 13:08:44] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 2 ms to minimize.
[2024-05-26 13:08:44] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 2 ms to minimize.
[2024-05-26 13:08:44] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
[2024-05-26 13:08:44] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 2 ms to minimize.
[2024-05-26 13:08:44] [INFO ] Deduced a trap composed of 64 places in 103 ms of which 2 ms to minimize.
[2024-05-26 13:08:45] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 2 ms to minimize.
[2024-05-26 13:08:45] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2024-05-26 13:08:45] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2024-05-26 13:08:45] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2024-05-26 13:08:45] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-26 13:08:45] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-26 13:08:45] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-05-26 13:08:45] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2024-05-26 13:08:45] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2024-05-26 13:08:45] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-26 13:08:45] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-26 13:08:45] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-05-26 13:08:46] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2024-05-26 13:08:46] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
[2024-05-26 13:08:46] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-26 13:08:46] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-26 13:08:46] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-05-26 13:08:46] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 2 ms to minimize.
[2024-05-26 13:08:46] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2024-05-26 13:08:46] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2024-05-26 13:08:47] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-26 13:08:47] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-26 13:08:47] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-05-26 13:08:47] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 1 ms to minimize.
[2024-05-26 13:08:47] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 2 ms to minimize.
[2024-05-26 13:08:47] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2024-05-26 13:08:47] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 1 ms to minimize.
[2024-05-26 13:08:47] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2024-05-26 13:08:47] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-26 13:08:47] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 2 ms to minimize.
[2024-05-26 13:08:48] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
[2024-05-26 13:08:48] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-05-26 13:08:48] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-05-26 13:08:48] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2024-05-26 13:08:49] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 1 ms to minimize.
[2024-05-26 13:08:49] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2024-05-26 13:08:49] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 2 ms to minimize.
[2024-05-26 13:08:49] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 1 ms to minimize.
[2024-05-26 13:08:49] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 1 ms to minimize.
[2024-05-26 13:08:49] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 1 ms to minimize.
[2024-05-26 13:08:49] [INFO ] Deduced a trap composed of 49 places in 81 ms of which 1 ms to minimize.
[2024-05-26 13:08:49] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 1 ms to minimize.
[2024-05-26 13:08:49] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 2 ms to minimize.
[2024-05-26 13:08:50] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 1 ms to minimize.
[2024-05-26 13:08:50] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 2 ms to minimize.
[2024-05-26 13:08:51] [INFO ] Deduced a trap composed of 57 places in 270 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-05-26 13:08:53] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 2 ms to minimize.
[2024-05-26 13:08:54] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 16 ms to minimize.
[2024-05-26 13:08:54] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 1 ms to minimize.
[2024-05-26 13:08:54] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-26 13:08:55] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-05-26 13:08:56] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-26 13:08:56] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 1 ms to minimize.
[2024-05-26 13:08:56] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-05-26 13:08:58] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2024-05-26 13:08:58] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (OVERLAPS) 256/444 variables, 188/263 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 57/320 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 444/444 variables, and 320 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 188/188 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 64/64 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 64/75 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 256/444 variables, 188/263 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/444 variables, 57/320 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 276/596 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-05-26 13:09:21] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/444 variables, and 597 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 188/188 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 65/65 constraints]
After SMT, in 60083ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 60087ms
Finished structural reductions in LTL mode , in 1 iterations and 60538 ms. Remains : 188/188 places, 280/280 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 p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 82 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 88 steps (0 resets) in 7 ms. (11 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p3), (F p0), (F (NOT (AND (NOT p0) (NOT p3))))]
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
[2024-05-26 13:09:43] [INFO ] Flow matrix only has 256 transitions (discarded 24 similar events)
[2024-05-26 13:09:43] [INFO ] Invariant cache hit.
[2024-05-26 13:09:43] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-26 13:09:43] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-05-26 13:09:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 13:09:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-26 13:09:44] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2024-05-26 13:09:44] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-26 13:09:44] [INFO ] [Nat]Added 57 Read/Feed constraints in 26 ms returned sat
[2024-05-26 13:09:44] [INFO ] Deduced a trap composed of 48 places in 89 ms of which 2 ms to minimize.
[2024-05-26 13:09:44] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 1 ms to minimize.
[2024-05-26 13:09:44] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 2 ms to minimize.
[2024-05-26 13:09:44] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
[2024-05-26 13:09:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 470 ms
[2024-05-26 13:09:44] [INFO ] Computed and/alt/rep : 231/433/231 causal constraints (skipped 21 transitions) in 21 ms.
[2024-05-26 13:09:45] [INFO ] Added : 95 causal constraints over 19 iterations in 499 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 12670 reset in 528 ms.
Product exploration explored 100000 steps with 12773 reset in 541 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 60 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 280/280 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 188 transition count 280
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 1 place count 188 transition count 280
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 5 place count 188 transition count 280
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 188 transition count 280
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 8 rules in 12 ms. Remains 188 /188 variables (removed 0) and now considering 280/280 (removed 0) transitions.
[2024-05-26 13:09:46] [INFO ] Redundant transitions in 1 ms returned []
Running 276 sub problems to find dead transitions.
[2024-05-26 13:09:46] [INFO ] Flow matrix only has 256 transitions (discarded 24 similar events)
// Phase 1: matrix 256 rows 188 cols
[2024-05-26 13:09:46] [INFO ] Computed 11 invariants in 3 ms
[2024-05-26 13:09:46] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-05-26 13:09:48] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
[2024-05-26 13:09:48] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 2 ms to minimize.
[2024-05-26 13:09:48] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 2 ms to minimize.
[2024-05-26 13:09:48] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2024-05-26 13:09:48] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
[2024-05-26 13:09:48] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 2 ms to minimize.
[2024-05-26 13:09:48] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 1 ms to minimize.
[2024-05-26 13:09:49] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2024-05-26 13:09:49] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 2 ms to minimize.
[2024-05-26 13:09:49] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-26 13:09:49] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-26 13:09:49] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 1 ms to minimize.
[2024-05-26 13:09:49] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
[2024-05-26 13:09:49] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 1 ms to minimize.
[2024-05-26 13:09:49] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-26 13:09:49] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-05-26 13:09:49] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-26 13:09:49] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 1 ms to minimize.
[2024-05-26 13:09:50] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 2 ms to minimize.
[2024-05-26 13:09:50] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-05-26 13:09:50] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-26 13:09:50] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-26 13:09:50] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-26 13:09:50] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-26 13:09:50] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-26 13:09:50] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-26 13:09:50] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 2 ms to minimize.
[2024-05-26 13:09:50] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 2 ms to minimize.
[2024-05-26 13:09:50] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 2 ms to minimize.
[2024-05-26 13:09:51] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 2 ms to minimize.
[2024-05-26 13:09:51] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-26 13:09:51] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-05-26 13:09:51] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
[2024-05-26 13:09:51] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-26 13:09:51] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2024-05-26 13:09:51] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-26 13:09:51] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2024-05-26 13:09:51] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 1 ms to minimize.
[2024-05-26 13:09:51] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-05-26 13:09:52] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-05-26 13:09:52] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2024-05-26 13:09:52] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
[2024-05-26 13:09:52] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-05-26 13:09:52] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 2 ms to minimize.
[2024-05-26 13:09:52] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
[2024-05-26 13:09:53] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 2 ms to minimize.
[2024-05-26 13:09:53] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 0 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-05-26 13:09:53] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 2 ms to minimize.
[2024-05-26 13:09:53] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
Problem TDEAD70 is UNSAT
[2024-05-26 13:09:53] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
Problem TDEAD71 is UNSAT
[2024-05-26 13:09:53] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 1 ms to minimize.
[2024-05-26 13:09:53] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 1 ms to minimize.
[2024-05-26 13:09:53] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
[2024-05-26 13:09:53] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2024-05-26 13:09:53] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 2 ms to minimize.
[2024-05-26 13:09:53] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 1 ms to minimize.
[2024-05-26 13:09:54] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 1 ms to minimize.
[2024-05-26 13:09:54] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 2 ms to minimize.
[2024-05-26 13:09:54] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 1 ms to minimize.
[2024-05-26 13:09:54] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 20/71 constraints. Problems are: Problem set: 8 solved, 268 unsolved
[2024-05-26 13:09:56] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 1 ms to minimize.
[2024-05-26 13:09:56] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 2 ms to minimize.
[2024-05-26 13:09:56] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 2 ms to minimize.
[2024-05-26 13:09:57] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 2 ms to minimize.
[2024-05-26 13:09:57] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 5/76 constraints. Problems are: Problem set: 8 solved, 268 unsolved
[2024-05-26 13:09:58] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-26 13:09:58] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 2/78 constraints. Problems are: Problem set: 8 solved, 268 unsolved
[2024-05-26 13:10:00] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 1 ms to minimize.
[2024-05-26 13:10:01] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 2/80 constraints. Problems are: Problem set: 8 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/80 constraints. Problems are: Problem set: 8 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 256/444 variables, 188/268 constraints. Problems are: Problem set: 8 solved, 268 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 57/325 constraints. Problems are: Problem set: 8 solved, 268 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 0/325 constraints. Problems are: Problem set: 8 solved, 268 unsolved
At refinement iteration 11 (OVERLAPS) 0/444 variables, 0/325 constraints. Problems are: Problem set: 8 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/444 variables, and 325 constraints, problems are : Problem set: 8 solved, 268 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 188/188 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 69/69 constraints]
Escalating to Integer solving :Problem set: 8 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 7/7 constraints. Problems are: Problem set: 8 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 69/76 constraints. Problems are: Problem set: 8 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/76 constraints. Problems are: Problem set: 8 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 8/188 variables, 4/80 constraints. Problems are: Problem set: 8 solved, 268 unsolved
[2024-05-26 13:10:19] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 1/81 constraints. Problems are: Problem set: 8 solved, 268 unsolved
[2024-05-26 13:10:20] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 1 ms to minimize.
[2024-05-26 13:10:22] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 2/83 constraints. Problems are: Problem set: 8 solved, 268 unsolved
[2024-05-26 13:10:23] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 1/84 constraints. Problems are: Problem set: 8 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/84 constraints. Problems are: Problem set: 8 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 256/444 variables, 188/272 constraints. Problems are: Problem set: 8 solved, 268 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 57/329 constraints. Problems are: Problem set: 8 solved, 268 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 268/597 constraints. Problems are: Problem set: 8 solved, 268 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 0/597 constraints. Problems are: Problem set: 8 solved, 268 unsolved
At refinement iteration 12 (OVERLAPS) 0/444 variables, 0/597 constraints. Problems are: Problem set: 8 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 444/444 variables, and 597 constraints, problems are : Problem set: 8 solved, 268 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 188/188 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 268/276 constraints, Known Traps: 73/73 constraints]
After SMT, in 60124ms problems are : Problem set: 8 solved, 268 unsolved
Search for dead transitions found 8 dead transitions in 60129ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 188/188 places, 272/280 transitions.
Graph (complete) has 576 edges and 188 vertex of which 180 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 180 /188 variables (removed 8) and now considering 272/272 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 180/188 places, 272/280 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60185 ms. Remains : 180/188 places, 272/280 transitions.
Support contains 60 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 280/280 transitions.
Applied a total of 0 rules in 1 ms. Remains 188 /188 variables (removed 0) and now considering 280/280 (removed 0) transitions.
[2024-05-26 13:10:46] [INFO ] Flow matrix only has 256 transitions (discarded 24 similar events)
// Phase 1: matrix 256 rows 188 cols
[2024-05-26 13:10:46] [INFO ] Computed 11 invariants in 1 ms
[2024-05-26 13:10:46] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-26 13:10:47] [INFO ] Flow matrix only has 256 transitions (discarded 24 similar events)
[2024-05-26 13:10:47] [INFO ] Invariant cache hit.
[2024-05-26 13:10:47] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-26 13:10:47] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-26 13:10:47] [INFO ] Flow matrix only has 256 transitions (discarded 24 similar events)
[2024-05-26 13:10:47] [INFO ] Invariant cache hit.
[2024-05-26 13:10:47] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-05-26 13:10:48] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
[2024-05-26 13:10:48] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 1 ms to minimize.
[2024-05-26 13:10:48] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 2 ms to minimize.
[2024-05-26 13:10:49] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2024-05-26 13:10:49] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2024-05-26 13:10:49] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 1 ms to minimize.
[2024-05-26 13:10:49] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 2 ms to minimize.
[2024-05-26 13:10:49] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 2 ms to minimize.
[2024-05-26 13:10:49] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 2 ms to minimize.
[2024-05-26 13:10:49] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
[2024-05-26 13:10:49] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-26 13:10:49] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 2 ms to minimize.
[2024-05-26 13:10:49] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-26 13:10:50] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-26 13:10:50] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-05-26 13:10:50] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 1 ms to minimize.
[2024-05-26 13:10:50] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 2 ms to minimize.
[2024-05-26 13:10:50] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2024-05-26 13:10:50] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-26 13:10:50] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-05-26 13:10:50] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 2 ms to minimize.
[2024-05-26 13:10:50] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 2 ms to minimize.
[2024-05-26 13:10:51] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 1 ms to minimize.
[2024-05-26 13:10:51] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-26 13:10:51] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2024-05-26 13:10:51] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2024-05-26 13:10:51] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-05-26 13:10:51] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 2 ms to minimize.
[2024-05-26 13:10:51] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-26 13:10:51] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-05-26 13:10:51] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-05-26 13:10:51] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2024-05-26 13:10:52] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2024-05-26 13:10:52] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 2 ms to minimize.
[2024-05-26 13:10:52] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-05-26 13:10:52] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 1 ms to minimize.
[2024-05-26 13:10:52] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2024-05-26 13:10:52] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 1 ms to minimize.
[2024-05-26 13:10:52] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 1 ms to minimize.
[2024-05-26 13:10:52] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-05-26 13:10:53] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 2 ms to minimize.
[2024-05-26 13:10:53] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 2 ms to minimize.
[2024-05-26 13:10:53] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
[2024-05-26 13:10:53] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2024-05-26 13:10:53] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 1 ms to minimize.
[2024-05-26 13:10:54] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 2 ms to minimize.
[2024-05-26 13:10:54] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-05-26 13:10:54] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 2 ms to minimize.
[2024-05-26 13:10:54] [INFO ] Deduced a trap composed of 49 places in 84 ms of which 1 ms to minimize.
[2024-05-26 13:10:54] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 2 ms to minimize.
[2024-05-26 13:10:54] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 1 ms to minimize.
[2024-05-26 13:10:54] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 1 ms to minimize.
[2024-05-26 13:10:55] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 2 ms to minimize.
[2024-05-26 13:10:55] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-05-26 13:10:57] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 2 ms to minimize.
[2024-05-26 13:10:58] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2024-05-26 13:10:58] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 1 ms to minimize.
[2024-05-26 13:10:58] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-26 13:10:59] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-05-26 13:11:00] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-26 13:11:00] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2024-05-26 13:11:00] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-05-26 13:11:02] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 2 ms to minimize.
[2024-05-26 13:11:02] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (OVERLAPS) 256/444 variables, 188/263 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 57/320 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 444/444 variables, and 320 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 188/188 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 64/64 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 64/75 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 256/444 variables, 188/263 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/444 variables, 57/320 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 276/596 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-05-26 13:11:26] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/444 variables, and 597 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 188/188 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 65/65 constraints]
After SMT, in 60095ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 60100ms
Finished structural reductions in LTL mode , in 1 iterations and 60611 ms. Remains : 188/188 places, 280/280 transitions.
Treatment of property Peterson-COL-3-LTLFireability-09 finished in 191355 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||G(p1)))))'
[2024-05-26 13:11:47] [INFO ] Flatten gal took : 41 ms
[2024-05-26 13:11:47] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 9 ms.
[2024-05-26 13:11:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 244 places, 332 transitions and 1016 arcs took 39 ms.
Total runtime 675755 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running Peterson-COL-3
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 244
TRANSITIONS: 332
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.009s, Sys 0.000s]
SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.002s]
----------------------------------------------------------------------
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: 4646
MODEL NAME: /home/mcc/execution/413/model
244 places, 332 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 Peterson-COL-3-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Peterson-COL-3-LTLFireability-09 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716731453100
--------------------
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
ERROR: std::bad_alloc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-COL-3"
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 Peterson-COL-3, 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-171654405900212"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-3.tgz
mv Peterson-COL-3 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 ;