About the Execution of ITS-Tools for Anderson-PT-07
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1812.888 | 968708.00 | 1246935.00 | 3061.30 | FFFFTFTFTFFFTTFF | 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.r004-smll-171620118300340.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 itstools
Input is Anderson-PT-07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-smll-171620118300340
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 15:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 12 15:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 15:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 12 15:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 461K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Anderson-PT-07-LTLFireability-00
FORMULA_NAME Anderson-PT-07-LTLFireability-01
FORMULA_NAME Anderson-PT-07-LTLFireability-02
FORMULA_NAME Anderson-PT-07-LTLFireability-03
FORMULA_NAME Anderson-PT-07-LTLFireability-04
FORMULA_NAME Anderson-PT-07-LTLFireability-05
FORMULA_NAME Anderson-PT-07-LTLFireability-06
FORMULA_NAME Anderson-PT-07-LTLFireability-07
FORMULA_NAME Anderson-PT-07-LTLFireability-08
FORMULA_NAME Anderson-PT-07-LTLFireability-09
FORMULA_NAME Anderson-PT-07-LTLFireability-10
FORMULA_NAME Anderson-PT-07-LTLFireability-11
FORMULA_NAME Anderson-PT-07-LTLFireability-12
FORMULA_NAME Anderson-PT-07-LTLFireability-13
FORMULA_NAME Anderson-PT-07-LTLFireability-14
FORMULA_NAME Anderson-PT-07-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716428043024
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-23 01:34:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 01:34:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 01:34:05] [INFO ] Load time of PNML (sax parser for PT used): 308 ms
[2024-05-23 01:34:05] [INFO ] Transformed 309 places.
[2024-05-23 01:34:05] [INFO ] Transformed 917 transitions.
[2024-05-23 01:34:05] [INFO ] Found NUPN structural information;
[2024-05-23 01:34:06] [INFO ] Parsed PT model containing 309 places and 917 transitions and 3500 arcs in 529 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA Anderson-PT-07-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 917/917 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 237 transition count 461
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 237 transition count 461
Applied a total of 144 rules in 213 ms. Remains 237 /309 variables (removed 72) and now considering 461/917 (removed 456) transitions.
// Phase 1: matrix 461 rows 237 cols
[2024-05-23 01:34:06] [INFO ] Computed 17 invariants in 43 ms
[2024-05-23 01:34:07] [INFO ] Implicit Places using invariants in 709 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 880 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 236/309 places, 461/917 transitions.
Applied a total of 0 rules in 9 ms. Remains 236 /236 variables (removed 0) and now considering 461/461 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1172 ms. Remains : 236/309 places, 461/917 transitions.
Support contains 23 out of 236 places after structural reductions.
[2024-05-23 01:34:07] [INFO ] Flatten gal took : 111 ms
[2024-05-23 01:34:07] [INFO ] Flatten gal took : 51 ms
[2024-05-23 01:34:08] [INFO ] Input system was already deterministic with 461 transitions.
RANDOM walk for 40000 steps (8 resets) in 1709 ms. (23 steps per ms) remains 8/16 properties
BEST_FIRST walk for 40003 steps (8 resets) in 262 ms. (152 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 182 ms. (218 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 145 ms. (273 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
// Phase 1: matrix 461 rows 236 cols
[2024-05-23 01:34:08] [INFO ] Computed 16 invariants in 8 ms
[2024-05-23 01:34:08] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 60/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 42/107 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 117/224 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 12/236 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 461/697 variables, 236/252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/697 variables, 42/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/697 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/697 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 697/697 variables, and 294 constraints, problems are : Problem set: 0 solved, 3 unsolved in 555 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 236/236 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 60/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 42/107 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 117/224 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 12/236 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 01:34:10] [INFO ] Deduced a trap composed of 153 places in 290 ms of which 51 ms to minimize.
[2024-05-23 01:34:10] [INFO ] Deduced a trap composed of 71 places in 245 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 461/697 variables, 236/254 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/697 variables, 42/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/697 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/697 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/697 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 697/697 variables, and 299 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1536 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 236/236 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 2161ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 469 ms.
Support contains 5 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 461/461 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 236 transition count 415
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 190 transition count 415
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 92 place count 190 transition count 373
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 176 place count 148 transition count 373
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 185 place count 139 transition count 280
Iterating global reduction 2 with 9 rules applied. Total rules applied 194 place count 139 transition count 280
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 197 place count 139 transition count 277
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 200 place count 136 transition count 277
Applied a total of 200 rules in 86 ms. Remains 136 /236 variables (removed 100) and now considering 277/461 (removed 184) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 136/236 places, 277/461 transitions.
RANDOM walk for 40000 steps (8 resets) in 383 ms. (104 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 95 ms. (416 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 137 ms. (289 steps per ms) remains 1/2 properties
BEST_FIRST walk for 32929 steps (6 resets) in 44 ms. (731 steps per ms) remains 0/1 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 461/461 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 224 transition count 329
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 224 transition count 329
Applied a total of 24 rules in 15 ms. Remains 224 /236 variables (removed 12) and now considering 329/461 (removed 132) transitions.
// Phase 1: matrix 329 rows 224 cols
[2024-05-23 01:34:12] [INFO ] Computed 16 invariants in 4 ms
[2024-05-23 01:34:12] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-05-23 01:34:12] [INFO ] Invariant cache hit.
[2024-05-23 01:34:12] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-23 01:34:13] [INFO ] Implicit Places using invariants and state equation in 707 ms returned []
Implicit Place search using SMT with State Equation took 975 ms to find 0 implicit places.
Running 322 sub problems to find dead transitions.
[2024-05-23 01:34:13] [INFO ] Invariant cache hit.
[2024-05-23 01:34:13] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-05-23 01:34:16] [INFO ] Deduced a trap composed of 69 places in 185 ms of which 4 ms to minimize.
[2024-05-23 01:34:17] [INFO ] Deduced a trap composed of 138 places in 166 ms of which 3 ms to minimize.
[2024-05-23 01:34:18] [INFO ] Deduced a trap composed of 131 places in 171 ms of which 3 ms to minimize.
[2024-05-23 01:34:18] [INFO ] Deduced a trap composed of 131 places in 189 ms of which 3 ms to minimize.
[2024-05-23 01:34:18] [INFO ] Deduced a trap composed of 136 places in 186 ms of which 2 ms to minimize.
[2024-05-23 01:34:18] [INFO ] Deduced a trap composed of 113 places in 268 ms of which 5 ms to minimize.
[2024-05-23 01:34:18] [INFO ] Deduced a trap composed of 129 places in 193 ms of which 2 ms to minimize.
[2024-05-23 01:34:19] [INFO ] Deduced a trap composed of 54 places in 276 ms of which 4 ms to minimize.
[2024-05-23 01:34:19] [INFO ] Deduced a trap composed of 82 places in 204 ms of which 4 ms to minimize.
[2024-05-23 01:34:19] [INFO ] Deduced a trap composed of 86 places in 274 ms of which 4 ms to minimize.
[2024-05-23 01:34:20] [INFO ] Deduced a trap composed of 99 places in 149 ms of which 3 ms to minimize.
[2024-05-23 01:34:20] [INFO ] Deduced a trap composed of 46 places in 164 ms of which 3 ms to minimize.
[2024-05-23 01:34:20] [INFO ] Deduced a trap composed of 143 places in 172 ms of which 3 ms to minimize.
[2024-05-23 01:34:20] [INFO ] Deduced a trap composed of 151 places in 152 ms of which 3 ms to minimize.
[2024-05-23 01:34:21] [INFO ] Deduced a trap composed of 82 places in 188 ms of which 3 ms to minimize.
[2024-05-23 01:34:21] [INFO ] Deduced a trap composed of 96 places in 161 ms of which 2 ms to minimize.
[2024-05-23 01:34:21] [INFO ] Deduced a trap composed of 91 places in 154 ms of which 2 ms to minimize.
[2024-05-23 01:34:21] [INFO ] Deduced a trap composed of 95 places in 157 ms of which 2 ms to minimize.
[2024-05-23 01:34:21] [INFO ] Deduced a trap composed of 89 places in 158 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 19/34 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-05-23 01:34:23] [INFO ] Deduced a trap composed of 71 places in 272 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-05-23 01:34:29] [INFO ] Deduced a trap composed of 83 places in 197 ms of which 4 ms to minimize.
[2024-05-23 01:34:30] [INFO ] Deduced a trap composed of 97 places in 172 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (OVERLAPS) 1/224 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-05-23 01:34:39] [INFO ] Deduced a trap composed of 65 places in 228 ms of which 4 ms to minimize.
[2024-05-23 01:34:40] [INFO ] Deduced a trap composed of 69 places in 239 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-05-23 01:34:42] [INFO ] Deduced a trap composed of 162 places in 242 ms of which 4 ms to minimize.
[2024-05-23 01:34:42] [INFO ] Deduced a trap composed of 129 places in 227 ms of which 4 ms to minimize.
[2024-05-23 01:34:43] [INFO ] Deduced a trap composed of 96 places in 252 ms of which 4 ms to minimize.
[2024-05-23 01:34:43] [INFO ] Deduced a trap composed of 162 places in 239 ms of which 4 ms to minimize.
[2024-05-23 01:34:43] [INFO ] Deduced a trap composed of 93 places in 239 ms of which 4 ms to minimize.
SMT process timed out in 30479ms, After SMT, problems are : Problem set: 0 solved, 322 unsolved
Search for dead transitions found 0 dead transitions in 30491ms
Starting structural reductions in LTL mode, iteration 1 : 224/236 places, 329/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31491 ms. Remains : 224/236 places, 329/461 transitions.
Stuttering acceptance computed with spot in 366 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-07-LTLFireability-01
Product exploration explored 100000 steps with 48 reset in 381 ms.
Stack based approach found an accepted trace after 68 steps with 0 reset with depth 69 and stack size 69 in 1 ms.
FORMULA Anderson-PT-07-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-07-LTLFireability-01 finished in 32326 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(p0)&&G(p1)))))'
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 461/461 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 227 transition count 356
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 227 transition count 356
Applied a total of 18 rules in 10 ms. Remains 227 /236 variables (removed 9) and now considering 356/461 (removed 105) transitions.
// Phase 1: matrix 356 rows 227 cols
[2024-05-23 01:34:44] [INFO ] Computed 16 invariants in 6 ms
[2024-05-23 01:34:44] [INFO ] Implicit Places using invariants in 409 ms returned []
[2024-05-23 01:34:44] [INFO ] Invariant cache hit.
[2024-05-23 01:34:45] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-23 01:34:45] [INFO ] Implicit Places using invariants and state equation in 777 ms returned []
Implicit Place search using SMT with State Equation took 1189 ms to find 0 implicit places.
Running 349 sub problems to find dead transitions.
[2024-05-23 01:34:45] [INFO ] Invariant cache hit.
[2024-05-23 01:34:45] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-05-23 01:34:48] [INFO ] Deduced a trap composed of 112 places in 136 ms of which 2 ms to minimize.
[2024-05-23 01:34:48] [INFO ] Deduced a trap composed of 128 places in 134 ms of which 2 ms to minimize.
[2024-05-23 01:34:48] [INFO ] Deduced a trap composed of 144 places in 213 ms of which 4 ms to minimize.
[2024-05-23 01:34:48] [INFO ] Deduced a trap composed of 113 places in 213 ms of which 4 ms to minimize.
[2024-05-23 01:34:49] [INFO ] Deduced a trap composed of 141 places in 198 ms of which 2 ms to minimize.
[2024-05-23 01:34:49] [INFO ] Deduced a trap composed of 166 places in 142 ms of which 3 ms to minimize.
[2024-05-23 01:34:50] [INFO ] Deduced a trap composed of 140 places in 201 ms of which 3 ms to minimize.
[2024-05-23 01:34:50] [INFO ] Deduced a trap composed of 84 places in 270 ms of which 4 ms to minimize.
[2024-05-23 01:34:50] [INFO ] Deduced a trap composed of 86 places in 141 ms of which 4 ms to minimize.
[2024-05-23 01:34:51] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 3 ms to minimize.
[2024-05-23 01:34:51] [INFO ] Deduced a trap composed of 83 places in 212 ms of which 4 ms to minimize.
[2024-05-23 01:34:52] [INFO ] Deduced a trap composed of 100 places in 182 ms of which 4 ms to minimize.
[2024-05-23 01:34:52] [INFO ] Deduced a trap composed of 92 places in 215 ms of which 4 ms to minimize.
[2024-05-23 01:34:52] [INFO ] Deduced a trap composed of 58 places in 178 ms of which 2 ms to minimize.
[2024-05-23 01:34:52] [INFO ] Deduced a trap composed of 57 places in 203 ms of which 3 ms to minimize.
[2024-05-23 01:34:52] [INFO ] Deduced a trap composed of 57 places in 191 ms of which 3 ms to minimize.
[2024-05-23 01:34:53] [INFO ] Deduced a trap composed of 57 places in 160 ms of which 3 ms to minimize.
[2024-05-23 01:34:54] [INFO ] Deduced a trap composed of 143 places in 197 ms of which 3 ms to minimize.
[2024-05-23 01:34:54] [INFO ] Deduced a trap composed of 129 places in 137 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-05-23 01:34:55] [INFO ] Deduced a trap composed of 73 places in 189 ms of which 3 ms to minimize.
[2024-05-23 01:34:55] [INFO ] Deduced a trap composed of 75 places in 133 ms of which 3 ms to minimize.
[2024-05-23 01:34:56] [INFO ] Deduced a trap composed of 103 places in 206 ms of which 4 ms to minimize.
[2024-05-23 01:34:56] [INFO ] Deduced a trap composed of 144 places in 206 ms of which 3 ms to minimize.
[2024-05-23 01:34:56] [INFO ] Deduced a trap composed of 158 places in 204 ms of which 4 ms to minimize.
[2024-05-23 01:34:57] [INFO ] Deduced a trap composed of 101 places in 167 ms of which 2 ms to minimize.
[2024-05-23 01:34:57] [INFO ] Deduced a trap composed of 125 places in 211 ms of which 4 ms to minimize.
[2024-05-23 01:34:57] [INFO ] Deduced a trap composed of 148 places in 204 ms of which 4 ms to minimize.
[2024-05-23 01:34:57] [INFO ] Deduced a trap composed of 141 places in 134 ms of which 2 ms to minimize.
[2024-05-23 01:34:57] [INFO ] Deduced a trap composed of 81 places in 206 ms of which 4 ms to minimize.
[2024-05-23 01:34:58] [INFO ] Deduced a trap composed of 99 places in 199 ms of which 4 ms to minimize.
[2024-05-23 01:34:58] [INFO ] Deduced a trap composed of 84 places in 138 ms of which 3 ms to minimize.
[2024-05-23 01:35:00] [INFO ] Deduced a trap composed of 117 places in 272 ms of which 4 ms to minimize.
[2024-05-23 01:35:00] [INFO ] Deduced a trap composed of 142 places in 247 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 14/49 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-05-23 01:35:04] [INFO ] Deduced a trap composed of 96 places in 278 ms of which 4 ms to minimize.
[2024-05-23 01:35:04] [INFO ] Deduced a trap composed of 122 places in 262 ms of which 4 ms to minimize.
[2024-05-23 01:35:04] [INFO ] Deduced a trap composed of 109 places in 168 ms of which 3 ms to minimize.
[2024-05-23 01:35:05] [INFO ] Deduced a trap composed of 133 places in 233 ms of which 4 ms to minimize.
[2024-05-23 01:35:05] [INFO ] Deduced a trap composed of 142 places in 258 ms of which 4 ms to minimize.
[2024-05-23 01:35:05] [INFO ] Deduced a trap composed of 135 places in 234 ms of which 3 ms to minimize.
[2024-05-23 01:35:05] [INFO ] Deduced a trap composed of 104 places in 241 ms of which 4 ms to minimize.
[2024-05-23 01:35:06] [INFO ] Deduced a trap composed of 87 places in 244 ms of which 4 ms to minimize.
[2024-05-23 01:35:06] [INFO ] Deduced a trap composed of 142 places in 166 ms of which 3 ms to minimize.
[2024-05-23 01:35:06] [INFO ] Deduced a trap composed of 141 places in 160 ms of which 2 ms to minimize.
[2024-05-23 01:35:06] [INFO ] Deduced a trap composed of 104 places in 228 ms of which 4 ms to minimize.
[2024-05-23 01:35:07] [INFO ] Deduced a trap composed of 136 places in 232 ms of which 4 ms to minimize.
[2024-05-23 01:35:07] [INFO ] Deduced a trap composed of 87 places in 159 ms of which 2 ms to minimize.
[2024-05-23 01:35:08] [INFO ] Deduced a trap composed of 137 places in 194 ms of which 3 ms to minimize.
[2024-05-23 01:35:08] [INFO ] Deduced a trap composed of 137 places in 134 ms of which 3 ms to minimize.
[2024-05-23 01:35:08] [INFO ] Deduced a trap composed of 101 places in 220 ms of which 5 ms to minimize.
[2024-05-23 01:35:08] [INFO ] Deduced a trap composed of 90 places in 213 ms of which 4 ms to minimize.
[2024-05-23 01:35:09] [INFO ] Deduced a trap composed of 92 places in 141 ms of which 2 ms to minimize.
[2024-05-23 01:35:09] [INFO ] Deduced a trap composed of 119 places in 159 ms of which 3 ms to minimize.
[2024-05-23 01:35:09] [INFO ] Deduced a trap composed of 88 places in 132 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-05-23 01:35:10] [INFO ] Deduced a trap composed of 77 places in 159 ms of which 4 ms to minimize.
[2024-05-23 01:35:10] [INFO ] Deduced a trap composed of 119 places in 130 ms of which 2 ms to minimize.
[2024-05-23 01:35:10] [INFO ] Deduced a trap composed of 110 places in 204 ms of which 4 ms to minimize.
[2024-05-23 01:35:11] [INFO ] Deduced a trap composed of 109 places in 132 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 349 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 227/583 variables, and 73 constraints, problems are : Problem set: 0 solved, 349 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/227 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 349/349 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 349 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 57/73 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-05-23 01:35:17] [INFO ] Deduced a trap composed of 135 places in 199 ms of which 3 ms to minimize.
[2024-05-23 01:35:17] [INFO ] Deduced a trap composed of 115 places in 275 ms of which 3 ms to minimize.
[2024-05-23 01:35:18] [INFO ] Deduced a trap composed of 114 places in 203 ms of which 3 ms to minimize.
[2024-05-23 01:35:19] [INFO ] Deduced a trap composed of 87 places in 171 ms of which 3 ms to minimize.
[2024-05-23 01:35:19] [INFO ] Deduced a trap composed of 134 places in 264 ms of which 4 ms to minimize.
[2024-05-23 01:35:19] [INFO ] Deduced a trap composed of 99 places in 274 ms of which 5 ms to minimize.
[2024-05-23 01:35:19] [INFO ] Deduced a trap composed of 111 places in 278 ms of which 4 ms to minimize.
[2024-05-23 01:35:20] [INFO ] Deduced a trap composed of 120 places in 161 ms of which 3 ms to minimize.
[2024-05-23 01:35:20] [INFO ] Deduced a trap composed of 97 places in 198 ms of which 3 ms to minimize.
[2024-05-23 01:35:20] [INFO ] Deduced a trap composed of 100 places in 193 ms of which 3 ms to minimize.
[2024-05-23 01:35:20] [INFO ] Deduced a trap composed of 129 places in 186 ms of which 3 ms to minimize.
[2024-05-23 01:35:20] [INFO ] Deduced a trap composed of 136 places in 158 ms of which 3 ms to minimize.
[2024-05-23 01:35:21] [INFO ] Deduced a trap composed of 101 places in 158 ms of which 2 ms to minimize.
[2024-05-23 01:35:21] [INFO ] Deduced a trap composed of 101 places in 165 ms of which 3 ms to minimize.
[2024-05-23 01:35:21] [INFO ] Deduced a trap composed of 123 places in 164 ms of which 3 ms to minimize.
[2024-05-23 01:35:21] [INFO ] Deduced a trap composed of 104 places in 159 ms of which 3 ms to minimize.
[2024-05-23 01:35:21] [INFO ] Deduced a trap composed of 159 places in 151 ms of which 3 ms to minimize.
[2024-05-23 01:35:22] [INFO ] Deduced a trap composed of 97 places in 146 ms of which 2 ms to minimize.
[2024-05-23 01:35:22] [INFO ] Deduced a trap composed of 92 places in 211 ms of which 4 ms to minimize.
[2024-05-23 01:35:22] [INFO ] Deduced a trap composed of 81 places in 205 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-05-23 01:35:25] [INFO ] Deduced a trap composed of 90 places in 137 ms of which 2 ms to minimize.
[2024-05-23 01:35:26] [INFO ] Deduced a trap composed of 110 places in 212 ms of which 3 ms to minimize.
[2024-05-23 01:35:26] [INFO ] Deduced a trap composed of 85 places in 210 ms of which 4 ms to minimize.
[2024-05-23 01:35:26] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 2 ms to minimize.
[2024-05-23 01:35:26] [INFO ] Deduced a trap composed of 111 places in 148 ms of which 2 ms to minimize.
[2024-05-23 01:35:26] [INFO ] Deduced a trap composed of 101 places in 172 ms of which 3 ms to minimize.
[2024-05-23 01:35:27] [INFO ] Deduced a trap composed of 69 places in 146 ms of which 3 ms to minimize.
[2024-05-23 01:35:27] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 2 ms to minimize.
[2024-05-23 01:35:27] [INFO ] Deduced a trap composed of 98 places in 164 ms of which 4 ms to minimize.
[2024-05-23 01:35:28] [INFO ] Deduced a trap composed of 122 places in 212 ms of which 4 ms to minimize.
[2024-05-23 01:35:28] [INFO ] Deduced a trap composed of 125 places in 165 ms of which 4 ms to minimize.
[2024-05-23 01:35:30] [INFO ] Deduced a trap composed of 103 places in 157 ms of which 4 ms to minimize.
[2024-05-23 01:35:31] [INFO ] Deduced a trap composed of 131 places in 165 ms of which 3 ms to minimize.
[2024-05-23 01:35:31] [INFO ] Deduced a trap composed of 129 places in 205 ms of which 3 ms to minimize.
[2024-05-23 01:35:31] [INFO ] Deduced a trap composed of 85 places in 205 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 15/108 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-05-23 01:35:34] [INFO ] Deduced a trap composed of 139 places in 243 ms of which 4 ms to minimize.
[2024-05-23 01:35:36] [INFO ] Deduced a trap composed of 106 places in 266 ms of which 4 ms to minimize.
[2024-05-23 01:35:36] [INFO ] Deduced a trap composed of 87 places in 213 ms of which 4 ms to minimize.
[2024-05-23 01:35:37] [INFO ] Deduced a trap composed of 107 places in 208 ms of which 4 ms to minimize.
[2024-05-23 01:35:37] [INFO ] Deduced a trap composed of 110 places in 163 ms of which 3 ms to minimize.
[2024-05-23 01:35:37] [INFO ] Deduced a trap composed of 104 places in 225 ms of which 4 ms to minimize.
[2024-05-23 01:35:37] [INFO ] Deduced a trap composed of 58 places in 172 ms of which 4 ms to minimize.
[2024-05-23 01:35:38] [INFO ] Deduced a trap composed of 88 places in 123 ms of which 2 ms to minimize.
[2024-05-23 01:35:38] [INFO ] Deduced a trap composed of 46 places in 171 ms of which 4 ms to minimize.
[2024-05-23 01:35:40] [INFO ] Deduced a trap composed of 97 places in 234 ms of which 4 ms to minimize.
[2024-05-23 01:35:40] [INFO ] Deduced a trap composed of 59 places in 232 ms of which 4 ms to minimize.
[2024-05-23 01:35:41] [INFO ] Deduced a trap composed of 150 places in 148 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 12/120 constraints. Problems are: Problem set: 0 solved, 349 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 227/583 variables, and 120 constraints, problems are : Problem set: 0 solved, 349 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/227 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/349 constraints, Known Traps: 104/104 constraints]
After SMT, in 60228ms problems are : Problem set: 0 solved, 349 unsolved
Search for dead transitions found 0 dead transitions in 60233ms
Starting structural reductions in LTL mode, iteration 1 : 227/236 places, 356/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61433 ms. Remains : 227/236 places, 356/461 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-07-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 212 ms.
Stack based approach found an accepted trace after 100 steps with 0 reset with depth 101 and stack size 101 in 3 ms.
FORMULA Anderson-PT-07-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-07-LTLFireability-02 finished in 61869 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||X(X(p1))||(G(p2)&&F(p0))))))'
Support contains 3 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 461/461 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 226 transition count 343
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 226 transition count 343
Applied a total of 20 rules in 6 ms. Remains 226 /236 variables (removed 10) and now considering 343/461 (removed 118) transitions.
// Phase 1: matrix 343 rows 226 cols
[2024-05-23 01:35:46] [INFO ] Computed 16 invariants in 3 ms
[2024-05-23 01:35:46] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-23 01:35:46] [INFO ] Invariant cache hit.
[2024-05-23 01:35:46] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-23 01:35:47] [INFO ] Implicit Places using invariants and state equation in 835 ms returned []
Implicit Place search using SMT with State Equation took 1041 ms to find 0 implicit places.
Running 336 sub problems to find dead transitions.
[2024-05-23 01:35:47] [INFO ] Invariant cache hit.
[2024-05-23 01:35:47] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-23 01:35:50] [INFO ] Deduced a trap composed of 80 places in 161 ms of which 3 ms to minimize.
[2024-05-23 01:35:51] [INFO ] Deduced a trap composed of 71 places in 190 ms of which 3 ms to minimize.
[2024-05-23 01:35:53] [INFO ] Deduced a trap composed of 99 places in 251 ms of which 4 ms to minimize.
[2024-05-23 01:35:53] [INFO ] Deduced a trap composed of 67 places in 177 ms of which 3 ms to minimize.
[2024-05-23 01:35:53] [INFO ] Deduced a trap composed of 121 places in 268 ms of which 4 ms to minimize.
[2024-05-23 01:35:54] [INFO ] Deduced a trap composed of 68 places in 274 ms of which 4 ms to minimize.
[2024-05-23 01:35:54] [INFO ] Deduced a trap composed of 64 places in 271 ms of which 4 ms to minimize.
[2024-05-23 01:35:54] [INFO ] Deduced a trap composed of 97 places in 261 ms of which 5 ms to minimize.
[2024-05-23 01:35:54] [INFO ] Deduced a trap composed of 147 places in 182 ms of which 3 ms to minimize.
[2024-05-23 01:35:55] [INFO ] Deduced a trap composed of 91 places in 258 ms of which 4 ms to minimize.
[2024-05-23 01:35:55] [INFO ] Deduced a trap composed of 74 places in 268 ms of which 4 ms to minimize.
[2024-05-23 01:35:55] [INFO ] Deduced a trap composed of 113 places in 231 ms of which 4 ms to minimize.
[2024-05-23 01:35:55] [INFO ] Deduced a trap composed of 96 places in 249 ms of which 3 ms to minimize.
[2024-05-23 01:35:56] [INFO ] Deduced a trap composed of 100 places in 260 ms of which 4 ms to minimize.
[2024-05-23 01:35:56] [INFO ] Deduced a trap composed of 97 places in 275 ms of which 4 ms to minimize.
[2024-05-23 01:35:56] [INFO ] Deduced a trap composed of 74 places in 160 ms of which 3 ms to minimize.
[2024-05-23 01:35:56] [INFO ] Deduced a trap composed of 97 places in 263 ms of which 4 ms to minimize.
[2024-05-23 01:35:57] [INFO ] Deduced a trap composed of 44 places in 187 ms of which 6 ms to minimize.
[2024-05-23 01:35:57] [INFO ] Deduced a trap composed of 110 places in 145 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-23 01:35:59] [INFO ] Deduced a trap composed of 78 places in 259 ms of which 4 ms to minimize.
[2024-05-23 01:35:59] [INFO ] Deduced a trap composed of 91 places in 162 ms of which 3 ms to minimize.
[2024-05-23 01:35:59] [INFO ] Deduced a trap composed of 49 places in 161 ms of which 3 ms to minimize.
[2024-05-23 01:36:00] [INFO ] Deduced a trap composed of 110 places in 146 ms of which 2 ms to minimize.
[2024-05-23 01:36:00] [INFO ] Deduced a trap composed of 139 places in 156 ms of which 2 ms to minimize.
[2024-05-23 01:36:00] [INFO ] Deduced a trap composed of 132 places in 155 ms of which 2 ms to minimize.
[2024-05-23 01:36:00] [INFO ] Deduced a trap composed of 120 places in 159 ms of which 3 ms to minimize.
[2024-05-23 01:36:01] [INFO ] Deduced a trap composed of 79 places in 184 ms of which 3 ms to minimize.
[2024-05-23 01:36:01] [INFO ] Deduced a trap composed of 128 places in 170 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 9/44 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-23 01:36:08] [INFO ] Deduced a trap composed of 73 places in 194 ms of which 3 ms to minimize.
[2024-05-23 01:36:08] [INFO ] Deduced a trap composed of 123 places in 162 ms of which 3 ms to minimize.
[2024-05-23 01:36:09] [INFO ] Deduced a trap composed of 152 places in 206 ms of which 3 ms to minimize.
[2024-05-23 01:36:09] [INFO ] Deduced a trap composed of 98 places in 158 ms of which 2 ms to minimize.
[2024-05-23 01:36:10] [INFO ] Deduced a trap composed of 102 places in 162 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-23 01:36:12] [INFO ] Deduced a trap composed of 99 places in 164 ms of which 3 ms to minimize.
[2024-05-23 01:36:12] [INFO ] Deduced a trap composed of 84 places in 258 ms of which 4 ms to minimize.
[2024-05-23 01:36:12] [INFO ] Deduced a trap composed of 78 places in 200 ms of which 2 ms to minimize.
[2024-05-23 01:36:13] [INFO ] Deduced a trap composed of 119 places in 269 ms of which 4 ms to minimize.
[2024-05-23 01:36:13] [INFO ] Deduced a trap composed of 69 places in 262 ms of which 4 ms to minimize.
[2024-05-23 01:36:13] [INFO ] Deduced a trap composed of 83 places in 254 ms of which 4 ms to minimize.
[2024-05-23 01:36:13] [INFO ] Deduced a trap composed of 53 places in 198 ms of which 3 ms to minimize.
[2024-05-23 01:36:14] [INFO ] Deduced a trap composed of 53 places in 205 ms of which 3 ms to minimize.
[2024-05-23 01:36:14] [INFO ] Deduced a trap composed of 98 places in 166 ms of which 3 ms to minimize.
[2024-05-23 01:36:14] [INFO ] Deduced a trap composed of 83 places in 259 ms of which 4 ms to minimize.
[2024-05-23 01:36:15] [INFO ] Deduced a trap composed of 101 places in 269 ms of which 4 ms to minimize.
[2024-05-23 01:36:15] [INFO ] Deduced a trap composed of 122 places in 247 ms of which 5 ms to minimize.
[2024-05-23 01:36:15] [INFO ] Deduced a trap composed of 108 places in 248 ms of which 3 ms to minimize.
[2024-05-23 01:36:15] [INFO ] Deduced a trap composed of 96 places in 155 ms of which 2 ms to minimize.
[2024-05-23 01:36:16] [INFO ] Deduced a trap composed of 121 places in 258 ms of which 4 ms to minimize.
[2024-05-23 01:36:16] [INFO ] Deduced a trap composed of 144 places in 156 ms of which 3 ms to minimize.
[2024-05-23 01:36:16] [INFO ] Deduced a trap composed of 109 places in 249 ms of which 4 ms to minimize.
[2024-05-23 01:36:16] [INFO ] Deduced a trap composed of 123 places in 258 ms of which 4 ms to minimize.
[2024-05-23 01:36:17] [INFO ] Deduced a trap composed of 89 places in 260 ms of which 5 ms to minimize.
[2024-05-23 01:36:17] [INFO ] Deduced a trap composed of 154 places in 189 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 226/569 variables, and 69 constraints, problems are : Problem set: 0 solved, 336 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/226 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 336 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 53/69 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-23 01:36:19] [INFO ] Deduced a trap composed of 128 places in 213 ms of which 4 ms to minimize.
[2024-05-23 01:36:19] [INFO ] Deduced a trap composed of 77 places in 160 ms of which 4 ms to minimize.
[2024-05-23 01:36:19] [INFO ] Deduced a trap composed of 105 places in 204 ms of which 4 ms to minimize.
[2024-05-23 01:36:20] [INFO ] Deduced a trap composed of 140 places in 136 ms of which 3 ms to minimize.
[2024-05-23 01:36:21] [INFO ] Deduced a trap composed of 36 places in 205 ms of which 4 ms to minimize.
[2024-05-23 01:36:21] [INFO ] Deduced a trap composed of 122 places in 153 ms of which 2 ms to minimize.
[2024-05-23 01:36:21] [INFO ] Deduced a trap composed of 55 places in 198 ms of which 4 ms to minimize.
[2024-05-23 01:36:22] [INFO ] Deduced a trap composed of 107 places in 154 ms of which 3 ms to minimize.
[2024-05-23 01:36:22] [INFO ] Deduced a trap composed of 63 places in 122 ms of which 3 ms to minimize.
[2024-05-23 01:36:23] [INFO ] Deduced a trap composed of 127 places in 159 ms of which 4 ms to minimize.
[2024-05-23 01:36:23] [INFO ] Deduced a trap composed of 131 places in 132 ms of which 2 ms to minimize.
[2024-05-23 01:36:23] [INFO ] Deduced a trap composed of 97 places in 228 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 12/81 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 226/569 variables, and 81 constraints, problems are : Problem set: 0 solved, 336 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/226 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/336 constraints, Known Traps: 65/65 constraints]
After SMT, in 60260ms problems are : Problem set: 0 solved, 336 unsolved
Search for dead transitions found 0 dead transitions in 60267ms
Starting structural reductions in LTL mode, iteration 1 : 226/236 places, 343/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61316 ms. Remains : 226/236 places, 343/461 transitions.
Stuttering acceptance computed with spot in 515 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p0)), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Anderson-PT-07-LTLFireability-04
Product exploration explored 100000 steps with 20000 reset in 341 ms.
Product exploration explored 100000 steps with 20000 reset in 275 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 p2) p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 121 ms. Reduced automaton from 11 states, 20 edges and 3 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
RANDOM walk for 4956 steps (0 resets) in 14 ms. (330 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 128 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 1 out of 226 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 343/343 transitions.
Applied a total of 0 rules in 4 ms. Remains 226 /226 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-23 01:36:49] [INFO ] Invariant cache hit.
[2024-05-23 01:36:50] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-23 01:36:50] [INFO ] Invariant cache hit.
[2024-05-23 01:36:50] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-23 01:36:51] [INFO ] Implicit Places using invariants and state equation in 1098 ms returned []
Implicit Place search using SMT with State Equation took 1414 ms to find 0 implicit places.
Running 336 sub problems to find dead transitions.
[2024-05-23 01:36:51] [INFO ] Invariant cache hit.
[2024-05-23 01:36:51] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-23 01:36:54] [INFO ] Deduced a trap composed of 80 places in 203 ms of which 4 ms to minimize.
[2024-05-23 01:36:55] [INFO ] Deduced a trap composed of 71 places in 164 ms of which 4 ms to minimize.
[2024-05-23 01:36:56] [INFO ] Deduced a trap composed of 99 places in 122 ms of which 3 ms to minimize.
[2024-05-23 01:36:56] [INFO ] Deduced a trap composed of 67 places in 208 ms of which 4 ms to minimize.
[2024-05-23 01:36:56] [INFO ] Deduced a trap composed of 121 places in 122 ms of which 3 ms to minimize.
[2024-05-23 01:36:57] [INFO ] Deduced a trap composed of 68 places in 207 ms of which 4 ms to minimize.
[2024-05-23 01:36:57] [INFO ] Deduced a trap composed of 64 places in 206 ms of which 3 ms to minimize.
[2024-05-23 01:36:57] [INFO ] Deduced a trap composed of 97 places in 211 ms of which 4 ms to minimize.
[2024-05-23 01:36:57] [INFO ] Deduced a trap composed of 147 places in 210 ms of which 4 ms to minimize.
[2024-05-23 01:36:58] [INFO ] Deduced a trap composed of 91 places in 209 ms of which 3 ms to minimize.
[2024-05-23 01:36:58] [INFO ] Deduced a trap composed of 74 places in 210 ms of which 2 ms to minimize.
[2024-05-23 01:36:58] [INFO ] Deduced a trap composed of 113 places in 228 ms of which 4 ms to minimize.
[2024-05-23 01:36:58] [INFO ] Deduced a trap composed of 96 places in 157 ms of which 3 ms to minimize.
[2024-05-23 01:36:58] [INFO ] Deduced a trap composed of 100 places in 260 ms of which 4 ms to minimize.
[2024-05-23 01:36:59] [INFO ] Deduced a trap composed of 97 places in 260 ms of which 5 ms to minimize.
[2024-05-23 01:36:59] [INFO ] Deduced a trap composed of 74 places in 262 ms of which 4 ms to minimize.
[2024-05-23 01:36:59] [INFO ] Deduced a trap composed of 97 places in 255 ms of which 5 ms to minimize.
[2024-05-23 01:37:00] [INFO ] Deduced a trap composed of 44 places in 258 ms of which 4 ms to minimize.
[2024-05-23 01:37:00] [INFO ] Deduced a trap composed of 110 places in 166 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-23 01:37:02] [INFO ] Deduced a trap composed of 78 places in 161 ms of which 3 ms to minimize.
[2024-05-23 01:37:02] [INFO ] Deduced a trap composed of 91 places in 248 ms of which 4 ms to minimize.
[2024-05-23 01:37:02] [INFO ] Deduced a trap composed of 49 places in 169 ms of which 3 ms to minimize.
[2024-05-23 01:37:02] [INFO ] Deduced a trap composed of 110 places in 169 ms of which 3 ms to minimize.
[2024-05-23 01:37:02] [INFO ] Deduced a trap composed of 139 places in 259 ms of which 4 ms to minimize.
[2024-05-23 01:37:03] [INFO ] Deduced a trap composed of 132 places in 261 ms of which 4 ms to minimize.
[2024-05-23 01:37:03] [INFO ] Deduced a trap composed of 120 places in 261 ms of which 4 ms to minimize.
[2024-05-23 01:37:04] [INFO ] Deduced a trap composed of 79 places in 250 ms of which 4 ms to minimize.
[2024-05-23 01:37:04] [INFO ] Deduced a trap composed of 128 places in 227 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 9/44 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-23 01:37:11] [INFO ] Deduced a trap composed of 73 places in 177 ms of which 3 ms to minimize.
[2024-05-23 01:37:11] [INFO ] Deduced a trap composed of 123 places in 156 ms of which 3 ms to minimize.
[2024-05-23 01:37:12] [INFO ] Deduced a trap composed of 152 places in 255 ms of which 4 ms to minimize.
[2024-05-23 01:37:12] [INFO ] Deduced a trap composed of 98 places in 255 ms of which 4 ms to minimize.
[2024-05-23 01:37:13] [INFO ] Deduced a trap composed of 102 places in 181 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-23 01:37:15] [INFO ] Deduced a trap composed of 99 places in 171 ms of which 3 ms to minimize.
[2024-05-23 01:37:15] [INFO ] Deduced a trap composed of 84 places in 216 ms of which 4 ms to minimize.
[2024-05-23 01:37:16] [INFO ] Deduced a trap composed of 78 places in 214 ms of which 4 ms to minimize.
[2024-05-23 01:37:16] [INFO ] Deduced a trap composed of 119 places in 211 ms of which 4 ms to minimize.
[2024-05-23 01:37:16] [INFO ] Deduced a trap composed of 69 places in 204 ms of which 3 ms to minimize.
[2024-05-23 01:37:16] [INFO ] Deduced a trap composed of 83 places in 257 ms of which 4 ms to minimize.
[2024-05-23 01:37:17] [INFO ] Deduced a trap composed of 53 places in 244 ms of which 4 ms to minimize.
[2024-05-23 01:37:17] [INFO ] Deduced a trap composed of 53 places in 233 ms of which 4 ms to minimize.
[2024-05-23 01:37:17] [INFO ] Deduced a trap composed of 98 places in 161 ms of which 2 ms to minimize.
[2024-05-23 01:37:17] [INFO ] Deduced a trap composed of 83 places in 212 ms of which 4 ms to minimize.
[2024-05-23 01:37:18] [INFO ] Deduced a trap composed of 101 places in 232 ms of which 4 ms to minimize.
[2024-05-23 01:37:18] [INFO ] Deduced a trap composed of 122 places in 240 ms of which 4 ms to minimize.
[2024-05-23 01:37:18] [INFO ] Deduced a trap composed of 108 places in 164 ms of which 3 ms to minimize.
[2024-05-23 01:37:18] [INFO ] Deduced a trap composed of 96 places in 166 ms of which 2 ms to minimize.
[2024-05-23 01:37:19] [INFO ] Deduced a trap composed of 121 places in 167 ms of which 3 ms to minimize.
[2024-05-23 01:37:19] [INFO ] Deduced a trap composed of 144 places in 169 ms of which 4 ms to minimize.
[2024-05-23 01:37:19] [INFO ] Deduced a trap composed of 109 places in 164 ms of which 3 ms to minimize.
[2024-05-23 01:37:19] [INFO ] Deduced a trap composed of 123 places in 164 ms of which 3 ms to minimize.
[2024-05-23 01:37:19] [INFO ] Deduced a trap composed of 89 places in 165 ms of which 3 ms to minimize.
[2024-05-23 01:37:19] [INFO ] Deduced a trap composed of 154 places in 183 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-23 01:37:21] [INFO ] Deduced a trap composed of 109 places in 171 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 226/569 variables, and 70 constraints, problems are : Problem set: 0 solved, 336 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/226 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 336 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 54/70 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-23 01:37:23] [INFO ] Deduced a trap composed of 121 places in 158 ms of which 3 ms to minimize.
[2024-05-23 01:37:23] [INFO ] Deduced a trap composed of 100 places in 143 ms of which 3 ms to minimize.
[2024-05-23 01:37:23] [INFO ] Deduced a trap composed of 103 places in 159 ms of which 2 ms to minimize.
[2024-05-23 01:37:24] [INFO ] Deduced a trap composed of 98 places in 161 ms of which 3 ms to minimize.
[2024-05-23 01:37:24] [INFO ] Deduced a trap composed of 113 places in 161 ms of which 3 ms to minimize.
[2024-05-23 01:37:24] [INFO ] Deduced a trap composed of 116 places in 164 ms of which 3 ms to minimize.
[2024-05-23 01:37:24] [INFO ] Deduced a trap composed of 109 places in 129 ms of which 3 ms to minimize.
[2024-05-23 01:37:24] [INFO ] Deduced a trap composed of 111 places in 129 ms of which 2 ms to minimize.
[2024-05-23 01:37:24] [INFO ] Deduced a trap composed of 110 places in 125 ms of which 3 ms to minimize.
[2024-05-23 01:37:24] [INFO ] Deduced a trap composed of 132 places in 130 ms of which 2 ms to minimize.
[2024-05-23 01:37:25] [INFO ] Deduced a trap composed of 133 places in 135 ms of which 3 ms to minimize.
[2024-05-23 01:37:25] [INFO ] Deduced a trap composed of 118 places in 207 ms of which 4 ms to minimize.
[2024-05-23 01:37:25] [INFO ] Deduced a trap composed of 93 places in 205 ms of which 3 ms to minimize.
[2024-05-23 01:37:25] [INFO ] Deduced a trap composed of 82 places in 208 ms of which 4 ms to minimize.
[2024-05-23 01:37:26] [INFO ] Deduced a trap composed of 88 places in 205 ms of which 4 ms to minimize.
[2024-05-23 01:37:26] [INFO ] Deduced a trap composed of 124 places in 165 ms of which 4 ms to minimize.
[2024-05-23 01:37:26] [INFO ] Deduced a trap composed of 97 places in 207 ms of which 3 ms to minimize.
[2024-05-23 01:37:27] [INFO ] Deduced a trap composed of 100 places in 213 ms of which 4 ms to minimize.
[2024-05-23 01:37:27] [INFO ] Deduced a trap composed of 71 places in 207 ms of which 4 ms to minimize.
[2024-05-23 01:37:27] [INFO ] Deduced a trap composed of 146 places in 220 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-23 01:37:32] [INFO ] Deduced a trap composed of 80 places in 240 ms of which 3 ms to minimize.
[2024-05-23 01:37:32] [INFO ] Deduced a trap composed of 94 places in 222 ms of which 3 ms to minimize.
[2024-05-23 01:37:33] [INFO ] Deduced a trap composed of 99 places in 148 ms of which 3 ms to minimize.
[2024-05-23 01:37:33] [INFO ] Deduced a trap composed of 121 places in 260 ms of which 4 ms to minimize.
[2024-05-23 01:37:33] [INFO ] Deduced a trap composed of 60 places in 256 ms of which 4 ms to minimize.
[2024-05-23 01:37:34] [INFO ] Deduced a trap composed of 53 places in 196 ms of which 4 ms to minimize.
[2024-05-23 01:37:34] [INFO ] Deduced a trap composed of 79 places in 193 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 7/97 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-23 01:37:39] [INFO ] Deduced a trap composed of 165 places in 201 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 226/569 variables, and 98 constraints, problems are : Problem set: 0 solved, 336 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/226 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/336 constraints, Known Traps: 82/82 constraints]
After SMT, in 60174ms problems are : Problem set: 0 solved, 336 unsolved
Search for dead transitions found 0 dead transitions in 60179ms
Finished structural reductions in LTL mode , in 1 iterations and 61598 ms. Remains : 226/226 places, 343/343 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 : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
RANDOM walk for 1633 steps (0 resets) in 9 ms. (163 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 110 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Product exploration explored 100000 steps with 20000 reset in 164 ms.
Product exploration explored 100000 steps with 20000 reset in 437 ms.
Applying partial POR strategy [true, false, false, false, true, false]
Stuttering acceptance computed with spot in 243 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 226/226 places, 343/343 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 226 transition count 343
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 41 Pre rules applied. Total rules applied 49 place count 226 transition count 343
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 90 place count 226 transition count 343
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 225 transition count 330
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 225 transition count 330
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 91 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 225 transition count 330
Deduced a syphon composed of 91 places in 0 ms
Applied a total of 93 rules in 105 ms. Remains 225 /226 variables (removed 1) and now considering 330/343 (removed 13) transitions.
[2024-05-23 01:37:53] [INFO ] Redundant transitions in 41 ms returned []
Running 323 sub problems to find dead transitions.
// Phase 1: matrix 330 rows 225 cols
[2024-05-23 01:37:53] [INFO ] Computed 16 invariants in 4 ms
[2024-05-23 01:37:53] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 323 unsolved
[2024-05-23 01:37:56] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-23 01:37:56] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 2 ms to minimize.
[2024-05-23 01:37:57] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 2 ms to minimize.
[2024-05-23 01:37:57] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 3 ms to minimize.
[2024-05-23 01:37:57] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 3 ms to minimize.
[2024-05-23 01:37:57] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 3 ms to minimize.
[2024-05-23 01:37:57] [INFO ] Deduced a trap composed of 28 places in 199 ms of which 3 ms to minimize.
[2024-05-23 01:37:57] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 2 ms to minimize.
[2024-05-23 01:37:58] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-23 01:37:58] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-23 01:37:58] [INFO ] Deduced a trap composed of 63 places in 176 ms of which 2 ms to minimize.
[2024-05-23 01:37:59] [INFO ] Deduced a trap composed of 58 places in 175 ms of which 3 ms to minimize.
[2024-05-23 01:37:59] [INFO ] Deduced a trap composed of 63 places in 142 ms of which 2 ms to minimize.
[2024-05-23 01:37:59] [INFO ] Deduced a trap composed of 51 places in 148 ms of which 3 ms to minimize.
[2024-05-23 01:37:59] [INFO ] Deduced a trap composed of 64 places in 142 ms of which 3 ms to minimize.
[2024-05-23 01:37:59] [INFO ] Deduced a trap composed of 61 places in 149 ms of which 2 ms to minimize.
[2024-05-23 01:37:59] [INFO ] Deduced a trap composed of 49 places in 119 ms of which 2 ms to minimize.
[2024-05-23 01:38:00] [INFO ] Deduced a trap composed of 54 places in 139 ms of which 2 ms to minimize.
[2024-05-23 01:38:00] [INFO ] Deduced a trap composed of 45 places in 238 ms of which 4 ms to minimize.
[2024-05-23 01:38:00] [INFO ] Deduced a trap composed of 48 places in 150 ms of which 3 ms to minimize.
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 20/35 constraints. Problems are: Problem set: 91 solved, 232 unsolved
[2024-05-23 01:38:02] [INFO ] Deduced a trap composed of 56 places in 202 ms of which 4 ms to minimize.
[2024-05-23 01:38:02] [INFO ] Deduced a trap composed of 68 places in 257 ms of which 4 ms to minimize.
[2024-05-23 01:38:02] [INFO ] Deduced a trap composed of 48 places in 198 ms of which 4 ms to minimize.
[2024-05-23 01:38:02] [INFO ] Deduced a trap composed of 66 places in 197 ms of which 4 ms to minimize.
[2024-05-23 01:38:03] [INFO ] Deduced a trap composed of 69 places in 198 ms of which 4 ms to minimize.
[2024-05-23 01:38:03] [INFO ] Deduced a trap composed of 47 places in 205 ms of which 4 ms to minimize.
[2024-05-23 01:38:03] [INFO ] Deduced a trap composed of 69 places in 203 ms of which 3 ms to minimize.
[2024-05-23 01:38:03] [INFO ] Deduced a trap composed of 69 places in 263 ms of which 4 ms to minimize.
[2024-05-23 01:38:03] [INFO ] Deduced a trap composed of 69 places in 181 ms of which 3 ms to minimize.
[2024-05-23 01:38:04] [INFO ] Deduced a trap composed of 52 places in 171 ms of which 4 ms to minimize.
[2024-05-23 01:38:04] [INFO ] Deduced a trap composed of 50 places in 246 ms of which 4 ms to minimize.
[2024-05-23 01:38:04] [INFO ] Deduced a trap composed of 56 places in 128 ms of which 2 ms to minimize.
[2024-05-23 01:38:04] [INFO ] Deduced a trap composed of 59 places in 132 ms of which 2 ms to minimize.
[2024-05-23 01:38:04] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 3 ms to minimize.
[2024-05-23 01:38:04] [INFO ] Deduced a trap composed of 45 places in 127 ms of which 2 ms to minimize.
[2024-05-23 01:38:05] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 2 ms to minimize.
[2024-05-23 01:38:05] [INFO ] Deduced a trap composed of 40 places in 195 ms of which 3 ms to minimize.
[2024-05-23 01:38:05] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 3 ms to minimize.
[2024-05-23 01:38:05] [INFO ] Deduced a trap composed of 50 places in 201 ms of which 3 ms to minimize.
[2024-05-23 01:38:06] [INFO ] Deduced a trap composed of 45 places in 255 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 20/55 constraints. Problems are: Problem set: 91 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 0/55 constraints. Problems are: Problem set: 91 solved, 232 unsolved
At refinement iteration 5 (OVERLAPS) 1/225 variables, 1/56 constraints. Problems are: Problem set: 91 solved, 232 unsolved
[2024-05-23 01:38:11] [INFO ] Deduced a trap composed of 74 places in 206 ms of which 4 ms to minimize.
[2024-05-23 01:38:12] [INFO ] Deduced a trap composed of 56 places in 205 ms of which 3 ms to minimize.
[2024-05-23 01:38:12] [INFO ] Deduced a trap composed of 76 places in 129 ms of which 3 ms to minimize.
[2024-05-23 01:38:12] [INFO ] Deduced a trap composed of 60 places in 253 ms of which 4 ms to minimize.
[2024-05-23 01:38:12] [INFO ] Deduced a trap composed of 71 places in 165 ms of which 3 ms to minimize.
[2024-05-23 01:38:12] [INFO ] Deduced a trap composed of 65 places in 246 ms of which 4 ms to minimize.
[2024-05-23 01:38:13] [INFO ] Deduced a trap composed of 68 places in 257 ms of which 4 ms to minimize.
[2024-05-23 01:38:13] [INFO ] Deduced a trap composed of 60 places in 173 ms of which 2 ms to minimize.
[2024-05-23 01:38:13] [INFO ] Deduced a trap composed of 54 places in 248 ms of which 4 ms to minimize.
[2024-05-23 01:38:13] [INFO ] Deduced a trap composed of 52 places in 249 ms of which 4 ms to minimize.
[2024-05-23 01:38:14] [INFO ] Deduced a trap composed of 53 places in 160 ms of which 2 ms to minimize.
[2024-05-23 01:38:14] [INFO ] Deduced a trap composed of 57 places in 172 ms of which 3 ms to minimize.
[2024-05-23 01:38:14] [INFO ] Deduced a trap composed of 69 places in 158 ms of which 3 ms to minimize.
[2024-05-23 01:38:14] [INFO ] Deduced a trap composed of 47 places in 251 ms of which 4 ms to minimize.
[2024-05-23 01:38:14] [INFO ] Deduced a trap composed of 60 places in 164 ms of which 3 ms to minimize.
[2024-05-23 01:38:15] [INFO ] Deduced a trap composed of 51 places in 167 ms of which 3 ms to minimize.
[2024-05-23 01:38:15] [INFO ] Deduced a trap composed of 66 places in 173 ms of which 3 ms to minimize.
[2024-05-23 01:38:15] [INFO ] Deduced a trap composed of 54 places in 149 ms of which 3 ms to minimize.
[2024-05-23 01:38:15] [INFO ] Deduced a trap composed of 62 places in 167 ms of which 3 ms to minimize.
[2024-05-23 01:38:15] [INFO ] Deduced a trap composed of 47 places in 151 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 20/76 constraints. Problems are: Problem set: 91 solved, 232 unsolved
[2024-05-23 01:38:20] [INFO ] Deduced a trap composed of 52 places in 171 ms of which 3 ms to minimize.
[2024-05-23 01:38:20] [INFO ] Deduced a trap composed of 33 places in 152 ms of which 3 ms to minimize.
[2024-05-23 01:38:20] [INFO ] Deduced a trap composed of 56 places in 152 ms of which 3 ms to minimize.
[2024-05-23 01:38:20] [INFO ] Deduced a trap composed of 49 places in 149 ms of which 3 ms to minimize.
[2024-05-23 01:38:20] [INFO ] Deduced a trap composed of 51 places in 155 ms of which 3 ms to minimize.
[2024-05-23 01:38:20] [INFO ] Deduced a trap composed of 60 places in 149 ms of which 3 ms to minimize.
[2024-05-23 01:38:21] [INFO ] Deduced a trap composed of 55 places in 156 ms of which 3 ms to minimize.
[2024-05-23 01:38:21] [INFO ] Deduced a trap composed of 42 places in 149 ms of which 3 ms to minimize.
[2024-05-23 01:38:21] [INFO ] Deduced a trap composed of 51 places in 171 ms of which 2 ms to minimize.
[2024-05-23 01:38:21] [INFO ] Deduced a trap composed of 37 places in 188 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 10/86 constraints. Problems are: Problem set: 91 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 225/555 variables, and 86 constraints, problems are : Problem set: 91 solved, 232 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/225 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 323/323 constraints, Known Traps: 70/70 constraints]
Escalating to Integer solving :Problem set: 91 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 61/61 constraints. Problems are: Problem set: 91 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/61 constraints. Problems are: Problem set: 91 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 91/224 variables, 8/69 constraints. Problems are: Problem set: 91 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 7/76 constraints. Problems are: Problem set: 91 solved, 232 unsolved
[2024-05-23 01:38:28] [INFO ] Deduced a trap composed of 56 places in 250 ms of which 5 ms to minimize.
[2024-05-23 01:38:28] [INFO ] Deduced a trap composed of 61 places in 197 ms of which 4 ms to minimize.
[2024-05-23 01:38:29] [INFO ] Deduced a trap composed of 62 places in 253 ms of which 4 ms to minimize.
[2024-05-23 01:38:29] [INFO ] Deduced a trap composed of 46 places in 181 ms of which 4 ms to minimize.
[2024-05-23 01:38:29] [INFO ] Deduced a trap composed of 52 places in 195 ms of which 3 ms to minimize.
[2024-05-23 01:38:29] [INFO ] Deduced a trap composed of 69 places in 196 ms of which 4 ms to minimize.
[2024-05-23 01:38:29] [INFO ] Deduced a trap composed of 55 places in 194 ms of which 4 ms to minimize.
[2024-05-23 01:38:30] [INFO ] Deduced a trap composed of 55 places in 194 ms of which 3 ms to minimize.
[2024-05-23 01:38:30] [INFO ] Deduced a trap composed of 51 places in 194 ms of which 4 ms to minimize.
[2024-05-23 01:38:30] [INFO ] Deduced a trap composed of 45 places in 196 ms of which 4 ms to minimize.
[2024-05-23 01:38:30] [INFO ] Deduced a trap composed of 54 places in 193 ms of which 3 ms to minimize.
[2024-05-23 01:38:30] [INFO ] Deduced a trap composed of 65 places in 187 ms of which 4 ms to minimize.
[2024-05-23 01:38:31] [INFO ] Deduced a trap composed of 43 places in 187 ms of which 2 ms to minimize.
[2024-05-23 01:38:31] [INFO ] Deduced a trap composed of 59 places in 188 ms of which 4 ms to minimize.
[2024-05-23 01:38:31] [INFO ] Deduced a trap composed of 43 places in 189 ms of which 4 ms to minimize.
[2024-05-23 01:38:31] [INFO ] Deduced a trap composed of 45 places in 190 ms of which 4 ms to minimize.
[2024-05-23 01:38:31] [INFO ] Deduced a trap composed of 43 places in 196 ms of which 3 ms to minimize.
[2024-05-23 01:38:32] [INFO ] Deduced a trap composed of 44 places in 195 ms of which 3 ms to minimize.
[2024-05-23 01:38:32] [INFO ] Deduced a trap composed of 44 places in 204 ms of which 4 ms to minimize.
[2024-05-23 01:38:32] [INFO ] Deduced a trap composed of 48 places in 253 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 20/96 constraints. Problems are: Problem set: 91 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 224/555 variables, and 96 constraints, problems are : Problem set: 91 solved, 232 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/8 constraints, State Equation: 0/225 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 0/323 constraints, Known Traps: 81/90 constraints]
After SMT, in 60305ms problems are : Problem set: 91 solved, 232 unsolved
Search for dead transitions found 91 dead transitions in 60312ms
Found 91 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 91 transitions
Dead transitions reduction (with SMT) removed 91 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 225/226 places, 239/343 transitions.
Graph (complete) has 666 edges and 225 vertex of which 134 are kept as prefixes of interest. Removing 91 places using SCC suffix rule.3 ms
Discarding 91 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 134 /225 variables (removed 91) and now considering 239/239 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 134/226 places, 239/343 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60482 ms. Remains : 134/226 places, 239/343 transitions.
Built C files in :
/tmp/ltsmin1909980401775803722
[2024-05-23 01:38:54] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1909980401775803722
Running compilation step : cd /tmp/ltsmin1909980401775803722;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1245 ms.
Running link step : cd /tmp/ltsmin1909980401775803722;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin1909980401775803722;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12415419825242407152.hoa' '--buchi-type=spotba'
LTSmin run took 3425 ms.
FORMULA Anderson-PT-07-LTLFireability-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Anderson-PT-07-LTLFireability-04 finished in 192695 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 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 461/461 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 236 transition count 413
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 188 transition count 413
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 96 place count 188 transition count 371
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 180 place count 146 transition count 371
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 191 place count 135 transition count 252
Iterating global reduction 2 with 11 rules applied. Total rules applied 202 place count 135 transition count 252
Applied a total of 202 rules in 35 ms. Remains 135 /236 variables (removed 101) and now considering 252/461 (removed 209) transitions.
// Phase 1: matrix 252 rows 135 cols
[2024-05-23 01:38:58] [INFO ] Computed 16 invariants in 2 ms
[2024-05-23 01:38:59] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-23 01:38:59] [INFO ] Invariant cache hit.
[2024-05-23 01:38:59] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-23 01:38:59] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
[2024-05-23 01:38:59] [INFO ] Redundant transitions in 8 ms returned []
Running 245 sub problems to find dead transitions.
[2024-05-23 01:38:59] [INFO ] Invariant cache hit.
[2024-05-23 01:38:59] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:39:01] [INFO ] Deduced a trap composed of 51 places in 86 ms of which 1 ms to minimize.
[2024-05-23 01:39:01] [INFO ] Deduced a trap composed of 69 places in 211 ms of which 3 ms to minimize.
[2024-05-23 01:39:02] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 2 ms to minimize.
[2024-05-23 01:39:02] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 1 ms to minimize.
[2024-05-23 01:39:02] [INFO ] Deduced a trap composed of 46 places in 118 ms of which 2 ms to minimize.
[2024-05-23 01:39:02] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 2 ms to minimize.
[2024-05-23 01:39:02] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 2 ms to minimize.
[2024-05-23 01:39:03] [INFO ] Deduced a trap composed of 64 places in 161 ms of which 3 ms to minimize.
[2024-05-23 01:39:03] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 1 ms to minimize.
[2024-05-23 01:39:03] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 2 ms to minimize.
[2024-05-23 01:39:03] [INFO ] Deduced a trap composed of 52 places in 113 ms of which 1 ms to minimize.
[2024-05-23 01:39:03] [INFO ] Deduced a trap composed of 53 places in 168 ms of which 3 ms to minimize.
[2024-05-23 01:39:03] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 2 ms to minimize.
[2024-05-23 01:39:03] [INFO ] Deduced a trap composed of 50 places in 113 ms of which 2 ms to minimize.
[2024-05-23 01:39:04] [INFO ] Deduced a trap composed of 63 places in 110 ms of which 2 ms to minimize.
[2024-05-23 01:39:04] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 2 ms to minimize.
[2024-05-23 01:39:04] [INFO ] Deduced a trap composed of 52 places in 132 ms of which 2 ms to minimize.
[2024-05-23 01:39:04] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 3 ms to minimize.
[2024-05-23 01:39:04] [INFO ] Deduced a trap composed of 55 places in 135 ms of which 3 ms to minimize.
[2024-05-23 01:39:04] [INFO ] Deduced a trap composed of 61 places in 137 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:39:05] [INFO ] Deduced a trap composed of 63 places in 111 ms of which 2 ms to minimize.
[2024-05-23 01:39:05] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 2 ms to minimize.
[2024-05-23 01:39:05] [INFO ] Deduced a trap composed of 54 places in 159 ms of which 2 ms to minimize.
[2024-05-23 01:39:05] [INFO ] Deduced a trap composed of 69 places in 165 ms of which 3 ms to minimize.
[2024-05-23 01:39:05] [INFO ] Deduced a trap composed of 73 places in 112 ms of which 1 ms to minimize.
[2024-05-23 01:39:06] [INFO ] Deduced a trap composed of 74 places in 164 ms of which 2 ms to minimize.
[2024-05-23 01:39:06] [INFO ] Deduced a trap composed of 62 places in 120 ms of which 2 ms to minimize.
[2024-05-23 01:39:06] [INFO ] Deduced a trap composed of 67 places in 127 ms of which 1 ms to minimize.
[2024-05-23 01:39:06] [INFO ] Deduced a trap composed of 70 places in 114 ms of which 2 ms to minimize.
[2024-05-23 01:39:06] [INFO ] Deduced a trap composed of 76 places in 113 ms of which 2 ms to minimize.
[2024-05-23 01:39:06] [INFO ] Deduced a trap composed of 68 places in 166 ms of which 3 ms to minimize.
[2024-05-23 01:39:06] [INFO ] Deduced a trap composed of 68 places in 169 ms of which 3 ms to minimize.
[2024-05-23 01:39:06] [INFO ] Deduced a trap composed of 68 places in 113 ms of which 2 ms to minimize.
[2024-05-23 01:39:07] [INFO ] Deduced a trap composed of 70 places in 95 ms of which 2 ms to minimize.
[2024-05-23 01:39:07] [INFO ] Deduced a trap composed of 70 places in 100 ms of which 2 ms to minimize.
[2024-05-23 01:39:07] [INFO ] Deduced a trap composed of 68 places in 115 ms of which 2 ms to minimize.
[2024-05-23 01:39:07] [INFO ] Deduced a trap composed of 59 places in 113 ms of which 2 ms to minimize.
[2024-05-23 01:39:07] [INFO ] Deduced a trap composed of 57 places in 121 ms of which 1 ms to minimize.
[2024-05-23 01:39:08] [INFO ] Deduced a trap composed of 62 places in 122 ms of which 2 ms to minimize.
[2024-05-23 01:39:08] [INFO ] Deduced a trap composed of 54 places in 137 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:39:10] [INFO ] Deduced a trap composed of 59 places in 132 ms of which 3 ms to minimize.
[2024-05-23 01:39:10] [INFO ] Deduced a trap composed of 58 places in 134 ms of which 3 ms to minimize.
[2024-05-23 01:39:10] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 2 ms to minimize.
[2024-05-23 01:39:10] [INFO ] Deduced a trap composed of 54 places in 133 ms of which 3 ms to minimize.
[2024-05-23 01:39:10] [INFO ] Deduced a trap composed of 42 places in 172 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:39:12] [INFO ] Deduced a trap composed of 48 places in 174 ms of which 3 ms to minimize.
[2024-05-23 01:39:12] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 2 ms to minimize.
[2024-05-23 01:39:12] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 1 ms to minimize.
[2024-05-23 01:39:12] [INFO ] Deduced a trap composed of 53 places in 115 ms of which 2 ms to minimize.
[2024-05-23 01:39:12] [INFO ] Deduced a trap composed of 52 places in 113 ms of which 2 ms to minimize.
[2024-05-23 01:39:12] [INFO ] Deduced a trap composed of 56 places in 166 ms of which 2 ms to minimize.
[2024-05-23 01:39:13] [INFO ] Deduced a trap composed of 52 places in 109 ms of which 2 ms to minimize.
[2024-05-23 01:39:13] [INFO ] Deduced a trap composed of 63 places in 104 ms of which 1 ms to minimize.
[2024-05-23 01:39:13] [INFO ] Deduced a trap composed of 58 places in 119 ms of which 2 ms to minimize.
[2024-05-23 01:39:13] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 2 ms to minimize.
[2024-05-23 01:39:13] [INFO ] Deduced a trap composed of 51 places in 154 ms of which 2 ms to minimize.
[2024-05-23 01:39:13] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 2 ms to minimize.
[2024-05-23 01:39:13] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 2 ms to minimize.
[2024-05-23 01:39:14] [INFO ] Deduced a trap composed of 57 places in 137 ms of which 2 ms to minimize.
[2024-05-23 01:39:14] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 2 ms to minimize.
[2024-05-23 01:39:14] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:39:15] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 2 ms to minimize.
[2024-05-23 01:39:15] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 2 ms to minimize.
[2024-05-23 01:39:15] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 3 ms to minimize.
[2024-05-23 01:39:16] [INFO ] Deduced a trap composed of 55 places in 112 ms of which 3 ms to minimize.
[2024-05-23 01:39:16] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 3 ms to minimize.
[2024-05-23 01:39:16] [INFO ] Deduced a trap composed of 61 places in 146 ms of which 2 ms to minimize.
[2024-05-23 01:39:16] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 2 ms to minimize.
[2024-05-23 01:39:16] [INFO ] Deduced a trap composed of 50 places in 134 ms of which 2 ms to minimize.
[2024-05-23 01:39:16] [INFO ] Deduced a trap composed of 61 places in 131 ms of which 2 ms to minimize.
[2024-05-23 01:39:16] [INFO ] Deduced a trap composed of 56 places in 133 ms of which 3 ms to minimize.
[2024-05-23 01:39:17] [INFO ] Deduced a trap composed of 54 places in 112 ms of which 2 ms to minimize.
[2024-05-23 01:39:17] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 3 ms to minimize.
[2024-05-23 01:39:17] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 3 ms to minimize.
[2024-05-23 01:39:17] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 3 ms to minimize.
[2024-05-23 01:39:17] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 2 ms to minimize.
[2024-05-23 01:39:18] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 3 ms to minimize.
[2024-05-23 01:39:18] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 2 ms to minimize.
[2024-05-23 01:39:18] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 1 ms to minimize.
[2024-05-23 01:39:18] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 19/96 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 8 (OVERLAPS) 252/387 variables, 135/231 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 42/273 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 387/387 variables, and 273 constraints, problems are : Problem set: 0 solved, 245 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 245 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:39:31] [INFO ] Deduced a trap composed of 70 places in 184 ms of which 3 ms to minimize.
[2024-05-23 01:39:31] [INFO ] Deduced a trap composed of 58 places in 167 ms of which 3 ms to minimize.
[2024-05-23 01:39:31] [INFO ] Deduced a trap composed of 73 places in 161 ms of which 2 ms to minimize.
[2024-05-23 01:39:31] [INFO ] Deduced a trap composed of 58 places in 154 ms of which 5 ms to minimize.
[2024-05-23 01:39:31] [INFO ] Deduced a trap composed of 50 places in 178 ms of which 2 ms to minimize.
[2024-05-23 01:39:33] [INFO ] Deduced a trap composed of 47 places in 148 ms of which 3 ms to minimize.
[2024-05-23 01:39:33] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 3 ms to minimize.
[2024-05-23 01:39:34] [INFO ] Deduced a trap composed of 45 places in 150 ms of which 2 ms to minimize.
[2024-05-23 01:39:34] [INFO ] Deduced a trap composed of 53 places in 153 ms of which 3 ms to minimize.
[2024-05-23 01:39:35] [INFO ] Deduced a trap composed of 44 places in 150 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 10/106 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/387 variables, and 106 constraints, problems are : Problem set: 0 solved, 245 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/245 constraints, Known Traps: 90/90 constraints]
After SMT, in 60153ms problems are : Problem set: 0 solved, 245 unsolved
Search for dead transitions found 0 dead transitions in 60158ms
Starting structural reductions in SI_LTL mode, iteration 1 : 135/236 places, 252/461 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60874 ms. Remains : 135/236 places, 252/461 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-07-LTLFireability-06
Product exploration explored 100000 steps with 17 reset in 150 ms.
Product exploration explored 100000 steps with 13 reset in 318 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 10181 steps (1 resets) in 45 ms. (221 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 252/252 transitions.
Applied a total of 0 rules in 11 ms. Remains 135 /135 variables (removed 0) and now considering 252/252 (removed 0) transitions.
[2024-05-23 01:40:01] [INFO ] Invariant cache hit.
[2024-05-23 01:40:01] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-05-23 01:40:01] [INFO ] Invariant cache hit.
[2024-05-23 01:40:01] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-23 01:40:01] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 794 ms to find 0 implicit places.
[2024-05-23 01:40:01] [INFO ] Redundant transitions in 3 ms returned []
Running 245 sub problems to find dead transitions.
[2024-05-23 01:40:01] [INFO ] Invariant cache hit.
[2024-05-23 01:40:01] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:40:03] [INFO ] Deduced a trap composed of 51 places in 168 ms of which 3 ms to minimize.
[2024-05-23 01:40:03] [INFO ] Deduced a trap composed of 69 places in 174 ms of which 2 ms to minimize.
[2024-05-23 01:40:04] [INFO ] Deduced a trap composed of 67 places in 175 ms of which 3 ms to minimize.
[2024-05-23 01:40:04] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 3 ms to minimize.
[2024-05-23 01:40:04] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 1 ms to minimize.
[2024-05-23 01:40:04] [INFO ] Deduced a trap composed of 47 places in 163 ms of which 3 ms to minimize.
[2024-05-23 01:40:04] [INFO ] Deduced a trap composed of 47 places in 107 ms of which 2 ms to minimize.
[2024-05-23 01:40:05] [INFO ] Deduced a trap composed of 64 places in 119 ms of which 2 ms to minimize.
[2024-05-23 01:40:05] [INFO ] Deduced a trap composed of 61 places in 175 ms of which 3 ms to minimize.
[2024-05-23 01:40:05] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 2 ms to minimize.
[2024-05-23 01:40:05] [INFO ] Deduced a trap composed of 52 places in 115 ms of which 2 ms to minimize.
[2024-05-23 01:40:05] [INFO ] Deduced a trap composed of 53 places in 119 ms of which 2 ms to minimize.
[2024-05-23 01:40:05] [INFO ] Deduced a trap composed of 51 places in 112 ms of which 2 ms to minimize.
[2024-05-23 01:40:05] [INFO ] Deduced a trap composed of 50 places in 115 ms of which 1 ms to minimize.
[2024-05-23 01:40:06] [INFO ] Deduced a trap composed of 63 places in 168 ms of which 3 ms to minimize.
[2024-05-23 01:40:06] [INFO ] Deduced a trap composed of 44 places in 172 ms of which 2 ms to minimize.
[2024-05-23 01:40:06] [INFO ] Deduced a trap composed of 52 places in 162 ms of which 2 ms to minimize.
[2024-05-23 01:40:06] [INFO ] Deduced a trap composed of 49 places in 170 ms of which 3 ms to minimize.
[2024-05-23 01:40:06] [INFO ] Deduced a trap composed of 55 places in 163 ms of which 3 ms to minimize.
[2024-05-23 01:40:07] [INFO ] Deduced a trap composed of 61 places in 170 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:40:07] [INFO ] Deduced a trap composed of 63 places in 126 ms of which 3 ms to minimize.
[2024-05-23 01:40:07] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 2 ms to minimize.
[2024-05-23 01:40:07] [INFO ] Deduced a trap composed of 54 places in 116 ms of which 2 ms to minimize.
[2024-05-23 01:40:07] [INFO ] Deduced a trap composed of 69 places in 180 ms of which 3 ms to minimize.
[2024-05-23 01:40:08] [INFO ] Deduced a trap composed of 73 places in 108 ms of which 2 ms to minimize.
[2024-05-23 01:40:08] [INFO ] Deduced a trap composed of 74 places in 159 ms of which 2 ms to minimize.
[2024-05-23 01:40:08] [INFO ] Deduced a trap composed of 62 places in 104 ms of which 2 ms to minimize.
[2024-05-23 01:40:08] [INFO ] Deduced a trap composed of 67 places in 168 ms of which 3 ms to minimize.
[2024-05-23 01:40:08] [INFO ] Deduced a trap composed of 70 places in 100 ms of which 2 ms to minimize.
[2024-05-23 01:40:08] [INFO ] Deduced a trap composed of 76 places in 178 ms of which 2 ms to minimize.
[2024-05-23 01:40:08] [INFO ] Deduced a trap composed of 68 places in 109 ms of which 3 ms to minimize.
[2024-05-23 01:40:09] [INFO ] Deduced a trap composed of 68 places in 169 ms of which 3 ms to minimize.
[2024-05-23 01:40:09] [INFO ] Deduced a trap composed of 68 places in 174 ms of which 3 ms to minimize.
[2024-05-23 01:40:09] [INFO ] Deduced a trap composed of 70 places in 106 ms of which 2 ms to minimize.
[2024-05-23 01:40:10] [INFO ] Deduced a trap composed of 70 places in 184 ms of which 2 ms to minimize.
[2024-05-23 01:40:10] [INFO ] Deduced a trap composed of 68 places in 111 ms of which 2 ms to minimize.
[2024-05-23 01:40:10] [INFO ] Deduced a trap composed of 59 places in 137 ms of which 3 ms to minimize.
[2024-05-23 01:40:10] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 2 ms to minimize.
[2024-05-23 01:40:10] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 2 ms to minimize.
[2024-05-23 01:40:10] [INFO ] Deduced a trap composed of 54 places in 136 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:40:13] [INFO ] Deduced a trap composed of 59 places in 125 ms of which 3 ms to minimize.
[2024-05-23 01:40:13] [INFO ] Deduced a trap composed of 58 places in 108 ms of which 1 ms to minimize.
[2024-05-23 01:40:13] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 2 ms to minimize.
[2024-05-23 01:40:13] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 2 ms to minimize.
[2024-05-23 01:40:13] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:40:15] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 2 ms to minimize.
[2024-05-23 01:40:15] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 2 ms to minimize.
[2024-05-23 01:40:15] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 2 ms to minimize.
[2024-05-23 01:40:15] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 2 ms to minimize.
[2024-05-23 01:40:15] [INFO ] Deduced a trap composed of 52 places in 107 ms of which 5 ms to minimize.
[2024-05-23 01:40:16] [INFO ] Deduced a trap composed of 56 places in 156 ms of which 2 ms to minimize.
[2024-05-23 01:40:16] [INFO ] Deduced a trap composed of 52 places in 180 ms of which 2 ms to minimize.
[2024-05-23 01:40:16] [INFO ] Deduced a trap composed of 63 places in 180 ms of which 3 ms to minimize.
[2024-05-23 01:40:16] [INFO ] Deduced a trap composed of 58 places in 139 ms of which 2 ms to minimize.
[2024-05-23 01:40:16] [INFO ] Deduced a trap composed of 61 places in 114 ms of which 3 ms to minimize.
[2024-05-23 01:40:16] [INFO ] Deduced a trap composed of 51 places in 136 ms of which 3 ms to minimize.
[2024-05-23 01:40:17] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 2 ms to minimize.
[2024-05-23 01:40:17] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 3 ms to minimize.
[2024-05-23 01:40:17] [INFO ] Deduced a trap composed of 57 places in 174 ms of which 3 ms to minimize.
[2024-05-23 01:40:17] [INFO ] Deduced a trap composed of 63 places in 181 ms of which 2 ms to minimize.
[2024-05-23 01:40:17] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:40:18] [INFO ] Deduced a trap composed of 46 places in 140 ms of which 3 ms to minimize.
[2024-05-23 01:40:18] [INFO ] Deduced a trap composed of 43 places in 146 ms of which 3 ms to minimize.
[2024-05-23 01:40:19] [INFO ] Deduced a trap composed of 51 places in 144 ms of which 2 ms to minimize.
[2024-05-23 01:40:19] [INFO ] Deduced a trap composed of 55 places in 164 ms of which 3 ms to minimize.
[2024-05-23 01:40:19] [INFO ] Deduced a trap composed of 45 places in 167 ms of which 2 ms to minimize.
[2024-05-23 01:40:20] [INFO ] Deduced a trap composed of 61 places in 144 ms of which 2 ms to minimize.
[2024-05-23 01:40:20] [INFO ] Deduced a trap composed of 43 places in 182 ms of which 3 ms to minimize.
[2024-05-23 01:40:20] [INFO ] Deduced a trap composed of 50 places in 162 ms of which 2 ms to minimize.
[2024-05-23 01:40:20] [INFO ] Deduced a trap composed of 61 places in 166 ms of which 3 ms to minimize.
[2024-05-23 01:40:20] [INFO ] Deduced a trap composed of 56 places in 162 ms of which 2 ms to minimize.
[2024-05-23 01:40:21] [INFO ] Deduced a trap composed of 54 places in 179 ms of which 2 ms to minimize.
[2024-05-23 01:40:21] [INFO ] Deduced a trap composed of 45 places in 163 ms of which 3 ms to minimize.
[2024-05-23 01:40:21] [INFO ] Deduced a trap composed of 47 places in 168 ms of which 3 ms to minimize.
[2024-05-23 01:40:21] [INFO ] Deduced a trap composed of 44 places in 162 ms of which 2 ms to minimize.
[2024-05-23 01:40:22] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 2 ms to minimize.
[2024-05-23 01:40:22] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 3 ms to minimize.
[2024-05-23 01:40:22] [INFO ] Deduced a trap composed of 37 places in 175 ms of which 3 ms to minimize.
[2024-05-23 01:40:22] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 3 ms to minimize.
[2024-05-23 01:40:22] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 19/96 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 8 (OVERLAPS) 252/387 variables, 135/231 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 42/273 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 387/387 variables, and 273 constraints, problems are : Problem set: 0 solved, 245 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 245 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:40:33] [INFO ] Deduced a trap composed of 70 places in 93 ms of which 1 ms to minimize.
[2024-05-23 01:40:33] [INFO ] Deduced a trap composed of 58 places in 113 ms of which 2 ms to minimize.
[2024-05-23 01:40:33] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 1 ms to minimize.
[2024-05-23 01:40:33] [INFO ] Deduced a trap composed of 58 places in 157 ms of which 3 ms to minimize.
[2024-05-23 01:40:33] [INFO ] Deduced a trap composed of 50 places in 157 ms of which 2 ms to minimize.
[2024-05-23 01:40:35] [INFO ] Deduced a trap composed of 47 places in 173 ms of which 2 ms to minimize.
[2024-05-23 01:40:35] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 3 ms to minimize.
[2024-05-23 01:40:36] [INFO ] Deduced a trap composed of 45 places in 141 ms of which 3 ms to minimize.
[2024-05-23 01:40:37] [INFO ] Deduced a trap composed of 53 places in 137 ms of which 3 ms to minimize.
[2024-05-23 01:40:38] [INFO ] Deduced a trap composed of 44 places in 172 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 10/106 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/387 variables, and 106 constraints, problems are : Problem set: 0 solved, 245 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/245 constraints, Known Traps: 90/90 constraints]
After SMT, in 60187ms problems are : Problem set: 0 solved, 245 unsolved
Search for dead transitions found 0 dead transitions in 60190ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61007 ms. Remains : 135/135 places, 252/252 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 10809 steps (2 resets) in 20 ms. (514 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 12 reset in 186 ms.
Product exploration explored 100000 steps with 16 reset in 215 ms.
Built C files in :
/tmp/ltsmin11307736459019124652
[2024-05-23 01:41:03] [INFO ] Computing symmetric may disable matrix : 252 transitions.
[2024-05-23 01:41:03] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:41:03] [INFO ] Computing symmetric may enable matrix : 252 transitions.
[2024-05-23 01:41:03] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:41:03] [INFO ] Computing Do-Not-Accords matrix : 252 transitions.
[2024-05-23 01:41:03] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:41:03] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11307736459019124652
Running compilation step : cd /tmp/ltsmin11307736459019124652;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1145 ms.
Running link step : cd /tmp/ltsmin11307736459019124652;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin11307736459019124652;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14444349957382101820.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 252/252 transitions.
Applied a total of 0 rules in 8 ms. Remains 135 /135 variables (removed 0) and now considering 252/252 (removed 0) transitions.
[2024-05-23 01:41:18] [INFO ] Invariant cache hit.
[2024-05-23 01:41:18] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-05-23 01:41:18] [INFO ] Invariant cache hit.
[2024-05-23 01:41:18] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-23 01:41:18] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
[2024-05-23 01:41:18] [INFO ] Redundant transitions in 2 ms returned []
Running 245 sub problems to find dead transitions.
[2024-05-23 01:41:18] [INFO ] Invariant cache hit.
[2024-05-23 01:41:18] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:41:20] [INFO ] Deduced a trap composed of 51 places in 155 ms of which 2 ms to minimize.
[2024-05-23 01:41:20] [INFO ] Deduced a trap composed of 69 places in 148 ms of which 2 ms to minimize.
[2024-05-23 01:41:21] [INFO ] Deduced a trap composed of 67 places in 178 ms of which 3 ms to minimize.
[2024-05-23 01:41:21] [INFO ] Deduced a trap composed of 49 places in 162 ms of which 3 ms to minimize.
[2024-05-23 01:41:21] [INFO ] Deduced a trap composed of 46 places in 169 ms of which 3 ms to minimize.
[2024-05-23 01:41:22] [INFO ] Deduced a trap composed of 47 places in 150 ms of which 2 ms to minimize.
[2024-05-23 01:41:22] [INFO ] Deduced a trap composed of 47 places in 154 ms of which 3 ms to minimize.
[2024-05-23 01:41:22] [INFO ] Deduced a trap composed of 64 places in 114 ms of which 2 ms to minimize.
[2024-05-23 01:41:22] [INFO ] Deduced a trap composed of 61 places in 126 ms of which 2 ms to minimize.
[2024-05-23 01:41:22] [INFO ] Deduced a trap composed of 38 places in 180 ms of which 2 ms to minimize.
[2024-05-23 01:41:22] [INFO ] Deduced a trap composed of 52 places in 137 ms of which 2 ms to minimize.
[2024-05-23 01:41:23] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 2 ms to minimize.
[2024-05-23 01:41:23] [INFO ] Deduced a trap composed of 51 places in 109 ms of which 1 ms to minimize.
[2024-05-23 01:41:23] [INFO ] Deduced a trap composed of 50 places in 132 ms of which 3 ms to minimize.
[2024-05-23 01:41:23] [INFO ] Deduced a trap composed of 63 places in 112 ms of which 3 ms to minimize.
[2024-05-23 01:41:23] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 2 ms to minimize.
[2024-05-23 01:41:23] [INFO ] Deduced a trap composed of 52 places in 95 ms of which 2 ms to minimize.
[2024-05-23 01:41:23] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 2 ms to minimize.
[2024-05-23 01:41:23] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 2 ms to minimize.
[2024-05-23 01:41:24] [INFO ] Deduced a trap composed of 61 places in 145 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:41:24] [INFO ] Deduced a trap composed of 63 places in 110 ms of which 3 ms to minimize.
[2024-05-23 01:41:24] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 3 ms to minimize.
[2024-05-23 01:41:24] [INFO ] Deduced a trap composed of 54 places in 141 ms of which 3 ms to minimize.
[2024-05-23 01:41:24] [INFO ] Deduced a trap composed of 69 places in 128 ms of which 2 ms to minimize.
[2024-05-23 01:41:25] [INFO ] Deduced a trap composed of 73 places in 140 ms of which 2 ms to minimize.
[2024-05-23 01:41:25] [INFO ] Deduced a trap composed of 74 places in 136 ms of which 2 ms to minimize.
[2024-05-23 01:41:25] [INFO ] Deduced a trap composed of 62 places in 171 ms of which 3 ms to minimize.
[2024-05-23 01:41:25] [INFO ] Deduced a trap composed of 67 places in 163 ms of which 3 ms to minimize.
[2024-05-23 01:41:25] [INFO ] Deduced a trap composed of 70 places in 113 ms of which 2 ms to minimize.
[2024-05-23 01:41:25] [INFO ] Deduced a trap composed of 76 places in 151 ms of which 2 ms to minimize.
[2024-05-23 01:41:26] [INFO ] Deduced a trap composed of 68 places in 138 ms of which 3 ms to minimize.
[2024-05-23 01:41:26] [INFO ] Deduced a trap composed of 68 places in 135 ms of which 6 ms to minimize.
[2024-05-23 01:41:26] [INFO ] Deduced a trap composed of 68 places in 129 ms of which 2 ms to minimize.
[2024-05-23 01:41:26] [INFO ] Deduced a trap composed of 70 places in 156 ms of which 2 ms to minimize.
[2024-05-23 01:41:27] [INFO ] Deduced a trap composed of 70 places in 165 ms of which 3 ms to minimize.
[2024-05-23 01:41:27] [INFO ] Deduced a trap composed of 68 places in 145 ms of which 3 ms to minimize.
[2024-05-23 01:41:27] [INFO ] Deduced a trap composed of 59 places in 118 ms of which 2 ms to minimize.
[2024-05-23 01:41:27] [INFO ] Deduced a trap composed of 57 places in 115 ms of which 2 ms to minimize.
[2024-05-23 01:41:27] [INFO ] Deduced a trap composed of 62 places in 119 ms of which 2 ms to minimize.
[2024-05-23 01:41:27] [INFO ] Deduced a trap composed of 54 places in 159 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:41:30] [INFO ] Deduced a trap composed of 59 places in 140 ms of which 3 ms to minimize.
[2024-05-23 01:41:30] [INFO ] Deduced a trap composed of 58 places in 164 ms of which 3 ms to minimize.
[2024-05-23 01:41:30] [INFO ] Deduced a trap composed of 47 places in 166 ms of which 2 ms to minimize.
[2024-05-23 01:41:31] [INFO ] Deduced a trap composed of 54 places in 181 ms of which 2 ms to minimize.
[2024-05-23 01:41:31] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:41:33] [INFO ] Deduced a trap composed of 48 places in 172 ms of which 2 ms to minimize.
[2024-05-23 01:41:33] [INFO ] Deduced a trap composed of 46 places in 149 ms of which 3 ms to minimize.
[2024-05-23 01:41:33] [INFO ] Deduced a trap composed of 61 places in 114 ms of which 2 ms to minimize.
[2024-05-23 01:41:33] [INFO ] Deduced a trap composed of 53 places in 138 ms of which 2 ms to minimize.
[2024-05-23 01:41:33] [INFO ] Deduced a trap composed of 52 places in 132 ms of which 3 ms to minimize.
[2024-05-23 01:41:33] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 2 ms to minimize.
[2024-05-23 01:41:34] [INFO ] Deduced a trap composed of 52 places in 111 ms of which 2 ms to minimize.
[2024-05-23 01:41:34] [INFO ] Deduced a trap composed of 63 places in 119 ms of which 3 ms to minimize.
[2024-05-23 01:41:34] [INFO ] Deduced a trap composed of 58 places in 109 ms of which 2 ms to minimize.
[2024-05-23 01:41:34] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 2 ms to minimize.
[2024-05-23 01:41:34] [INFO ] Deduced a trap composed of 51 places in 158 ms of which 2 ms to minimize.
[2024-05-23 01:41:34] [INFO ] Deduced a trap composed of 44 places in 175 ms of which 2 ms to minimize.
[2024-05-23 01:41:35] [INFO ] Deduced a trap composed of 41 places in 188 ms of which 3 ms to minimize.
[2024-05-23 01:41:35] [INFO ] Deduced a trap composed of 57 places in 152 ms of which 2 ms to minimize.
[2024-05-23 01:41:35] [INFO ] Deduced a trap composed of 63 places in 111 ms of which 2 ms to minimize.
[2024-05-23 01:41:35] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:41:36] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 1 ms to minimize.
[2024-05-23 01:41:36] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 2 ms to minimize.
[2024-05-23 01:41:37] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 3 ms to minimize.
[2024-05-23 01:41:37] [INFO ] Deduced a trap composed of 55 places in 90 ms of which 2 ms to minimize.
[2024-05-23 01:41:37] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 3 ms to minimize.
[2024-05-23 01:41:37] [INFO ] Deduced a trap composed of 61 places in 85 ms of which 1 ms to minimize.
[2024-05-23 01:41:37] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 2 ms to minimize.
[2024-05-23 01:41:37] [INFO ] Deduced a trap composed of 50 places in 133 ms of which 3 ms to minimize.
[2024-05-23 01:41:37] [INFO ] Deduced a trap composed of 61 places in 137 ms of which 2 ms to minimize.
[2024-05-23 01:41:37] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 1 ms to minimize.
[2024-05-23 01:41:38] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 1 ms to minimize.
[2024-05-23 01:41:38] [INFO ] Deduced a trap composed of 45 places in 137 ms of which 3 ms to minimize.
[2024-05-23 01:41:38] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 2 ms to minimize.
[2024-05-23 01:41:38] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 2 ms to minimize.
[2024-05-23 01:41:38] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 2 ms to minimize.
[2024-05-23 01:41:38] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 2 ms to minimize.
[2024-05-23 01:41:38] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 2 ms to minimize.
[2024-05-23 01:41:39] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 3 ms to minimize.
[2024-05-23 01:41:39] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 19/96 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 8 (OVERLAPS) 252/387 variables, 135/231 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 42/273 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 387/387 variables, and 273 constraints, problems are : Problem set: 0 solved, 245 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 245 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:41:50] [INFO ] Deduced a trap composed of 70 places in 258 ms of which 5 ms to minimize.
[2024-05-23 01:41:50] [INFO ] Deduced a trap composed of 58 places in 228 ms of which 3 ms to minimize.
[2024-05-23 01:41:50] [INFO ] Deduced a trap composed of 73 places in 146 ms of which 2 ms to minimize.
[2024-05-23 01:41:50] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 2 ms to minimize.
[2024-05-23 01:41:50] [INFO ] Deduced a trap composed of 50 places in 102 ms of which 2 ms to minimize.
[2024-05-23 01:41:52] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 3 ms to minimize.
[2024-05-23 01:41:52] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 3 ms to minimize.
[2024-05-23 01:41:53] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 2 ms to minimize.
[2024-05-23 01:41:53] [INFO ] Deduced a trap composed of 53 places in 118 ms of which 2 ms to minimize.
[2024-05-23 01:41:54] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 10/106 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/387 variables, and 106 constraints, problems are : Problem set: 0 solved, 245 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/245 constraints, Known Traps: 90/90 constraints]
After SMT, in 60286ms problems are : Problem set: 0 solved, 245 unsolved
Search for dead transitions found 0 dead transitions in 60291ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61008 ms. Remains : 135/135 places, 252/252 transitions.
Built C files in :
/tmp/ltsmin11998349704830237140
[2024-05-23 01:42:19] [INFO ] Computing symmetric may disable matrix : 252 transitions.
[2024-05-23 01:42:19] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:42:19] [INFO ] Computing symmetric may enable matrix : 252 transitions.
[2024-05-23 01:42:19] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:42:19] [INFO ] Computing Do-Not-Accords matrix : 252 transitions.
[2024-05-23 01:42:19] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:42:19] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11998349704830237140
Running compilation step : cd /tmp/ltsmin11998349704830237140;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1111 ms.
Running link step : cd /tmp/ltsmin11998349704830237140;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin11998349704830237140;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7478592741952304133.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 01:42:34] [INFO ] Flatten gal took : 39 ms
[2024-05-23 01:42:34] [INFO ] Flatten gal took : 19 ms
[2024-05-23 01:42:34] [INFO ] Time to serialize gal into /tmp/LTL8334276670700748031.gal : 5 ms
[2024-05-23 01:42:34] [INFO ] Time to serialize properties into /tmp/LTL7556828945827967699.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8334276670700748031.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5609074713322704491.hoa' '-atoms' '/tmp/LTL7556828945827967699.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7556828945827967699.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5609074713322704491.hoa
Detected timeout of ITS tools.
[2024-05-23 01:42:49] [INFO ] Flatten gal took : 19 ms
[2024-05-23 01:42:49] [INFO ] Flatten gal took : 17 ms
[2024-05-23 01:42:49] [INFO ] Time to serialize gal into /tmp/LTL7397718071904068250.gal : 4 ms
[2024-05-23 01:42:49] [INFO ] Time to serialize properties into /tmp/LTL5396457464207205597.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7397718071904068250.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5396457464207205597.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((next_5==0)||(ncs_0_3==0))"))))
Formula 0 simplified : FG!"((next_5==0)||(ncs_0_3==0))"
Detected timeout of ITS tools.
[2024-05-23 01:43:04] [INFO ] Flatten gal took : 27 ms
[2024-05-23 01:43:04] [INFO ] Applying decomposition
[2024-05-23 01:43:04] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14256030061641786203.txt' '-o' '/tmp/graph14256030061641786203.bin' '-w' '/tmp/graph14256030061641786203.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14256030061641786203.bin' '-l' '-1' '-v' '-w' '/tmp/graph14256030061641786203.weights' '-q' '0' '-e' '0.001'
[2024-05-23 01:43:04] [INFO ] Decomposing Gal with order
[2024-05-23 01:43:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 01:43:04] [INFO ] Removed a total of 456 redundant transitions.
[2024-05-23 01:43:04] [INFO ] Flatten gal took : 131 ms
[2024-05-23 01:43:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 29 ms.
[2024-05-23 01:43:05] [INFO ] Time to serialize gal into /tmp/LTL13221015001753064520.gal : 11 ms
[2024-05-23 01:43:05] [INFO ] Time to serialize properties into /tmp/LTL5502807816165493486.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13221015001753064520.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5502807816165493486.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i0.i1.u5.next_5==0)||(i7.u42.ncs_0_3==0))"))))
Formula 0 simplified : FG!"((i0.i1.u5.next_5==0)||(i7.u42.ncs_0_3==0))"
Reverse transition relation is NOT exact ! Due to transitions t363_t412, t364_t413, t365_t414, t367_t416, t368_t417, t370_t419, t371_t420, t372_t421, t373_...700
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1090 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.9403,175708,1,0,270540,2074,3342,377484,342,14357,1257300
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Anderson-PT-07-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Anderson-PT-07-LTLFireability-06 finished in 258013 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(F(p1)&&G(p2)))))'
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 461/461 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 236 transition count 427
Reduce places removed 34 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 41 rules applied. Total rules applied 75 place count 202 transition count 420
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 82 place count 195 transition count 420
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 82 place count 195 transition count 378
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 166 place count 153 transition count 378
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 177 place count 142 transition count 259
Iterating global reduction 3 with 11 rules applied. Total rules applied 188 place count 142 transition count 259
Applied a total of 188 rules in 31 ms. Remains 142 /236 variables (removed 94) and now considering 259/461 (removed 202) transitions.
// Phase 1: matrix 259 rows 142 cols
[2024-05-23 01:43:17] [INFO ] Computed 16 invariants in 3 ms
[2024-05-23 01:43:17] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-05-23 01:43:17] [INFO ] Invariant cache hit.
[2024-05-23 01:43:17] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-23 01:43:17] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 792 ms to find 0 implicit places.
[2024-05-23 01:43:17] [INFO ] Redundant transitions in 1 ms returned []
Running 252 sub problems to find dead transitions.
[2024-05-23 01:43:17] [INFO ] Invariant cache hit.
[2024-05-23 01:43:17] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-23 01:43:19] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 3 ms to minimize.
[2024-05-23 01:43:20] [INFO ] Deduced a trap composed of 56 places in 141 ms of which 2 ms to minimize.
[2024-05-23 01:43:20] [INFO ] Deduced a trap composed of 51 places in 173 ms of which 3 ms to minimize.
[2024-05-23 01:43:20] [INFO ] Deduced a trap composed of 64 places in 122 ms of which 2 ms to minimize.
[2024-05-23 01:43:20] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 2 ms to minimize.
[2024-05-23 01:43:20] [INFO ] Deduced a trap composed of 55 places in 122 ms of which 2 ms to minimize.
[2024-05-23 01:43:21] [INFO ] Deduced a trap composed of 48 places in 121 ms of which 2 ms to minimize.
[2024-05-23 01:43:21] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 2 ms to minimize.
[2024-05-23 01:43:21] [INFO ] Deduced a trap composed of 52 places in 123 ms of which 2 ms to minimize.
[2024-05-23 01:43:21] [INFO ] Deduced a trap composed of 47 places in 122 ms of which 2 ms to minimize.
[2024-05-23 01:43:21] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 2 ms to minimize.
[2024-05-23 01:43:21] [INFO ] Deduced a trap composed of 46 places in 122 ms of which 2 ms to minimize.
[2024-05-23 01:43:22] [INFO ] Deduced a trap composed of 78 places in 122 ms of which 2 ms to minimize.
[2024-05-23 01:43:22] [INFO ] Deduced a trap composed of 45 places in 174 ms of which 2 ms to minimize.
[2024-05-23 01:43:22] [INFO ] Deduced a trap composed of 46 places in 120 ms of which 2 ms to minimize.
[2024-05-23 01:43:22] [INFO ] Deduced a trap composed of 61 places in 169 ms of which 3 ms to minimize.
[2024-05-23 01:43:22] [INFO ] Deduced a trap composed of 58 places in 123 ms of which 2 ms to minimize.
[2024-05-23 01:43:22] [INFO ] Deduced a trap composed of 53 places in 173 ms of which 3 ms to minimize.
[2024-05-23 01:43:22] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 2 ms to minimize.
[2024-05-23 01:43:23] [INFO ] Deduced a trap composed of 49 places in 171 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-23 01:43:23] [INFO ] Deduced a trap composed of 51 places in 122 ms of which 2 ms to minimize.
[2024-05-23 01:43:24] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 2 ms to minimize.
[2024-05-23 01:43:24] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 3 ms to minimize.
[2024-05-23 01:43:24] [INFO ] Deduced a trap composed of 63 places in 122 ms of which 2 ms to minimize.
[2024-05-23 01:43:24] [INFO ] Deduced a trap composed of 48 places in 122 ms of which 2 ms to minimize.
[2024-05-23 01:43:24] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 2 ms to minimize.
[2024-05-23 01:43:24] [INFO ] Deduced a trap composed of 54 places in 129 ms of which 2 ms to minimize.
[2024-05-23 01:43:25] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 3 ms to minimize.
[2024-05-23 01:43:25] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 2 ms to minimize.
[2024-05-23 01:43:25] [INFO ] Deduced a trap composed of 55 places in 140 ms of which 2 ms to minimize.
[2024-05-23 01:43:25] [INFO ] Deduced a trap composed of 56 places in 122 ms of which 2 ms to minimize.
[2024-05-23 01:43:25] [INFO ] Deduced a trap composed of 53 places in 124 ms of which 2 ms to minimize.
[2024-05-23 01:43:25] [INFO ] Deduced a trap composed of 54 places in 120 ms of which 2 ms to minimize.
[2024-05-23 01:43:25] [INFO ] Deduced a trap composed of 51 places in 171 ms of which 3 ms to minimize.
[2024-05-23 01:43:26] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 1 ms to minimize.
[2024-05-23 01:43:26] [INFO ] Deduced a trap composed of 47 places in 122 ms of which 2 ms to minimize.
[2024-05-23 01:43:26] [INFO ] Deduced a trap composed of 58 places in 173 ms of which 3 ms to minimize.
[2024-05-23 01:43:26] [INFO ] Deduced a trap composed of 55 places in 126 ms of which 2 ms to minimize.
[2024-05-23 01:43:26] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 2 ms to minimize.
[2024-05-23 01:43:26] [INFO ] Deduced a trap composed of 44 places in 151 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 259/401 variables, 142/198 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 42/240 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-23 01:43:36] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 2 ms to minimize.
[2024-05-23 01:43:37] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/401 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 10 (OVERLAPS) 0/401 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 242 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 142/142 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 42/58 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-23 01:43:49] [INFO ] Deduced a trap composed of 53 places in 118 ms of which 3 ms to minimize.
[2024-05-23 01:43:49] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 3 ms to minimize.
[2024-05-23 01:43:50] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 3 ms to minimize.
[2024-05-23 01:43:50] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 3 ms to minimize.
[2024-05-23 01:43:50] [INFO ] Deduced a trap composed of 50 places in 140 ms of which 2 ms to minimize.
[2024-05-23 01:43:50] [INFO ] Deduced a trap composed of 59 places in 115 ms of which 2 ms to minimize.
[2024-05-23 01:43:50] [INFO ] Deduced a trap composed of 56 places in 138 ms of which 3 ms to minimize.
[2024-05-23 01:43:50] [INFO ] Deduced a trap composed of 45 places in 141 ms of which 3 ms to minimize.
[2024-05-23 01:43:50] [INFO ] Deduced a trap composed of 65 places in 139 ms of which 3 ms to minimize.
[2024-05-23 01:43:51] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 3 ms to minimize.
[2024-05-23 01:43:51] [INFO ] Deduced a trap composed of 59 places in 116 ms of which 3 ms to minimize.
[2024-05-23 01:43:51] [INFO ] Deduced a trap composed of 65 places in 140 ms of which 5 ms to minimize.
[2024-05-23 01:43:51] [INFO ] Deduced a trap composed of 53 places in 135 ms of which 3 ms to minimize.
[2024-05-23 01:43:51] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 2 ms to minimize.
[2024-05-23 01:43:52] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 15/73 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 142/401 variables, and 73 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/142 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/252 constraints, Known Traps: 57/57 constraints]
After SMT, in 60248ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 60253ms
Starting structural reductions in SI_LTL mode, iteration 1 : 142/236 places, 259/461 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61084 ms. Remains : 142/236 places, 259/461 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Anderson-PT-07-LTLFireability-07
Product exploration explored 100000 steps with 156 reset in 258 ms.
Stack based approach found an accepted trace after 43 steps with 0 reset with depth 44 and stack size 44 in 1 ms.
FORMULA Anderson-PT-07-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-07-LTLFireability-07 finished in 61515 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 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 461/461 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 236 transition count 413
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 188 transition count 413
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 96 place count 188 transition count 371
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 180 place count 146 transition count 371
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 191 place count 135 transition count 252
Iterating global reduction 2 with 11 rules applied. Total rules applied 202 place count 135 transition count 252
Applied a total of 202 rules in 30 ms. Remains 135 /236 variables (removed 101) and now considering 252/461 (removed 209) transitions.
// Phase 1: matrix 252 rows 135 cols
[2024-05-23 01:44:18] [INFO ] Computed 16 invariants in 3 ms
[2024-05-23 01:44:18] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-23 01:44:18] [INFO ] Invariant cache hit.
[2024-05-23 01:44:18] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-23 01:44:19] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
[2024-05-23 01:44:19] [INFO ] Redundant transitions in 1 ms returned []
Running 245 sub problems to find dead transitions.
[2024-05-23 01:44:19] [INFO ] Invariant cache hit.
[2024-05-23 01:44:19] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:44:21] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 2 ms to minimize.
[2024-05-23 01:44:21] [INFO ] Deduced a trap composed of 55 places in 171 ms of which 2 ms to minimize.
[2024-05-23 01:44:21] [INFO ] Deduced a trap composed of 60 places in 118 ms of which 2 ms to minimize.
[2024-05-23 01:44:21] [INFO ] Deduced a trap composed of 68 places in 118 ms of which 2 ms to minimize.
[2024-05-23 01:44:21] [INFO ] Deduced a trap composed of 61 places in 113 ms of which 2 ms to minimize.
[2024-05-23 01:44:22] [INFO ] Deduced a trap composed of 75 places in 118 ms of which 2 ms to minimize.
[2024-05-23 01:44:22] [INFO ] Deduced a trap composed of 61 places in 122 ms of which 2 ms to minimize.
[2024-05-23 01:44:22] [INFO ] Deduced a trap composed of 66 places in 173 ms of which 3 ms to minimize.
[2024-05-23 01:44:22] [INFO ] Deduced a trap composed of 48 places in 119 ms of which 2 ms to minimize.
[2024-05-23 01:44:22] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 2 ms to minimize.
[2024-05-23 01:44:22] [INFO ] Deduced a trap composed of 66 places in 112 ms of which 2 ms to minimize.
[2024-05-23 01:44:22] [INFO ] Deduced a trap composed of 60 places in 117 ms of which 1 ms to minimize.
[2024-05-23 01:44:23] [INFO ] Deduced a trap composed of 58 places in 175 ms of which 3 ms to minimize.
[2024-05-23 01:44:23] [INFO ] Deduced a trap composed of 67 places in 175 ms of which 2 ms to minimize.
[2024-05-23 01:44:23] [INFO ] Deduced a trap composed of 68 places in 162 ms of which 3 ms to minimize.
[2024-05-23 01:44:23] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 1 ms to minimize.
[2024-05-23 01:44:23] [INFO ] Deduced a trap composed of 59 places in 112 ms of which 1 ms to minimize.
[2024-05-23 01:44:23] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 2 ms to minimize.
[2024-05-23 01:44:23] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 2 ms to minimize.
[2024-05-23 01:44:24] [INFO ] Deduced a trap composed of 57 places in 112 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:44:24] [INFO ] Deduced a trap composed of 56 places in 173 ms of which 3 ms to minimize.
[2024-05-23 01:44:24] [INFO ] Deduced a trap composed of 67 places in 123 ms of which 3 ms to minimize.
[2024-05-23 01:44:25] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 2 ms to minimize.
[2024-05-23 01:44:25] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 2 ms to minimize.
[2024-05-23 01:44:25] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 3 ms to minimize.
[2024-05-23 01:44:25] [INFO ] Deduced a trap composed of 53 places in 130 ms of which 2 ms to minimize.
[2024-05-23 01:44:25] [INFO ] Deduced a trap composed of 55 places in 133 ms of which 2 ms to minimize.
[2024-05-23 01:44:25] [INFO ] Deduced a trap composed of 54 places in 137 ms of which 3 ms to minimize.
[2024-05-23 01:44:26] [INFO ] Deduced a trap composed of 58 places in 136 ms of which 3 ms to minimize.
[2024-05-23 01:44:26] [INFO ] Deduced a trap composed of 59 places in 130 ms of which 2 ms to minimize.
[2024-05-23 01:44:26] [INFO ] Deduced a trap composed of 67 places in 115 ms of which 1 ms to minimize.
[2024-05-23 01:44:26] [INFO ] Deduced a trap composed of 60 places in 167 ms of which 2 ms to minimize.
[2024-05-23 01:44:26] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 2 ms to minimize.
[2024-05-23 01:44:26] [INFO ] Deduced a trap composed of 54 places in 111 ms of which 1 ms to minimize.
[2024-05-23 01:44:26] [INFO ] Deduced a trap composed of 35 places in 178 ms of which 3 ms to minimize.
[2024-05-23 01:44:26] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 1 ms to minimize.
[2024-05-23 01:44:27] [INFO ] Deduced a trap composed of 51 places in 116 ms of which 2 ms to minimize.
[2024-05-23 01:44:27] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 3 ms to minimize.
[2024-05-23 01:44:27] [INFO ] Deduced a trap composed of 50 places in 180 ms of which 2 ms to minimize.
[2024-05-23 01:44:27] [INFO ] Deduced a trap composed of 50 places in 125 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:44:29] [INFO ] Deduced a trap composed of 61 places in 162 ms of which 3 ms to minimize.
[2024-05-23 01:44:29] [INFO ] Deduced a trap composed of 57 places in 109 ms of which 2 ms to minimize.
[2024-05-23 01:44:29] [INFO ] Deduced a trap composed of 56 places in 104 ms of which 1 ms to minimize.
[2024-05-23 01:44:30] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 2 ms to minimize.
[2024-05-23 01:44:30] [INFO ] Deduced a trap composed of 62 places in 172 ms of which 3 ms to minimize.
[2024-05-23 01:44:30] [INFO ] Deduced a trap composed of 64 places in 112 ms of which 2 ms to minimize.
[2024-05-23 01:44:30] [INFO ] Deduced a trap composed of 73 places in 106 ms of which 1 ms to minimize.
[2024-05-23 01:44:30] [INFO ] Deduced a trap composed of 60 places in 169 ms of which 3 ms to minimize.
[2024-05-23 01:44:31] [INFO ] Deduced a trap composed of 55 places in 106 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 9/65 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:44:32] [INFO ] Deduced a trap composed of 49 places in 165 ms of which 2 ms to minimize.
[2024-05-23 01:44:32] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 2 ms to minimize.
[2024-05-23 01:44:32] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 2 ms to minimize.
[2024-05-23 01:44:32] [INFO ] Deduced a trap composed of 52 places in 114 ms of which 2 ms to minimize.
[2024-05-23 01:44:32] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 2 ms to minimize.
[2024-05-23 01:44:33] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 2 ms to minimize.
[2024-05-23 01:44:33] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 2 ms to minimize.
[2024-05-23 01:44:33] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 2 ms to minimize.
[2024-05-23 01:44:33] [INFO ] Deduced a trap composed of 50 places in 108 ms of which 2 ms to minimize.
[2024-05-23 01:44:33] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 2 ms to minimize.
[2024-05-23 01:44:33] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 2 ms to minimize.
[2024-05-23 01:44:33] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 1 ms to minimize.
[2024-05-23 01:44:34] [INFO ] Deduced a trap composed of 60 places in 102 ms of which 2 ms to minimize.
[2024-05-23 01:44:34] [INFO ] Deduced a trap composed of 50 places in 114 ms of which 1 ms to minimize.
[2024-05-23 01:44:34] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 2 ms to minimize.
[2024-05-23 01:44:34] [INFO ] Deduced a trap composed of 52 places in 115 ms of which 2 ms to minimize.
[2024-05-23 01:44:34] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 2 ms to minimize.
[2024-05-23 01:44:34] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 2 ms to minimize.
[2024-05-23 01:44:34] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 19/84 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:44:36] [INFO ] Deduced a trap composed of 49 places in 186 ms of which 3 ms to minimize.
[2024-05-23 01:44:36] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 1 ms to minimize.
[2024-05-23 01:44:36] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 2 ms to minimize.
[2024-05-23 01:44:36] [INFO ] Deduced a trap composed of 52 places in 116 ms of which 3 ms to minimize.
[2024-05-23 01:44:37] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 1 ms to minimize.
[2024-05-23 01:44:37] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 3 ms to minimize.
[2024-05-23 01:44:37] [INFO ] Deduced a trap composed of 57 places in 136 ms of which 2 ms to minimize.
[2024-05-23 01:44:37] [INFO ] Deduced a trap composed of 51 places in 134 ms of which 2 ms to minimize.
[2024-05-23 01:44:37] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 2 ms to minimize.
[2024-05-23 01:44:37] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 2 ms to minimize.
[2024-05-23 01:44:38] [INFO ] Deduced a trap composed of 55 places in 136 ms of which 2 ms to minimize.
[2024-05-23 01:44:38] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 3 ms to minimize.
[2024-05-23 01:44:38] [INFO ] Deduced a trap composed of 56 places in 113 ms of which 2 ms to minimize.
[2024-05-23 01:44:38] [INFO ] Deduced a trap composed of 65 places in 135 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 14/98 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:44:41] [INFO ] Deduced a trap composed of 55 places in 90 ms of which 2 ms to minimize.
[2024-05-23 01:44:41] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 2 ms to minimize.
[2024-05-23 01:44:42] [INFO ] Deduced a trap composed of 47 places in 175 ms of which 2 ms to minimize.
[2024-05-23 01:44:42] [INFO ] Deduced a trap composed of 71 places in 108 ms of which 2 ms to minimize.
[2024-05-23 01:44:42] [INFO ] Deduced a trap composed of 68 places in 116 ms of which 1 ms to minimize.
[2024-05-23 01:44:42] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 3 ms to minimize.
[2024-05-23 01:44:42] [INFO ] Deduced a trap composed of 63 places in 134 ms of which 2 ms to minimize.
[2024-05-23 01:44:42] [INFO ] Deduced a trap composed of 48 places in 111 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 8/106 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:44:44] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 2 ms to minimize.
[2024-05-23 01:44:44] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:44:46] [INFO ] Deduced a trap composed of 57 places in 169 ms of which 2 ms to minimize.
[2024-05-23 01:44:46] [INFO ] Deduced a trap composed of 36 places in 167 ms of which 3 ms to minimize.
[2024-05-23 01:44:46] [INFO ] Deduced a trap composed of 61 places in 162 ms of which 3 ms to minimize.
[2024-05-23 01:44:46] [INFO ] Deduced a trap composed of 48 places in 158 ms of which 3 ms to minimize.
[2024-05-23 01:44:46] [INFO ] Deduced a trap composed of 51 places in 169 ms of which 3 ms to minimize.
[2024-05-23 01:44:47] [INFO ] Deduced a trap composed of 71 places in 109 ms of which 1 ms to minimize.
[2024-05-23 01:44:47] [INFO ] Deduced a trap composed of 56 places in 164 ms of which 2 ms to minimize.
[2024-05-23 01:44:47] [INFO ] Deduced a trap composed of 54 places in 141 ms of which 2 ms to minimize.
[2024-05-23 01:44:47] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 2 ms to minimize.
[2024-05-23 01:44:47] [INFO ] Deduced a trap composed of 45 places in 175 ms of which 3 ms to minimize.
[2024-05-23 01:44:48] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 2 ms to minimize.
[2024-05-23 01:44:48] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 2 ms to minimize.
[2024-05-23 01:44:48] [INFO ] Deduced a trap composed of 47 places in 167 ms of which 2 ms to minimize.
[2024-05-23 01:44:48] [INFO ] Deduced a trap composed of 46 places in 172 ms of which 3 ms to minimize.
[2024-05-23 01:44:48] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 2 ms to minimize.
[2024-05-23 01:44:48] [INFO ] Deduced a trap composed of 45 places in 103 ms of which 2 ms to minimize.
[2024-05-23 01:44:49] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/387 variables, and 125 constraints, problems are : Problem set: 0 solved, 245 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 109/109 constraints]
Escalating to Integer solving :Problem set: 0 solved, 245 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 109/125 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:44:51] [INFO ] Deduced a trap composed of 45 places in 110 ms of which 3 ms to minimize.
[2024-05-23 01:44:52] [INFO ] Deduced a trap composed of 52 places in 164 ms of which 3 ms to minimize.
[2024-05-23 01:44:52] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 2 ms to minimize.
[2024-05-23 01:44:52] [INFO ] Deduced a trap composed of 54 places in 166 ms of which 3 ms to minimize.
[2024-05-23 01:44:52] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 2 ms to minimize.
[2024-05-23 01:44:52] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 2 ms to minimize.
[2024-05-23 01:44:52] [INFO ] Deduced a trap composed of 36 places in 167 ms of which 3 ms to minimize.
[2024-05-23 01:44:52] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 2 ms to minimize.
[2024-05-23 01:44:53] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 3 ms to minimize.
[2024-05-23 01:44:53] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 2 ms to minimize.
[2024-05-23 01:44:53] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 11/136 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:44:56] [INFO ] Deduced a trap composed of 52 places in 138 ms of which 2 ms to minimize.
[2024-05-23 01:44:56] [INFO ] Deduced a trap composed of 32 places in 181 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/387 variables, and 138 constraints, problems are : Problem set: 0 solved, 245 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/245 constraints, Known Traps: 122/122 constraints]
After SMT, in 60161ms problems are : Problem set: 0 solved, 245 unsolved
Search for dead transitions found 0 dead transitions in 60164ms
Starting structural reductions in SI_LTL mode, iteration 1 : 135/236 places, 252/461 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60804 ms. Remains : 135/236 places, 252/461 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-07-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 140 ms.
Stack based approach found an accepted trace after 38 steps with 0 reset with depth 39 and stack size 39 in 0 ms.
FORMULA Anderson-PT-07-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-07-LTLFireability-11 finished in 61033 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p1))||p0)))'
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 461/461 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 226 transition count 355
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 226 transition count 355
Applied a total of 20 rules in 5 ms. Remains 226 /236 variables (removed 10) and now considering 355/461 (removed 106) transitions.
// Phase 1: matrix 355 rows 226 cols
[2024-05-23 01:45:19] [INFO ] Computed 16 invariants in 2 ms
[2024-05-23 01:45:19] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-05-23 01:45:19] [INFO ] Invariant cache hit.
[2024-05-23 01:45:20] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-23 01:45:20] [INFO ] Implicit Places using invariants and state equation in 971 ms returned []
Implicit Place search using SMT with State Equation took 1235 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-05-23 01:45:20] [INFO ] Invariant cache hit.
[2024-05-23 01:45:20] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-23 01:45:23] [INFO ] Deduced a trap composed of 98 places in 121 ms of which 2 ms to minimize.
[2024-05-23 01:45:24] [INFO ] Deduced a trap composed of 71 places in 135 ms of which 2 ms to minimize.
[2024-05-23 01:45:24] [INFO ] Deduced a trap composed of 100 places in 270 ms of which 4 ms to minimize.
[2024-05-23 01:45:24] [INFO ] Deduced a trap composed of 97 places in 137 ms of which 2 ms to minimize.
[2024-05-23 01:45:24] [INFO ] Deduced a trap composed of 79 places in 137 ms of which 2 ms to minimize.
[2024-05-23 01:45:25] [INFO ] Deduced a trap composed of 85 places in 164 ms of which 4 ms to minimize.
[2024-05-23 01:45:25] [INFO ] Deduced a trap composed of 72 places in 200 ms of which 3 ms to minimize.
[2024-05-23 01:45:26] [INFO ] Deduced a trap composed of 125 places in 155 ms of which 2 ms to minimize.
[2024-05-23 01:45:26] [INFO ] Deduced a trap composed of 117 places in 208 ms of which 3 ms to minimize.
[2024-05-23 01:45:26] [INFO ] Deduced a trap composed of 126 places in 149 ms of which 3 ms to minimize.
[2024-05-23 01:45:26] [INFO ] Deduced a trap composed of 122 places in 156 ms of which 2 ms to minimize.
[2024-05-23 01:45:27] [INFO ] Deduced a trap composed of 101 places in 140 ms of which 2 ms to minimize.
[2024-05-23 01:45:27] [INFO ] Deduced a trap composed of 130 places in 198 ms of which 3 ms to minimize.
[2024-05-23 01:45:27] [INFO ] Deduced a trap composed of 134 places in 169 ms of which 4 ms to minimize.
[2024-05-23 01:45:27] [INFO ] Deduced a trap composed of 69 places in 137 ms of which 5 ms to minimize.
[2024-05-23 01:45:27] [INFO ] Deduced a trap composed of 116 places in 142 ms of which 2 ms to minimize.
[2024-05-23 01:45:27] [INFO ] Deduced a trap composed of 124 places in 135 ms of which 3 ms to minimize.
[2024-05-23 01:45:28] [INFO ] Deduced a trap composed of 138 places in 138 ms of which 3 ms to minimize.
[2024-05-23 01:45:28] [INFO ] Deduced a trap composed of 91 places in 140 ms of which 2 ms to minimize.
[2024-05-23 01:45:28] [INFO ] Deduced a trap composed of 132 places in 204 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-23 01:45:29] [INFO ] Deduced a trap composed of 87 places in 153 ms of which 4 ms to minimize.
[2024-05-23 01:45:30] [INFO ] Deduced a trap composed of 137 places in 170 ms of which 3 ms to minimize.
[2024-05-23 01:45:30] [INFO ] Deduced a trap composed of 104 places in 136 ms of which 2 ms to minimize.
[2024-05-23 01:45:30] [INFO ] Deduced a trap composed of 106 places in 143 ms of which 3 ms to minimize.
[2024-05-23 01:45:30] [INFO ] Deduced a trap composed of 136 places in 205 ms of which 3 ms to minimize.
[2024-05-23 01:45:30] [INFO ] Deduced a trap composed of 99 places in 166 ms of which 2 ms to minimize.
[2024-05-23 01:45:31] [INFO ] Deduced a trap composed of 72 places in 157 ms of which 2 ms to minimize.
[2024-05-23 01:45:31] [INFO ] Deduced a trap composed of 88 places in 190 ms of which 2 ms to minimize.
[2024-05-23 01:45:31] [INFO ] Deduced a trap composed of 81 places in 180 ms of which 2 ms to minimize.
[2024-05-23 01:45:31] [INFO ] Deduced a trap composed of 96 places in 210 ms of which 4 ms to minimize.
[2024-05-23 01:45:32] [INFO ] Deduced a trap composed of 123 places in 227 ms of which 4 ms to minimize.
[2024-05-23 01:45:32] [INFO ] Deduced a trap composed of 87 places in 172 ms of which 4 ms to minimize.
[2024-05-23 01:45:32] [INFO ] Deduced a trap composed of 117 places in 151 ms of which 2 ms to minimize.
[2024-05-23 01:45:32] [INFO ] Deduced a trap composed of 149 places in 201 ms of which 4 ms to minimize.
[2024-05-23 01:45:33] [INFO ] Deduced a trap composed of 64 places in 204 ms of which 3 ms to minimize.
[2024-05-23 01:45:33] [INFO ] Deduced a trap composed of 136 places in 173 ms of which 3 ms to minimize.
[2024-05-23 01:45:33] [INFO ] Deduced a trap composed of 69 places in 136 ms of which 3 ms to minimize.
[2024-05-23 01:45:33] [INFO ] Deduced a trap composed of 131 places in 123 ms of which 3 ms to minimize.
[2024-05-23 01:45:33] [INFO ] Deduced a trap composed of 109 places in 132 ms of which 3 ms to minimize.
[2024-05-23 01:45:33] [INFO ] Deduced a trap composed of 78 places in 134 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-23 01:45:37] [INFO ] Deduced a trap composed of 86 places in 137 ms of which 3 ms to minimize.
[2024-05-23 01:45:37] [INFO ] Deduced a trap composed of 112 places in 234 ms of which 4 ms to minimize.
[2024-05-23 01:45:38] [INFO ] Deduced a trap composed of 61 places in 161 ms of which 3 ms to minimize.
[2024-05-23 01:45:39] [INFO ] Deduced a trap composed of 108 places in 259 ms of which 4 ms to minimize.
[2024-05-23 01:45:39] [INFO ] Deduced a trap composed of 86 places in 258 ms of which 4 ms to minimize.
[2024-05-23 01:45:39] [INFO ] Deduced a trap composed of 102 places in 187 ms of which 2 ms to minimize.
[2024-05-23 01:45:39] [INFO ] Deduced a trap composed of 89 places in 188 ms of which 2 ms to minimize.
[2024-05-23 01:45:39] [INFO ] Deduced a trap composed of 117 places in 163 ms of which 3 ms to minimize.
[2024-05-23 01:45:40] [INFO ] Deduced a trap composed of 117 places in 252 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 9/65 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-23 01:45:43] [INFO ] Deduced a trap composed of 126 places in 250 ms of which 4 ms to minimize.
[2024-05-23 01:45:44] [INFO ] Deduced a trap composed of 140 places in 207 ms of which 4 ms to minimize.
[2024-05-23 01:45:44] [INFO ] Deduced a trap composed of 109 places in 204 ms of which 4 ms to minimize.
[2024-05-23 01:45:44] [INFO ] Deduced a trap composed of 58 places in 165 ms of which 4 ms to minimize.
[2024-05-23 01:45:45] [INFO ] Deduced a trap composed of 71 places in 251 ms of which 4 ms to minimize.
[2024-05-23 01:45:45] [INFO ] Deduced a trap composed of 82 places in 262 ms of which 4 ms to minimize.
[2024-05-23 01:45:45] [INFO ] Deduced a trap composed of 61 places in 163 ms of which 2 ms to minimize.
[2024-05-23 01:45:46] [INFO ] Deduced a trap composed of 70 places in 204 ms of which 3 ms to minimize.
[2024-05-23 01:45:46] [INFO ] Deduced a trap composed of 115 places in 167 ms of which 3 ms to minimize.
[2024-05-23 01:45:46] [INFO ] Deduced a trap composed of 134 places in 208 ms of which 4 ms to minimize.
[2024-05-23 01:45:47] [INFO ] Deduced a trap composed of 59 places in 209 ms of which 3 ms to minimize.
[2024-05-23 01:45:47] [INFO ] Deduced a trap composed of 111 places in 207 ms of which 4 ms to minimize.
[2024-05-23 01:45:47] [INFO ] Deduced a trap composed of 86 places in 212 ms of which 4 ms to minimize.
[2024-05-23 01:45:47] [INFO ] Deduced a trap composed of 115 places in 171 ms of which 3 ms to minimize.
[2024-05-23 01:45:48] [INFO ] Deduced a trap composed of 108 places in 209 ms of which 4 ms to minimize.
[2024-05-23 01:45:48] [INFO ] Deduced a trap composed of 83 places in 211 ms of which 4 ms to minimize.
[2024-05-23 01:45:48] [INFO ] Deduced a trap composed of 145 places in 207 ms of which 3 ms to minimize.
[2024-05-23 01:45:48] [INFO ] Deduced a trap composed of 75 places in 203 ms of which 4 ms to minimize.
[2024-05-23 01:45:49] [INFO ] Deduced a trap composed of 46 places in 217 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 19/84 constraints. Problems are: Problem set: 0 solved, 348 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 226/581 variables, and 84 constraints, problems are : Problem set: 0 solved, 348 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/226 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 68/68 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 68/84 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-23 01:45:52] [INFO ] Deduced a trap composed of 74 places in 121 ms of which 3 ms to minimize.
[2024-05-23 01:45:53] [INFO ] Deduced a trap composed of 105 places in 125 ms of which 3 ms to minimize.
[2024-05-23 01:45:54] [INFO ] Deduced a trap composed of 79 places in 130 ms of which 3 ms to minimize.
[2024-05-23 01:45:54] [INFO ] Deduced a trap composed of 123 places in 126 ms of which 3 ms to minimize.
[2024-05-23 01:45:54] [INFO ] Deduced a trap composed of 154 places in 163 ms of which 3 ms to minimize.
[2024-05-23 01:45:55] [INFO ] Deduced a trap composed of 137 places in 203 ms of which 4 ms to minimize.
[2024-05-23 01:45:55] [INFO ] Deduced a trap composed of 125 places in 166 ms of which 4 ms to minimize.
[2024-05-23 01:45:55] [INFO ] Deduced a trap composed of 84 places in 202 ms of which 4 ms to minimize.
[2024-05-23 01:45:55] [INFO ] Deduced a trap composed of 104 places in 210 ms of which 3 ms to minimize.
[2024-05-23 01:45:55] [INFO ] Deduced a trap composed of 57 places in 200 ms of which 4 ms to minimize.
[2024-05-23 01:45:56] [INFO ] Deduced a trap composed of 55 places in 195 ms of which 3 ms to minimize.
[2024-05-23 01:45:56] [INFO ] Deduced a trap composed of 93 places in 199 ms of which 3 ms to minimize.
[2024-05-23 01:45:56] [INFO ] Deduced a trap composed of 48 places in 196 ms of which 4 ms to minimize.
[2024-05-23 01:45:56] [INFO ] Deduced a trap composed of 59 places in 201 ms of which 3 ms to minimize.
[2024-05-23 01:45:58] [INFO ] Deduced a trap composed of 92 places in 208 ms of which 4 ms to minimize.
[2024-05-23 01:45:58] [INFO ] Deduced a trap composed of 81 places in 199 ms of which 5 ms to minimize.
[2024-05-23 01:45:58] [INFO ] Deduced a trap composed of 153 places in 162 ms of which 3 ms to minimize.
[2024-05-23 01:45:59] [INFO ] Deduced a trap composed of 91 places in 199 ms of which 4 ms to minimize.
[2024-05-23 01:45:59] [INFO ] Deduced a trap composed of 119 places in 164 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 19/103 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-23 01:46:03] [INFO ] Deduced a trap composed of 109 places in 212 ms of which 4 ms to minimize.
[2024-05-23 01:46:03] [INFO ] Deduced a trap composed of 148 places in 215 ms of which 4 ms to minimize.
[2024-05-23 01:46:04] [INFO ] Deduced a trap composed of 122 places in 203 ms of which 4 ms to minimize.
[2024-05-23 01:46:04] [INFO ] Deduced a trap composed of 142 places in 168 ms of which 3 ms to minimize.
[2024-05-23 01:46:04] [INFO ] Deduced a trap composed of 110 places in 199 ms of which 4 ms to minimize.
[2024-05-23 01:46:05] [INFO ] Deduced a trap composed of 154 places in 133 ms of which 2 ms to minimize.
[2024-05-23 01:46:06] [INFO ] Deduced a trap composed of 95 places in 152 ms of which 2 ms to minimize.
[2024-05-23 01:46:06] [INFO ] Deduced a trap composed of 85 places in 162 ms of which 3 ms to minimize.
[2024-05-23 01:46:06] [INFO ] Deduced a trap composed of 100 places in 133 ms of which 3 ms to minimize.
[2024-05-23 01:46:06] [INFO ] Deduced a trap composed of 91 places in 164 ms of which 3 ms to minimize.
[2024-05-23 01:46:07] [INFO ] Deduced a trap composed of 71 places in 165 ms of which 4 ms to minimize.
[2024-05-23 01:46:08] [INFO ] Deduced a trap composed of 89 places in 170 ms of which 3 ms to minimize.
[2024-05-23 01:46:08] [INFO ] Deduced a trap composed of 137 places in 163 ms of which 3 ms to minimize.
[2024-05-23 01:46:08] [INFO ] Deduced a trap composed of 52 places in 204 ms of which 4 ms to minimize.
[2024-05-23 01:46:09] [INFO ] Deduced a trap composed of 64 places in 156 ms of which 4 ms to minimize.
[2024-05-23 01:46:10] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 16/119 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-23 01:46:12] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 2 ms to minimize.
[2024-05-23 01:46:15] [INFO ] Deduced a trap composed of 53 places in 213 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-23 01:46:19] [INFO ] Deduced a trap composed of 106 places in 154 ms of which 4 ms to minimize.
[2024-05-23 01:46:19] [INFO ] Deduced a trap composed of 80 places in 203 ms of which 4 ms to minimize.
[2024-05-23 01:46:19] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 2 ms to minimize.
[2024-05-23 01:46:20] [INFO ] Deduced a trap composed of 92 places in 191 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 226/581 variables, and 125 constraints, problems are : Problem set: 0 solved, 348 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/226 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/348 constraints, Known Traps: 109/109 constraints]
After SMT, in 60197ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 60203ms
Starting structural reductions in LTL mode, iteration 1 : 226/236 places, 355/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61445 ms. Remains : 226/236 places, 355/461 transitions.
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Anderson-PT-07-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 290 ms.
Product exploration explored 100000 steps with 50000 reset in 315 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 p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 21 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-07-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-07-LTLFireability-12 finished in 62279 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 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 461/461 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 236 transition count 413
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 188 transition count 413
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 96 place count 188 transition count 371
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 180 place count 146 transition count 371
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 191 place count 135 transition count 252
Iterating global reduction 2 with 11 rules applied. Total rules applied 202 place count 135 transition count 252
Applied a total of 202 rules in 22 ms. Remains 135 /236 variables (removed 101) and now considering 252/461 (removed 209) transitions.
// Phase 1: matrix 252 rows 135 cols
[2024-05-23 01:46:21] [INFO ] Computed 16 invariants in 3 ms
[2024-05-23 01:46:22] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-23 01:46:22] [INFO ] Invariant cache hit.
[2024-05-23 01:46:22] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-23 01:46:22] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
[2024-05-23 01:46:22] [INFO ] Redundant transitions in 1 ms returned []
Running 245 sub problems to find dead transitions.
[2024-05-23 01:46:22] [INFO ] Invariant cache hit.
[2024-05-23 01:46:22] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:46:24] [INFO ] Deduced a trap composed of 56 places in 112 ms of which 3 ms to minimize.
[2024-05-23 01:46:24] [INFO ] Deduced a trap composed of 57 places in 112 ms of which 3 ms to minimize.
[2024-05-23 01:46:24] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 2 ms to minimize.
[2024-05-23 01:46:25] [INFO ] Deduced a trap composed of 65 places in 132 ms of which 2 ms to minimize.
[2024-05-23 01:46:25] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 2 ms to minimize.
[2024-05-23 01:46:25] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 2 ms to minimize.
[2024-05-23 01:46:25] [INFO ] Deduced a trap composed of 53 places in 132 ms of which 3 ms to minimize.
[2024-05-23 01:46:25] [INFO ] Deduced a trap composed of 42 places in 187 ms of which 3 ms to minimize.
[2024-05-23 01:46:25] [INFO ] Deduced a trap composed of 57 places in 176 ms of which 3 ms to minimize.
[2024-05-23 01:46:26] [INFO ] Deduced a trap composed of 58 places in 132 ms of which 3 ms to minimize.
[2024-05-23 01:46:26] [INFO ] Deduced a trap composed of 62 places in 133 ms of which 2 ms to minimize.
[2024-05-23 01:46:26] [INFO ] Deduced a trap composed of 55 places in 176 ms of which 2 ms to minimize.
[2024-05-23 01:46:26] [INFO ] Deduced a trap composed of 57 places in 102 ms of which 2 ms to minimize.
[2024-05-23 01:46:26] [INFO ] Deduced a trap composed of 60 places in 116 ms of which 2 ms to minimize.
[2024-05-23 01:46:26] [INFO ] Deduced a trap composed of 52 places in 175 ms of which 3 ms to minimize.
[2024-05-23 01:46:27] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 1 ms to minimize.
[2024-05-23 01:46:27] [INFO ] Deduced a trap composed of 52 places in 178 ms of which 3 ms to minimize.
[2024-05-23 01:46:27] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 2 ms to minimize.
[2024-05-23 01:46:27] [INFO ] Deduced a trap composed of 61 places in 112 ms of which 2 ms to minimize.
[2024-05-23 01:46:27] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:46:28] [INFO ] Deduced a trap composed of 49 places in 110 ms of which 2 ms to minimize.
[2024-05-23 01:46:28] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 2 ms to minimize.
[2024-05-23 01:46:28] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 1 ms to minimize.
[2024-05-23 01:46:28] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 2 ms to minimize.
[2024-05-23 01:46:29] [INFO ] Deduced a trap composed of 45 places in 132 ms of which 3 ms to minimize.
[2024-05-23 01:46:29] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 2 ms to minimize.
[2024-05-23 01:46:29] [INFO ] Deduced a trap composed of 51 places in 140 ms of which 3 ms to minimize.
[2024-05-23 01:46:29] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 2 ms to minimize.
[2024-05-23 01:46:29] [INFO ] Deduced a trap composed of 60 places in 128 ms of which 2 ms to minimize.
[2024-05-23 01:46:29] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 2 ms to minimize.
[2024-05-23 01:46:29] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 3 ms to minimize.
[2024-05-23 01:46:29] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 2 ms to minimize.
[2024-05-23 01:46:30] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 1 ms to minimize.
[2024-05-23 01:46:30] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 2 ms to minimize.
[2024-05-23 01:46:30] [INFO ] Deduced a trap composed of 63 places in 116 ms of which 2 ms to minimize.
[2024-05-23 01:46:30] [INFO ] Deduced a trap composed of 56 places in 108 ms of which 2 ms to minimize.
[2024-05-23 01:46:30] [INFO ] Deduced a trap composed of 61 places in 133 ms of which 2 ms to minimize.
[2024-05-23 01:46:30] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 2 ms to minimize.
[2024-05-23 01:46:31] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 2 ms to minimize.
[2024-05-23 01:46:31] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:46:33] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
[2024-05-23 01:46:33] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 1 ms to minimize.
[2024-05-23 01:46:33] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:46:35] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 2 ms to minimize.
[2024-05-23 01:46:35] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 1 ms to minimize.
[2024-05-23 01:46:35] [INFO ] Deduced a trap composed of 52 places in 113 ms of which 3 ms to minimize.
[2024-05-23 01:46:35] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 2 ms to minimize.
[2024-05-23 01:46:35] [INFO ] Deduced a trap composed of 50 places in 132 ms of which 2 ms to minimize.
[2024-05-23 01:46:36] [INFO ] Deduced a trap composed of 54 places in 132 ms of which 3 ms to minimize.
[2024-05-23 01:46:36] [INFO ] Deduced a trap composed of 53 places in 94 ms of which 2 ms to minimize.
[2024-05-23 01:46:36] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 2 ms to minimize.
[2024-05-23 01:46:36] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 1 ms to minimize.
[2024-05-23 01:46:36] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 2 ms to minimize.
[2024-05-23 01:46:36] [INFO ] Deduced a trap composed of 46 places in 110 ms of which 2 ms to minimize.
[2024-05-23 01:46:36] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 2 ms to minimize.
[2024-05-23 01:46:36] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 2 ms to minimize.
[2024-05-23 01:46:37] [INFO ] Deduced a trap composed of 48 places in 108 ms of which 2 ms to minimize.
[2024-05-23 01:46:37] [INFO ] Deduced a trap composed of 53 places in 101 ms of which 2 ms to minimize.
[2024-05-23 01:46:37] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 2 ms to minimize.
[2024-05-23 01:46:37] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 1 ms to minimize.
[2024-05-23 01:46:37] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
[2024-05-23 01:46:38] [INFO ] Deduced a trap composed of 48 places in 86 ms of which 2 ms to minimize.
[2024-05-23 01:46:38] [INFO ] Deduced a trap composed of 46 places in 132 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:46:39] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 2 ms to minimize.
[2024-05-23 01:46:39] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 2 ms to minimize.
[2024-05-23 01:46:39] [INFO ] Deduced a trap composed of 51 places in 101 ms of which 2 ms to minimize.
[2024-05-23 01:46:39] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 2 ms to minimize.
[2024-05-23 01:46:40] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 2 ms to minimize.
[2024-05-23 01:46:40] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 2 ms to minimize.
[2024-05-23 01:46:40] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 1 ms to minimize.
[2024-05-23 01:46:40] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 2 ms to minimize.
[2024-05-23 01:46:40] [INFO ] Deduced a trap composed of 58 places in 134 ms of which 2 ms to minimize.
[2024-05-23 01:46:40] [INFO ] Deduced a trap composed of 43 places in 112 ms of which 3 ms to minimize.
[2024-05-23 01:46:41] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 11/90 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:46:44] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:46:46] [INFO ] Deduced a trap composed of 50 places in 115 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 10 (OVERLAPS) 252/387 variables, 135/227 constraints. Problems are: Problem set: 0 solved, 245 unsolved
SMT process timed out in 30138ms, After SMT, problems are : Problem set: 0 solved, 245 unsolved
Search for dead transitions found 0 dead transitions in 30142ms
Starting structural reductions in SI_LTL mode, iteration 1 : 135/236 places, 252/461 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30815 ms. Remains : 135/236 places, 252/461 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-07-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 220 ms.
Product exploration explored 100000 steps with 0 reset in 268 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
BEST_FIRST walk for 24854 steps (4 resets) in 65 ms. (376 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 252/252 transitions.
Applied a total of 0 rules in 5 ms. Remains 135 /135 variables (removed 0) and now considering 252/252 (removed 0) transitions.
[2024-05-23 01:46:53] [INFO ] Invariant cache hit.
[2024-05-23 01:46:53] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-23 01:46:53] [INFO ] Invariant cache hit.
[2024-05-23 01:46:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-23 01:46:54] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
[2024-05-23 01:46:54] [INFO ] Redundant transitions in 1 ms returned []
Running 245 sub problems to find dead transitions.
[2024-05-23 01:46:54] [INFO ] Invariant cache hit.
[2024-05-23 01:46:54] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:46:56] [INFO ] Deduced a trap composed of 56 places in 118 ms of which 2 ms to minimize.
[2024-05-23 01:46:56] [INFO ] Deduced a trap composed of 57 places in 132 ms of which 2 ms to minimize.
[2024-05-23 01:46:56] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 3 ms to minimize.
[2024-05-23 01:46:56] [INFO ] Deduced a trap composed of 65 places in 113 ms of which 2 ms to minimize.
[2024-05-23 01:46:57] [INFO ] Deduced a trap composed of 64 places in 132 ms of which 3 ms to minimize.
[2024-05-23 01:46:57] [INFO ] Deduced a trap composed of 35 places in 133 ms of which 2 ms to minimize.
[2024-05-23 01:46:57] [INFO ] Deduced a trap composed of 53 places in 129 ms of which 3 ms to minimize.
[2024-05-23 01:46:57] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 2 ms to minimize.
[2024-05-23 01:46:57] [INFO ] Deduced a trap composed of 57 places in 131 ms of which 2 ms to minimize.
[2024-05-23 01:46:57] [INFO ] Deduced a trap composed of 58 places in 131 ms of which 2 ms to minimize.
[2024-05-23 01:46:57] [INFO ] Deduced a trap composed of 62 places in 130 ms of which 2 ms to minimize.
[2024-05-23 01:46:58] [INFO ] Deduced a trap composed of 55 places in 131 ms of which 3 ms to minimize.
[2024-05-23 01:46:58] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 3 ms to minimize.
[2024-05-23 01:46:58] [INFO ] Deduced a trap composed of 60 places in 134 ms of which 2 ms to minimize.
[2024-05-23 01:46:58] [INFO ] Deduced a trap composed of 52 places in 135 ms of which 3 ms to minimize.
[2024-05-23 01:46:58] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 2 ms to minimize.
[2024-05-23 01:46:58] [INFO ] Deduced a trap composed of 52 places in 109 ms of which 2 ms to minimize.
[2024-05-23 01:46:58] [INFO ] Deduced a trap composed of 58 places in 135 ms of which 2 ms to minimize.
[2024-05-23 01:46:59] [INFO ] Deduced a trap composed of 61 places in 113 ms of which 2 ms to minimize.
[2024-05-23 01:46:59] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:46:59] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 2 ms to minimize.
[2024-05-23 01:47:00] [INFO ] Deduced a trap composed of 68 places in 111 ms of which 3 ms to minimize.
[2024-05-23 01:47:00] [INFO ] Deduced a trap composed of 36 places in 137 ms of which 3 ms to minimize.
[2024-05-23 01:47:00] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 2 ms to minimize.
[2024-05-23 01:47:00] [INFO ] Deduced a trap composed of 45 places in 166 ms of which 2 ms to minimize.
[2024-05-23 01:47:00] [INFO ] Deduced a trap composed of 56 places in 131 ms of which 3 ms to minimize.
[2024-05-23 01:47:00] [INFO ] Deduced a trap composed of 51 places in 130 ms of which 2 ms to minimize.
[2024-05-23 01:47:00] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 1 ms to minimize.
[2024-05-23 01:47:01] [INFO ] Deduced a trap composed of 60 places in 131 ms of which 2 ms to minimize.
[2024-05-23 01:47:01] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 2 ms to minimize.
[2024-05-23 01:47:01] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 2 ms to minimize.
[2024-05-23 01:47:01] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 2 ms to minimize.
[2024-05-23 01:47:01] [INFO ] Deduced a trap composed of 57 places in 92 ms of which 2 ms to minimize.
[2024-05-23 01:47:01] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 2 ms to minimize.
[2024-05-23 01:47:01] [INFO ] Deduced a trap composed of 63 places in 110 ms of which 3 ms to minimize.
[2024-05-23 01:47:01] [INFO ] Deduced a trap composed of 56 places in 132 ms of which 2 ms to minimize.
[2024-05-23 01:47:02] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 3 ms to minimize.
[2024-05-23 01:47:02] [INFO ] Deduced a trap composed of 50 places in 110 ms of which 3 ms to minimize.
[2024-05-23 01:47:02] [INFO ] Deduced a trap composed of 51 places in 132 ms of which 2 ms to minimize.
[2024-05-23 01:47:02] [INFO ] Deduced a trap composed of 60 places in 133 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:47:04] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 3 ms to minimize.
[2024-05-23 01:47:05] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 2 ms to minimize.
[2024-05-23 01:47:05] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:47:06] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 2 ms to minimize.
[2024-05-23 01:47:06] [INFO ] Deduced a trap composed of 46 places in 132 ms of which 2 ms to minimize.
[2024-05-23 01:47:07] [INFO ] Deduced a trap composed of 52 places in 119 ms of which 2 ms to minimize.
[2024-05-23 01:47:07] [INFO ] Deduced a trap composed of 51 places in 136 ms of which 2 ms to minimize.
[2024-05-23 01:47:07] [INFO ] Deduced a trap composed of 50 places in 145 ms of which 2 ms to minimize.
[2024-05-23 01:47:07] [INFO ] Deduced a trap composed of 54 places in 181 ms of which 3 ms to minimize.
[2024-05-23 01:47:07] [INFO ] Deduced a trap composed of 53 places in 139 ms of which 2 ms to minimize.
[2024-05-23 01:47:07] [INFO ] Deduced a trap composed of 44 places in 143 ms of which 3 ms to minimize.
[2024-05-23 01:47:08] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 2 ms to minimize.
[2024-05-23 01:47:08] [INFO ] Deduced a trap composed of 63 places in 141 ms of which 3 ms to minimize.
[2024-05-23 01:47:08] [INFO ] Deduced a trap composed of 46 places in 139 ms of which 3 ms to minimize.
[2024-05-23 01:47:08] [INFO ] Deduced a trap composed of 48 places in 179 ms of which 3 ms to minimize.
[2024-05-23 01:47:08] [INFO ] Deduced a trap composed of 46 places in 186 ms of which 2 ms to minimize.
[2024-05-23 01:47:09] [INFO ] Deduced a trap composed of 48 places in 184 ms of which 2 ms to minimize.
[2024-05-23 01:47:09] [INFO ] Deduced a trap composed of 53 places in 138 ms of which 3 ms to minimize.
[2024-05-23 01:47:09] [INFO ] Deduced a trap composed of 49 places in 180 ms of which 3 ms to minimize.
[2024-05-23 01:47:09] [INFO ] Deduced a trap composed of 47 places in 166 ms of which 3 ms to minimize.
[2024-05-23 01:47:09] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 2 ms to minimize.
[2024-05-23 01:47:10] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 2 ms to minimize.
[2024-05-23 01:47:10] [INFO ] Deduced a trap composed of 46 places in 117 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:47:11] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 2 ms to minimize.
[2024-05-23 01:47:11] [INFO ] Deduced a trap composed of 37 places in 175 ms of which 2 ms to minimize.
[2024-05-23 01:47:12] [INFO ] Deduced a trap composed of 51 places in 174 ms of which 2 ms to minimize.
[2024-05-23 01:47:12] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 1 ms to minimize.
[2024-05-23 01:47:12] [INFO ] Deduced a trap composed of 41 places in 167 ms of which 3 ms to minimize.
[2024-05-23 01:47:12] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 3 ms to minimize.
[2024-05-23 01:47:12] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 3 ms to minimize.
[2024-05-23 01:47:12] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 2 ms to minimize.
[2024-05-23 01:47:12] [INFO ] Deduced a trap composed of 58 places in 159 ms of which 2 ms to minimize.
[2024-05-23 01:47:13] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 3 ms to minimize.
[2024-05-23 01:47:13] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 11/90 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:47:16] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:47:18] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 245 unsolved
SMT process timed out in 30130ms, After SMT, problems are : Problem set: 0 solved, 245 unsolved
Search for dead transitions found 0 dead transitions in 30135ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30682 ms. Remains : 135/135 places, 252/252 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
BEST_FIRST walk for 30782 steps (6 resets) in 48 ms. (628 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 130 ms.
Product exploration explored 100000 steps with 0 reset in 162 ms.
Built C files in :
/tmp/ltsmin5186723755205194075
[2024-05-23 01:47:25] [INFO ] Computing symmetric may disable matrix : 252 transitions.
[2024-05-23 01:47:25] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:47:25] [INFO ] Computing symmetric may enable matrix : 252 transitions.
[2024-05-23 01:47:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:47:25] [INFO ] Computing Do-Not-Accords matrix : 252 transitions.
[2024-05-23 01:47:25] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:47:25] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5186723755205194075
Running compilation step : cd /tmp/ltsmin5186723755205194075;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1246 ms.
Running link step : cd /tmp/ltsmin5186723755205194075;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin5186723755205194075;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2329872845283347524.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 252/252 transitions.
Applied a total of 0 rules in 6 ms. Remains 135 /135 variables (removed 0) and now considering 252/252 (removed 0) transitions.
[2024-05-23 01:47:40] [INFO ] Invariant cache hit.
[2024-05-23 01:47:40] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-23 01:47:40] [INFO ] Invariant cache hit.
[2024-05-23 01:47:40] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-23 01:47:40] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
[2024-05-23 01:47:40] [INFO ] Redundant transitions in 0 ms returned []
Running 245 sub problems to find dead transitions.
[2024-05-23 01:47:40] [INFO ] Invariant cache hit.
[2024-05-23 01:47:40] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:47:42] [INFO ] Deduced a trap composed of 56 places in 120 ms of which 2 ms to minimize.
[2024-05-23 01:47:43] [INFO ] Deduced a trap composed of 57 places in 133 ms of which 3 ms to minimize.
[2024-05-23 01:47:43] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 3 ms to minimize.
[2024-05-23 01:47:43] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 2 ms to minimize.
[2024-05-23 01:47:43] [INFO ] Deduced a trap composed of 64 places in 104 ms of which 2 ms to minimize.
[2024-05-23 01:47:43] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 2 ms to minimize.
[2024-05-23 01:47:43] [INFO ] Deduced a trap composed of 53 places in 117 ms of which 2 ms to minimize.
[2024-05-23 01:47:43] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 2 ms to minimize.
[2024-05-23 01:47:44] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 2 ms to minimize.
[2024-05-23 01:47:44] [INFO ] Deduced a trap composed of 58 places in 111 ms of which 2 ms to minimize.
[2024-05-23 01:47:44] [INFO ] Deduced a trap composed of 62 places in 121 ms of which 2 ms to minimize.
[2024-05-23 01:47:44] [INFO ] Deduced a trap composed of 55 places in 111 ms of which 2 ms to minimize.
[2024-05-23 01:47:44] [INFO ] Deduced a trap composed of 57 places in 110 ms of which 2 ms to minimize.
[2024-05-23 01:47:44] [INFO ] Deduced a trap composed of 60 places in 108 ms of which 2 ms to minimize.
[2024-05-23 01:47:44] [INFO ] Deduced a trap composed of 52 places in 95 ms of which 2 ms to minimize.
[2024-05-23 01:47:45] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 2 ms to minimize.
[2024-05-23 01:47:45] [INFO ] Deduced a trap composed of 52 places in 109 ms of which 2 ms to minimize.
[2024-05-23 01:47:45] [INFO ] Deduced a trap composed of 58 places in 166 ms of which 2 ms to minimize.
[2024-05-23 01:47:45] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 2 ms to minimize.
[2024-05-23 01:47:45] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:47:46] [INFO ] Deduced a trap composed of 49 places in 110 ms of which 1 ms to minimize.
[2024-05-23 01:47:46] [INFO ] Deduced a trap composed of 68 places in 114 ms of which 1 ms to minimize.
[2024-05-23 01:47:46] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 2 ms to minimize.
[2024-05-23 01:47:46] [INFO ] Deduced a trap composed of 51 places in 104 ms of which 2 ms to minimize.
[2024-05-23 01:47:47] [INFO ] Deduced a trap composed of 45 places in 92 ms of which 2 ms to minimize.
[2024-05-23 01:47:47] [INFO ] Deduced a trap composed of 56 places in 168 ms of which 3 ms to minimize.
[2024-05-23 01:47:47] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 2 ms to minimize.
[2024-05-23 01:47:47] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 2 ms to minimize.
[2024-05-23 01:47:47] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 1 ms to minimize.
[2024-05-23 01:47:47] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 2 ms to minimize.
[2024-05-23 01:47:47] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 2 ms to minimize.
[2024-05-23 01:47:47] [INFO ] Deduced a trap composed of 54 places in 164 ms of which 2 ms to minimize.
[2024-05-23 01:47:48] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 2 ms to minimize.
[2024-05-23 01:47:48] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 2 ms to minimize.
[2024-05-23 01:47:48] [INFO ] Deduced a trap composed of 63 places in 165 ms of which 2 ms to minimize.
[2024-05-23 01:47:48] [INFO ] Deduced a trap composed of 56 places in 166 ms of which 10 ms to minimize.
[2024-05-23 01:47:48] [INFO ] Deduced a trap composed of 61 places in 129 ms of which 3 ms to minimize.
[2024-05-23 01:47:49] [INFO ] Deduced a trap composed of 50 places in 174 ms of which 2 ms to minimize.
[2024-05-23 01:47:49] [INFO ] Deduced a trap composed of 51 places in 106 ms of which 1 ms to minimize.
[2024-05-23 01:47:49] [INFO ] Deduced a trap composed of 60 places in 105 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:47:51] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 2 ms to minimize.
[2024-05-23 01:47:52] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 2 ms to minimize.
[2024-05-23 01:47:52] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:47:53] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 3 ms to minimize.
[2024-05-23 01:47:53] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 1 ms to minimize.
[2024-05-23 01:47:54] [INFO ] Deduced a trap composed of 52 places in 110 ms of which 2 ms to minimize.
[2024-05-23 01:47:54] [INFO ] Deduced a trap composed of 51 places in 131 ms of which 3 ms to minimize.
[2024-05-23 01:47:54] [INFO ] Deduced a trap composed of 50 places in 174 ms of which 2 ms to minimize.
[2024-05-23 01:47:54] [INFO ] Deduced a trap composed of 54 places in 110 ms of which 2 ms to minimize.
[2024-05-23 01:47:54] [INFO ] Deduced a trap composed of 53 places in 161 ms of which 2 ms to minimize.
[2024-05-23 01:47:54] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 3 ms to minimize.
[2024-05-23 01:47:55] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 2 ms to minimize.
[2024-05-23 01:47:55] [INFO ] Deduced a trap composed of 63 places in 91 ms of which 2 ms to minimize.
[2024-05-23 01:47:55] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 2 ms to minimize.
[2024-05-23 01:47:55] [INFO ] Deduced a trap composed of 48 places in 132 ms of which 2 ms to minimize.
[2024-05-23 01:47:55] [INFO ] Deduced a trap composed of 46 places in 131 ms of which 3 ms to minimize.
[2024-05-23 01:47:55] [INFO ] Deduced a trap composed of 48 places in 136 ms of which 2 ms to minimize.
[2024-05-23 01:47:55] [INFO ] Deduced a trap composed of 53 places in 113 ms of which 2 ms to minimize.
[2024-05-23 01:47:56] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 2 ms to minimize.
[2024-05-23 01:47:56] [INFO ] Deduced a trap composed of 47 places in 144 ms of which 3 ms to minimize.
[2024-05-23 01:47:56] [INFO ] Deduced a trap composed of 39 places in 164 ms of which 3 ms to minimize.
[2024-05-23 01:47:56] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 1 ms to minimize.
[2024-05-23 01:47:56] [INFO ] Deduced a trap composed of 46 places in 115 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:47:57] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 2 ms to minimize.
[2024-05-23 01:47:57] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 2 ms to minimize.
[2024-05-23 01:47:58] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 2 ms to minimize.
[2024-05-23 01:47:58] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 3 ms to minimize.
[2024-05-23 01:47:58] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 3 ms to minimize.
[2024-05-23 01:47:58] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 3 ms to minimize.
[2024-05-23 01:47:58] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 2 ms to minimize.
[2024-05-23 01:47:58] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 1 ms to minimize.
[2024-05-23 01:47:59] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 2 ms to minimize.
[2024-05-23 01:47:59] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 2 ms to minimize.
[2024-05-23 01:47:59] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 11/90 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:48:02] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 01:48:04] [INFO ] Deduced a trap composed of 50 places in 101 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 10 (OVERLAPS) 252/387 variables, 135/227 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 42/269 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 387/387 variables, and 269 constraints, problems are : Problem set: 0 solved, 245 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 245 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 76/92 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/387 variables, and 92 constraints, problems are : Problem set: 0 solved, 245 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/245 constraints, Known Traps: 76/76 constraints]
After SMT, in 60149ms problems are : Problem set: 0 solved, 245 unsolved
Search for dead transitions found 0 dead transitions in 60152ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60745 ms. Remains : 135/135 places, 252/252 transitions.
Built C files in :
/tmp/ltsmin1156748435342087611
[2024-05-23 01:48:41] [INFO ] Computing symmetric may disable matrix : 252 transitions.
[2024-05-23 01:48:41] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:48:41] [INFO ] Computing symmetric may enable matrix : 252 transitions.
[2024-05-23 01:48:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:48:41] [INFO ] Computing Do-Not-Accords matrix : 252 transitions.
[2024-05-23 01:48:41] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:48:41] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1156748435342087611
Running compilation step : cd /tmp/ltsmin1156748435342087611;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1132 ms.
Running link step : cd /tmp/ltsmin1156748435342087611;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1156748435342087611;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10074996825505763727.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 01:48:56] [INFO ] Flatten gal took : 17 ms
[2024-05-23 01:48:56] [INFO ] Flatten gal took : 16 ms
[2024-05-23 01:48:56] [INFO ] Time to serialize gal into /tmp/LTL12720544905237203803.gal : 11 ms
[2024-05-23 01:48:56] [INFO ] Time to serialize properties into /tmp/LTL1211691672087829875.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12720544905237203803.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14767147284849676862.hoa' '-atoms' '/tmp/LTL1211691672087829875.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL1211691672087829875.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14767147284849676862.hoa
Detected timeout of ITS tools.
[2024-05-23 01:49:11] [INFO ] Flatten gal took : 26 ms
[2024-05-23 01:49:11] [INFO ] Flatten gal took : 24 ms
[2024-05-23 01:49:11] [INFO ] Time to serialize gal into /tmp/LTL8410929191289121381.gal : 4 ms
[2024-05-23 01:49:11] [INFO ] Time to serialize properties into /tmp/LTL3697981771101017372.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8410929191289121381.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3697981771101017372.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((next_11==0)||(ncs_1_1==0))"))))
Formula 0 simplified : FG!"((next_11==0)||(ncs_1_1==0))"
Detected timeout of ITS tools.
[2024-05-23 01:49:26] [INFO ] Flatten gal took : 20 ms
[2024-05-23 01:49:26] [INFO ] Applying decomposition
[2024-05-23 01:49:26] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7091995103637152033.txt' '-o' '/tmp/graph7091995103637152033.bin' '-w' '/tmp/graph7091995103637152033.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7091995103637152033.bin' '-l' '-1' '-v' '-w' '/tmp/graph7091995103637152033.weights' '-q' '0' '-e' '0.001'
[2024-05-23 01:49:26] [INFO ] Decomposing Gal with order
[2024-05-23 01:49:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 01:49:26] [INFO ] Removed a total of 417 redundant transitions.
[2024-05-23 01:49:26] [INFO ] Flatten gal took : 50 ms
[2024-05-23 01:49:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 22 ms.
[2024-05-23 01:49:26] [INFO ] Time to serialize gal into /tmp/LTL13686564385917183205.gal : 7 ms
[2024-05-23 01:49:26] [INFO ] Time to serialize properties into /tmp/LTL4023673164476763895.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13686564385917183205.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4023673164476763895.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i4.u8.next_11==0)||(i9.u11.ncs_1_1==0))"))))
Formula 0 simplified : FG!"((i4.u8.next_11==0)||(i9.u11.ncs_1_1==0))"
Reverse transition relation is NOT exact ! Due to transitions t369_t418, t372_t421, t373_t422, t376_t425, t377_t426, t378_t427, t379_t428, t380_t429, t381_...717
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1181 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,11.838,208944,1,0,305995,5137,2830,658740,320,68195,1151887
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Anderson-PT-07-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Anderson-PT-07-LTLFireability-13 finished in 197888 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(G(p1))&&p0))))'
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 461/461 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 226 transition count 355
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 226 transition count 355
Applied a total of 20 rules in 7 ms. Remains 226 /236 variables (removed 10) and now considering 355/461 (removed 106) transitions.
// Phase 1: matrix 355 rows 226 cols
[2024-05-23 01:49:39] [INFO ] Computed 16 invariants in 4 ms
[2024-05-23 01:49:40] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-05-23 01:49:40] [INFO ] Invariant cache hit.
[2024-05-23 01:49:40] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-23 01:49:41] [INFO ] Implicit Places using invariants and state equation in 1192 ms returned []
Implicit Place search using SMT with State Equation took 1538 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-05-23 01:49:41] [INFO ] Invariant cache hit.
[2024-05-23 01:49:41] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-23 01:49:45] [INFO ] Deduced a trap composed of 67 places in 214 ms of which 3 ms to minimize.
[2024-05-23 01:49:45] [INFO ] Deduced a trap composed of 118 places in 123 ms of which 3 ms to minimize.
[2024-05-23 01:49:46] [INFO ] Deduced a trap composed of 134 places in 243 ms of which 4 ms to minimize.
[2024-05-23 01:49:46] [INFO ] Deduced a trap composed of 90 places in 139 ms of which 2 ms to minimize.
[2024-05-23 01:49:46] [INFO ] Deduced a trap composed of 103 places in 139 ms of which 3 ms to minimize.
[2024-05-23 01:49:46] [INFO ] Deduced a trap composed of 84 places in 144 ms of which 3 ms to minimize.
[2024-05-23 01:49:47] [INFO ] Deduced a trap composed of 74 places in 135 ms of which 2 ms to minimize.
[2024-05-23 01:49:48] [INFO ] Deduced a trap composed of 90 places in 146 ms of which 2 ms to minimize.
[2024-05-23 01:49:48] [INFO ] Deduced a trap composed of 95 places in 202 ms of which 4 ms to minimize.
[2024-05-23 01:49:48] [INFO ] Deduced a trap composed of 57 places in 212 ms of which 4 ms to minimize.
[2024-05-23 01:49:48] [INFO ] Deduced a trap composed of 97 places in 213 ms of which 4 ms to minimize.
[2024-05-23 01:49:48] [INFO ] Deduced a trap composed of 57 places in 142 ms of which 3 ms to minimize.
[2024-05-23 01:49:48] [INFO ] Deduced a trap composed of 58 places in 138 ms of which 3 ms to minimize.
[2024-05-23 01:49:49] [INFO ] Deduced a trap composed of 74 places in 138 ms of which 3 ms to minimize.
[2024-05-23 01:49:49] [INFO ] Deduced a trap composed of 142 places in 141 ms of which 3 ms to minimize.
[2024-05-23 01:49:49] [INFO ] Deduced a trap composed of 94 places in 164 ms of which 2 ms to minimize.
[2024-05-23 01:49:49] [INFO ] Deduced a trap composed of 59 places in 167 ms of which 3 ms to minimize.
[2024-05-23 01:49:50] [INFO ] Deduced a trap composed of 93 places in 182 ms of which 3 ms to minimize.
[2024-05-23 01:49:50] [INFO ] Deduced a trap composed of 102 places in 172 ms of which 2 ms to minimize.
[2024-05-23 01:49:50] [INFO ] Deduced a trap composed of 49 places in 144 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-23 01:49:51] [INFO ] Deduced a trap composed of 105 places in 243 ms of which 4 ms to minimize.
[2024-05-23 01:49:51] [INFO ] Deduced a trap composed of 119 places in 224 ms of which 3 ms to minimize.
[2024-05-23 01:49:52] [INFO ] Deduced a trap composed of 110 places in 246 ms of which 4 ms to minimize.
[2024-05-23 01:49:52] [INFO ] Deduced a trap composed of 102 places in 182 ms of which 2 ms to minimize.
[2024-05-23 01:49:52] [INFO ] Deduced a trap composed of 81 places in 185 ms of which 3 ms to minimize.
[2024-05-23 01:49:52] [INFO ] Deduced a trap composed of 124 places in 178 ms of which 2 ms to minimize.
[2024-05-23 01:49:52] [INFO ] Deduced a trap composed of 78 places in 159 ms of which 3 ms to minimize.
[2024-05-23 01:49:53] [INFO ] Deduced a trap composed of 84 places in 240 ms of which 4 ms to minimize.
[2024-05-23 01:49:53] [INFO ] Deduced a trap composed of 137 places in 241 ms of which 4 ms to minimize.
[2024-05-23 01:49:54] [INFO ] Deduced a trap composed of 86 places in 186 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-23 01:50:00] [INFO ] Deduced a trap composed of 100 places in 216 ms of which 4 ms to minimize.
[2024-05-23 01:50:00] [INFO ] Deduced a trap composed of 92 places in 232 ms of which 4 ms to minimize.
[2024-05-23 01:50:01] [INFO ] Deduced a trap composed of 86 places in 248 ms of which 4 ms to minimize.
[2024-05-23 01:50:01] [INFO ] Deduced a trap composed of 82 places in 248 ms of which 4 ms to minimize.
[2024-05-23 01:50:01] [INFO ] Deduced a trap composed of 106 places in 245 ms of which 4 ms to minimize.
[2024-05-23 01:50:01] [INFO ] Deduced a trap composed of 97 places in 260 ms of which 4 ms to minimize.
[2024-05-23 01:50:02] [INFO ] Deduced a trap composed of 120 places in 170 ms of which 4 ms to minimize.
[2024-05-23 01:50:02] [INFO ] Deduced a trap composed of 119 places in 214 ms of which 4 ms to minimize.
[2024-05-23 01:50:02] [INFO ] Deduced a trap composed of 94 places in 205 ms of which 4 ms to minimize.
[2024-05-23 01:50:02] [INFO ] Deduced a trap composed of 108 places in 138 ms of which 2 ms to minimize.
[2024-05-23 01:50:03] [INFO ] Deduced a trap composed of 139 places in 213 ms of which 4 ms to minimize.
[2024-05-23 01:50:03] [INFO ] Deduced a trap composed of 114 places in 172 ms of which 4 ms to minimize.
[2024-05-23 01:50:03] [INFO ] Deduced a trap composed of 89 places in 236 ms of which 4 ms to minimize.
[2024-05-23 01:50:03] [INFO ] Deduced a trap composed of 106 places in 169 ms of which 2 ms to minimize.
[2024-05-23 01:50:04] [INFO ] Deduced a trap composed of 126 places in 174 ms of which 2 ms to minimize.
[2024-05-23 01:50:04] [INFO ] Deduced a trap composed of 61 places in 202 ms of which 2 ms to minimize.
[2024-05-23 01:50:04] [INFO ] Deduced a trap composed of 135 places in 215 ms of which 4 ms to minimize.
[2024-05-23 01:50:04] [INFO ] Deduced a trap composed of 100 places in 211 ms of which 4 ms to minimize.
[2024-05-23 01:50:04] [INFO ] Deduced a trap composed of 98 places in 222 ms of which 4 ms to minimize.
[2024-05-23 01:50:05] [INFO ] Deduced a trap composed of 95 places in 209 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-23 01:50:06] [INFO ] Deduced a trap composed of 123 places in 218 ms of which 4 ms to minimize.
[2024-05-23 01:50:06] [INFO ] Deduced a trap composed of 86 places in 165 ms of which 3 ms to minimize.
[2024-05-23 01:50:07] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 3 ms to minimize.
[2024-05-23 01:50:07] [INFO ] Deduced a trap composed of 149 places in 219 ms of which 4 ms to minimize.
[2024-05-23 01:50:07] [INFO ] Deduced a trap composed of 107 places in 216 ms of which 4 ms to minimize.
[2024-05-23 01:50:08] [INFO ] Deduced a trap composed of 142 places in 211 ms of which 4 ms to minimize.
[2024-05-23 01:50:08] [INFO ] Deduced a trap composed of 127 places in 155 ms of which 3 ms to minimize.
[2024-05-23 01:50:08] [INFO ] Deduced a trap composed of 94 places in 234 ms of which 4 ms to minimize.
[2024-05-23 01:50:08] [INFO ] Deduced a trap composed of 123 places in 224 ms of which 4 ms to minimize.
[2024-05-23 01:50:09] [INFO ] Deduced a trap composed of 79 places in 212 ms of which 4 ms to minimize.
[2024-05-23 01:50:09] [INFO ] Deduced a trap composed of 78 places in 184 ms of which 3 ms to minimize.
[2024-05-23 01:50:09] [INFO ] Deduced a trap composed of 72 places in 223 ms of which 4 ms to minimize.
[2024-05-23 01:50:09] [INFO ] Deduced a trap composed of 76 places in 167 ms of which 4 ms to minimize.
[2024-05-23 01:50:10] [INFO ] Deduced a trap composed of 72 places in 215 ms of which 3 ms to minimize.
[2024-05-23 01:50:10] [INFO ] Deduced a trap composed of 91 places in 237 ms of which 4 ms to minimize.
[2024-05-23 01:50:11] [INFO ] Deduced a trap composed of 142 places in 237 ms of which 4 ms to minimize.
[2024-05-23 01:50:11] [INFO ] Deduced a trap composed of 129 places in 214 ms of which 4 ms to minimize.
[2024-05-23 01:50:11] [INFO ] Deduced a trap composed of 122 places in 170 ms of which 3 ms to minimize.
SMT process timed out in 30213ms, After SMT, problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 30220ms
Starting structural reductions in LTL mode, iteration 1 : 226/236 places, 355/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31767 ms. Remains : 226/236 places, 355/461 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Anderson-PT-07-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-07-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-07-LTLFireability-14 finished in 31968 ms.
All properties solved by simple procedures.
Total runtime 966235 ms.
BK_STOP 1716429011732
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="Anderson-PT-07"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Anderson-PT-07, 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 r004-smll-171620118300340"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-07.tgz
mv Anderson-PT-07 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 ;