About the Execution of ITS-Tools for Anderson-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10743.604 | 3600000.00 | 11345612.00 | 3469.50 | FFFTTFFF?FFFFFFF | 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-171620118400364.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-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-smll-171620118400364
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 16K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 15:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 12 15:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 15:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 12 15:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:23 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 1.3M 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-10-LTLFireability-00
FORMULA_NAME Anderson-PT-10-LTLFireability-01
FORMULA_NAME Anderson-PT-10-LTLFireability-02
FORMULA_NAME Anderson-PT-10-LTLFireability-03
FORMULA_NAME Anderson-PT-10-LTLFireability-04
FORMULA_NAME Anderson-PT-10-LTLFireability-05
FORMULA_NAME Anderson-PT-10-LTLFireability-06
FORMULA_NAME Anderson-PT-10-LTLFireability-07
FORMULA_NAME Anderson-PT-10-LTLFireability-08
FORMULA_NAME Anderson-PT-10-LTLFireability-09
FORMULA_NAME Anderson-PT-10-LTLFireability-10
FORMULA_NAME Anderson-PT-10-LTLFireability-11
FORMULA_NAME Anderson-PT-10-LTLFireability-12
FORMULA_NAME Anderson-PT-10-LTLFireability-13
FORMULA_NAME Anderson-PT-10-LTLFireability-14
FORMULA_NAME Anderson-PT-10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716447923382
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-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-23 07:05:25] [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 07:05:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 07:05:26] [INFO ] Load time of PNML (sax parser for PT used): 602 ms
[2024-05-23 07:05:26] [INFO ] Transformed 621 places.
[2024-05-23 07:05:26] [INFO ] Transformed 2480 transitions.
[2024-05-23 07:05:26] [INFO ] Found NUPN structural information;
[2024-05-23 07:05:26] [INFO ] Parsed PT model containing 621 places and 2480 transitions and 9560 arcs in 884 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Anderson-PT-10-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 2480/2480 transitions.
Discarding 154 places :
Symmetric choice reduction at 0 with 154 rule applications. Total rules 154 place count 467 transition count 1120
Iterating global reduction 0 with 154 rules applied. Total rules applied 308 place count 467 transition count 1120
Applied a total of 308 rules in 213 ms. Remains 467 /621 variables (removed 154) and now considering 1120/2480 (removed 1360) transitions.
// Phase 1: matrix 1120 rows 467 cols
[2024-05-23 07:05:27] [INFO ] Computed 23 invariants in 90 ms
[2024-05-23 07:05:28] [INFO ] Implicit Places using invariants in 1028 ms returned []
[2024-05-23 07:05:28] [INFO ] Invariant cache hit.
[2024-05-23 07:05:29] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 07:05:33] [INFO ] Implicit Places using invariants and state equation in 5251 ms returned []
Implicit Place search using SMT with State Equation took 6366 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2024-05-23 07:05:33] [INFO ] Invariant cache hit.
[2024-05-23 07:05:33] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-23 07:05:54] [INFO ] Deduced a trap composed of 200 places in 731 ms of which 81 ms to minimize.
[2024-05-23 07:05:55] [INFO ] Deduced a trap composed of 163 places in 656 ms of which 8 ms to minimize.
[2024-05-23 07:05:56] [INFO ] Deduced a trap composed of 161 places in 410 ms of which 5 ms to minimize.
[2024-05-23 07:05:56] [INFO ] Deduced a trap composed of 207 places in 413 ms of which 5 ms to minimize.
[2024-05-23 07:05:57] [INFO ] Deduced a trap composed of 211 places in 597 ms of which 7 ms to minimize.
[2024-05-23 07:05:57] [INFO ] Deduced a trap composed of 275 places in 649 ms of which 8 ms to minimize.
[2024-05-23 07:05:58] [INFO ] Deduced a trap composed of 203 places in 614 ms of which 7 ms to minimize.
[2024-05-23 07:05:59] [INFO ] Deduced a trap composed of 290 places in 673 ms of which 8 ms to minimize.
[2024-05-23 07:05:59] [INFO ] Deduced a trap composed of 215 places in 649 ms of which 7 ms to minimize.
[2024-05-23 07:06:00] [INFO ] Deduced a trap composed of 319 places in 585 ms of which 7 ms to minimize.
[2024-05-23 07:06:01] [INFO ] Deduced a trap composed of 88 places in 681 ms of which 8 ms to minimize.
[2024-05-23 07:06:01] [INFO ] Deduced a trap composed of 284 places in 690 ms of which 8 ms to minimize.
[2024-05-23 07:06:02] [INFO ] Deduced a trap composed of 191 places in 656 ms of which 8 ms to minimize.
[2024-05-23 07:06:03] [INFO ] Deduced a trap composed of 117 places in 555 ms of which 7 ms to minimize.
[2024-05-23 07:06:03] [INFO ] Deduced a trap composed of 269 places in 500 ms of which 7 ms to minimize.
[2024-05-23 07:06:04] [INFO ] Deduced a trap composed of 116 places in 550 ms of which 7 ms to minimize.
[2024-05-23 07:06:04] [INFO ] Deduced a trap composed of 265 places in 555 ms of which 7 ms to minimize.
[2024-05-23 07:06:05] [INFO ] Deduced a trap composed of 203 places in 575 ms of which 7 ms to minimize.
[2024-05-23 07:06:06] [INFO ] Deduced a trap composed of 114 places in 593 ms of which 5 ms to minimize.
SMT process timed out in 32538ms, After SMT, problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 32604ms
Starting structural reductions in LTL mode, iteration 1 : 467/621 places, 1120/2480 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39246 ms. Remains : 467/621 places, 1120/2480 transitions.
Support contains 50 out of 467 places after structural reductions.
[2024-05-23 07:06:07] [INFO ] Flatten gal took : 274 ms
[2024-05-23 07:06:07] [INFO ] Flatten gal took : 167 ms
[2024-05-23 07:06:07] [INFO ] Input system was already deterministic with 1120 transitions.
RANDOM walk for 40000 steps (8 resets) in 2507 ms. (15 steps per ms) remains 22/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 67 ms. (58 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 117 ms. (33 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 19/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 13/13 properties
[2024-05-23 07:06:08] [INFO ] Invariant cache hit.
[2024-05-23 07:06:08] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 394/423 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 34/457 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 10/467 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-23 07:06:09] [INFO ] Deduced a trap composed of 169 places in 625 ms of which 8 ms to minimize.
[2024-05-23 07:06:10] [INFO ] Deduced a trap composed of 105 places in 694 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 1120/1587 variables, 467/492 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1587 variables, 90/582 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-23 07:06:13] [INFO ] Deduced a trap composed of 154 places in 570 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1587 variables, 1/583 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1587/1587 variables, and 583 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 467/467 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 394/423 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 34/457 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp23 is UNSAT
At refinement iteration 6 (OVERLAPS) 10/467 variables, 9/23 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 3/26 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-23 07:06:15] [INFO ] Deduced a trap composed of 134 places in 351 ms of which 4 ms to minimize.
[2024-05-23 07:06:15] [INFO ] Deduced a trap composed of 162 places in 645 ms of which 7 ms to minimize.
[2024-05-23 07:06:16] [INFO ] Deduced a trap composed of 88 places in 646 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 3/29 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-23 07:06:17] [INFO ] Deduced a trap composed of 132 places in 585 ms of which 7 ms to minimize.
[2024-05-23 07:06:17] [INFO ] Deduced a trap composed of 115 places in 589 ms of which 7 ms to minimize.
[2024-05-23 07:06:18] [INFO ] Deduced a trap composed of 249 places in 617 ms of which 8 ms to minimize.
[2024-05-23 07:06:19] [INFO ] Deduced a trap composed of 166 places in 653 ms of which 7 ms to minimize.
SMT process timed out in 10681ms, After SMT, problems are : Problem set: 1 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25 out of 467 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 88 Pre rules applied. Total rules applied 0 place count 467 transition count 1032
Deduced a syphon composed of 88 places in 3 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 0 with 176 rules applied. Total rules applied 176 place count 379 transition count 1032
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 189 place count 366 transition count 803
Iterating global reduction 0 with 13 rules applied. Total rules applied 202 place count 366 transition count 803
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 206 place count 364 transition count 801
Applied a total of 206 rules in 232 ms. Remains 364 /467 variables (removed 103) and now considering 801/1120 (removed 319) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 233 ms. Remains : 364/467 places, 801/1120 transitions.
RANDOM walk for 40000 steps (8 resets) in 754 ms. (52 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 174 ms. (228 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 302 ms. (132 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 144 ms. (275 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 125 ms. (317 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40001 steps (8 resets) in 144 ms. (275 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 187 ms. (212 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 143 ms. (277 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 192 ms. (207 steps per ms) remains 8/8 properties
// Phase 1: matrix 801 rows 364 cols
[2024-05-23 07:06:20] [INFO ] Computed 23 invariants in 22 ms
[2024-05-23 07:06:20] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 324/341 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 13/354 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 10/364 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-23 07:06:21] [INFO ] Deduced a trap composed of 110 places in 511 ms of which 6 ms to minimize.
[2024-05-23 07:06:21] [INFO ] Deduced a trap composed of 165 places in 544 ms of which 6 ms to minimize.
[2024-05-23 07:06:22] [INFO ] Deduced a trap composed of 202 places in 519 ms of which 6 ms to minimize.
[2024-05-23 07:06:22] [INFO ] Deduced a trap composed of 233 places in 433 ms of which 6 ms to minimize.
[2024-05-23 07:06:23] [INFO ] Deduced a trap composed of 174 places in 387 ms of which 4 ms to minimize.
[2024-05-23 07:06:23] [INFO ] Deduced a trap composed of 182 places in 485 ms of which 6 ms to minimize.
[2024-05-23 07:06:24] [INFO ] Deduced a trap composed of 176 places in 480 ms of which 6 ms to minimize.
[2024-05-23 07:06:24] [INFO ] Deduced a trap composed of 182 places in 433 ms of which 6 ms to minimize.
[2024-05-23 07:06:25] [INFO ] Deduced a trap composed of 122 places in 432 ms of which 5 ms to minimize.
[2024-05-23 07:06:25] [INFO ] Deduced a trap composed of 147 places in 421 ms of which 5 ms to minimize.
[2024-05-23 07:06:25] [INFO ] Deduced a trap composed of 157 places in 425 ms of which 6 ms to minimize.
[2024-05-23 07:06:26] [INFO ] Deduced a trap composed of 150 places in 420 ms of which 5 ms to minimize.
[2024-05-23 07:06:26] [INFO ] Deduced a trap composed of 195 places in 412 ms of which 5 ms to minimize.
[2024-05-23 07:06:27] [INFO ] Deduced a trap composed of 208 places in 437 ms of which 7 ms to minimize.
[2024-05-23 07:06:27] [INFO ] Deduced a trap composed of 109 places in 496 ms of which 6 ms to minimize.
[2024-05-23 07:06:28] [INFO ] Deduced a trap composed of 60 places in 439 ms of which 5 ms to minimize.
[2024-05-23 07:06:28] [INFO ] Deduced a trap composed of 93 places in 412 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-23 07:06:29] [INFO ] Deduced a trap composed of 65 places in 505 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 801/1165 variables, 364/405 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1165 variables, 90/495 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1165 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/1165 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1165/1165 variables, and 495 constraints, problems are : Problem set: 0 solved, 8 unsolved in 10991 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 364/364 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 324/341 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 13/354 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-23 07:06:31] [INFO ] Deduced a trap composed of 289 places in 301 ms of which 4 ms to minimize.
[2024-05-23 07:06:32] [INFO ] Deduced a trap composed of 281 places in 317 ms of which 4 ms to minimize.
[2024-05-23 07:06:32] [INFO ] Deduced a trap composed of 291 places in 442 ms of which 6 ms to minimize.
[2024-05-23 07:06:33] [INFO ] Deduced a trap composed of 285 places in 301 ms of which 5 ms to minimize.
[2024-05-23 07:06:33] [INFO ] Deduced a trap composed of 258 places in 306 ms of which 4 ms to minimize.
[2024-05-23 07:06:33] [INFO ] Deduced a trap composed of 278 places in 311 ms of which 4 ms to minimize.
[2024-05-23 07:06:34] [INFO ] Deduced a trap composed of 275 places in 365 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 10/364 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-23 07:06:35] [INFO ] Deduced a trap composed of 164 places in 506 ms of which 6 ms to minimize.
[2024-05-23 07:06:35] [INFO ] Deduced a trap composed of 184 places in 420 ms of which 4 ms to minimize.
[2024-05-23 07:06:35] [INFO ] Deduced a trap composed of 95 places in 414 ms of which 5 ms to minimize.
[2024-05-23 07:06:36] [INFO ] Deduced a trap composed of 129 places in 394 ms of which 4 ms to minimize.
[2024-05-23 07:06:36] [INFO ] Deduced a trap composed of 107 places in 418 ms of which 5 ms to minimize.
[2024-05-23 07:06:37] [INFO ] Deduced a trap composed of 117 places in 253 ms of which 3 ms to minimize.
[2024-05-23 07:06:37] [INFO ] Deduced a trap composed of 136 places in 468 ms of which 4 ms to minimize.
[2024-05-23 07:06:38] [INFO ] Deduced a trap composed of 100 places in 417 ms of which 6 ms to minimize.
[2024-05-23 07:06:38] [INFO ] Deduced a trap composed of 116 places in 420 ms of which 5 ms to minimize.
[2024-05-23 07:06:38] [INFO ] Deduced a trap composed of 133 places in 412 ms of which 6 ms to minimize.
[2024-05-23 07:06:39] [INFO ] Deduced a trap composed of 153 places in 484 ms of which 6 ms to minimize.
[2024-05-23 07:06:39] [INFO ] Deduced a trap composed of 78 places in 391 ms of which 6 ms to minimize.
[2024-05-23 07:06:40] [INFO ] Deduced a trap composed of 109 places in 501 ms of which 6 ms to minimize.
[2024-05-23 07:06:40] [INFO ] Deduced a trap composed of 126 places in 494 ms of which 6 ms to minimize.
[2024-05-23 07:06:41] [INFO ] Deduced a trap composed of 128 places in 483 ms of which 5 ms to minimize.
[2024-05-23 07:06:41] [INFO ] Deduced a trap composed of 145 places in 403 ms of which 5 ms to minimize.
[2024-05-23 07:06:42] [INFO ] Deduced a trap composed of 164 places in 413 ms of which 6 ms to minimize.
[2024-05-23 07:06:42] [INFO ] Deduced a trap composed of 104 places in 378 ms of which 5 ms to minimize.
[2024-05-23 07:06:43] [INFO ] Deduced a trap composed of 201 places in 400 ms of which 5 ms to minimize.
[2024-05-23 07:06:43] [INFO ] Deduced a trap composed of 146 places in 411 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-23 07:06:44] [INFO ] Deduced a trap composed of 89 places in 373 ms of which 5 ms to minimize.
[2024-05-23 07:06:44] [INFO ] Deduced a trap composed of 81 places in 409 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/364 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-23 07:06:45] [INFO ] Deduced a trap composed of 105 places in 369 ms of which 6 ms to minimize.
[2024-05-23 07:06:46] [INFO ] Deduced a trap composed of 185 places in 468 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/364 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-23 07:06:47] [INFO ] Deduced a trap composed of 89 places in 505 ms of which 6 ms to minimize.
[2024-05-23 07:06:47] [INFO ] Deduced a trap composed of 87 places in 439 ms of which 6 ms to minimize.
[2024-05-23 07:06:48] [INFO ] Deduced a trap composed of 105 places in 456 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/364 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/364 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 801/1165 variables, 364/439 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1165 variables, 90/529 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1165 variables, 8/537 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1165 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 0/1165 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1165/1165 variables, and 537 constraints, problems are : Problem set: 0 solved, 8 unsolved in 24124 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 364/364 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 52/52 constraints]
After SMT, in 35169ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 3 properties in 8461 ms.
Support contains 10 out of 364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 801/801 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 359 transition count 706
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 359 transition count 706
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 357 transition count 704
Applied a total of 14 rules in 58 ms. Remains 357 /364 variables (removed 7) and now considering 704/801 (removed 97) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 357/364 places, 704/801 transitions.
RANDOM walk for 40000 steps (8 resets) in 187 ms. (212 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (8 resets) in 113 ms. (350 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 157 ms. (253 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 234 ms. (170 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 268 ms. (148 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 173926 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 5
Probabilistic random walk after 173926 steps, saw 133547 distinct states, run finished after 3019 ms. (steps per millisecond=57 ) properties seen :0
// Phase 1: matrix 704 rows 357 cols
[2024-05-23 07:07:07] [INFO ] Computed 23 invariants in 11 ms
[2024-05-23 07:07:07] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 321/331 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 16/347 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 10/357 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-23 07:07:08] [INFO ] Deduced a trap composed of 158 places in 295 ms of which 4 ms to minimize.
[2024-05-23 07:07:08] [INFO ] Deduced a trap composed of 122 places in 467 ms of which 6 ms to minimize.
[2024-05-23 07:07:09] [INFO ] Deduced a trap composed of 107 places in 483 ms of which 6 ms to minimize.
[2024-05-23 07:07:09] [INFO ] Deduced a trap composed of 107 places in 393 ms of which 4 ms to minimize.
[2024-05-23 07:07:10] [INFO ] Deduced a trap composed of 122 places in 461 ms of which 6 ms to minimize.
[2024-05-23 07:07:10] [INFO ] Deduced a trap composed of 90 places in 459 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 704/1061 variables, 357/386 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1061 variables, 90/476 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1061 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/1061 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1061/1061 variables, and 476 constraints, problems are : Problem set: 0 solved, 5 unsolved in 4476 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 357/357 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 321/331 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 16/347 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 10/357 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-23 07:07:12] [INFO ] Deduced a trap composed of 145 places in 385 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-23 07:07:13] [INFO ] Deduced a trap composed of 137 places in 356 ms of which 10 ms to minimize.
[2024-05-23 07:07:13] [INFO ] Deduced a trap composed of 185 places in 359 ms of which 6 ms to minimize.
[2024-05-23 07:07:14] [INFO ] Deduced a trap composed of 67 places in 388 ms of which 5 ms to minimize.
[2024-05-23 07:07:14] [INFO ] Deduced a trap composed of 63 places in 355 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-23 07:07:15] [INFO ] Deduced a trap composed of 137 places in 403 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 704/1061 variables, 357/392 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1061 variables, 90/482 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1061 variables, 5/487 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1061 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/1061 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1061/1061 variables, and 487 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5903 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 357/357 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 12/12 constraints]
After SMT, in 10408ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 1 properties in 4869 ms.
Support contains 9 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 704/704 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 356 transition count 685
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 356 transition count 685
Applied a total of 2 rules in 40 ms. Remains 356 /357 variables (removed 1) and now considering 685/704 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 356/357 places, 685/704 transitions.
RANDOM walk for 40000 steps (8 resets) in 172 ms. (231 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 113 ms. (350 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 132 ms. (300 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 139 ms. (285 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 242894 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 4
Probabilistic random walk after 242894 steps, saw 185040 distinct states, run finished after 3002 ms. (steps per millisecond=80 ) properties seen :0
// Phase 1: matrix 685 rows 356 cols
[2024-05-23 07:07:26] [INFO ] Computed 23 invariants in 6 ms
[2024-05-23 07:07:26] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 321/330 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/330 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 16/346 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 10/356 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-23 07:07:26] [INFO ] Deduced a trap composed of 179 places in 283 ms of which 4 ms to minimize.
[2024-05-23 07:07:27] [INFO ] Deduced a trap composed of 118 places in 286 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-23 07:07:27] [INFO ] Deduced a trap composed of 139 places in 344 ms of which 5 ms to minimize.
[2024-05-23 07:07:27] [INFO ] Deduced a trap composed of 60 places in 363 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-23 07:07:28] [INFO ] Deduced a trap composed of 129 places in 382 ms of which 5 ms to minimize.
[2024-05-23 07:07:28] [INFO ] Deduced a trap composed of 120 places in 430 ms of which 6 ms to minimize.
[2024-05-23 07:07:29] [INFO ] Deduced a trap composed of 84 places in 465 ms of which 6 ms to minimize.
[2024-05-23 07:07:29] [INFO ] Deduced a trap composed of 63 places in 471 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 685/1041 variables, 356/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1041 variables, 90/477 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1041 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/1041 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1041/1041 variables, and 477 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4768 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 356/356 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 321/330 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/330 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 16/346 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 10/356 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 685/1041 variables, 356/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1041 variables, 90/477 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1041 variables, 4/481 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1041 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1041 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1041/1041 variables, and 481 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2511 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 356/356 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 8/8 constraints]
After SMT, in 7309ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1771 ms.
Support contains 9 out of 356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 685/685 transitions.
Applied a total of 0 rules in 47 ms. Remains 356 /356 variables (removed 0) and now considering 685/685 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 356/356 places, 685/685 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 685/685 transitions.
Applied a total of 0 rules in 29 ms. Remains 356 /356 variables (removed 0) and now considering 685/685 (removed 0) transitions.
[2024-05-23 07:07:35] [INFO ] Invariant cache hit.
[2024-05-23 07:07:36] [INFO ] Implicit Places using invariants in 961 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 966 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 355/356 places, 685/685 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 95 rules applied. Total rules applied 95 place count 355 transition count 590
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 1 with 95 rules applied. Total rules applied 190 place count 260 transition count 590
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 195 place count 260 transition count 585
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 200 place count 255 transition count 585
Applied a total of 200 rules in 50 ms. Remains 255 /355 variables (removed 100) and now considering 585/685 (removed 100) transitions.
// Phase 1: matrix 585 rows 255 cols
[2024-05-23 07:07:36] [INFO ] Computed 22 invariants in 6 ms
[2024-05-23 07:07:36] [INFO ] Implicit Places using invariants in 409 ms returned []
[2024-05-23 07:07:36] [INFO ] Invariant cache hit.
[2024-05-23 07:07:37] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 07:07:38] [INFO ] Implicit Places using invariants and state equation in 1561 ms returned []
Implicit Place search using SMT with State Equation took 1972 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 255/356 places, 585/685 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3017 ms. Remains : 255/356 places, 585/685 transitions.
RANDOM walk for 40000 steps (8 resets) in 149 ms. (266 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 75 ms. (526 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 211 ms. (188 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 287198 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :1 out of 4
Probabilistic random walk after 287198 steps, saw 213271 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :1
[2024-05-23 07:07:41] [INFO ] Invariant cache hit.
[2024-05-23 07:07:41] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 221/229 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 7/236 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 18/254 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 07:07:41] [INFO ] Deduced a trap composed of 93 places in 253 ms of which 4 ms to minimize.
[2024-05-23 07:07:42] [INFO ] Deduced a trap composed of 131 places in 267 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 07:07:42] [INFO ] Deduced a trap composed of 110 places in 226 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 07:07:42] [INFO ] Deduced a trap composed of 73 places in 276 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/255 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 07:07:43] [INFO ] Deduced a trap composed of 80 places in 342 ms of which 5 ms to minimize.
[2024-05-23 07:07:43] [INFO ] Deduced a trap composed of 96 places in 292 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/255 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 07:07:43] [INFO ] Deduced a trap composed of 59 places in 345 ms of which 5 ms to minimize.
[2024-05-23 07:07:44] [INFO ] Deduced a trap composed of 86 places in 347 ms of which 5 ms to minimize.
[2024-05-23 07:07:44] [INFO ] Deduced a trap composed of 91 places in 311 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/255 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/255 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 585/840 variables, 255/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/840 variables, 90/376 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/840 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/840 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 376 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3578 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 255/255 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 221/229 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/236 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 18/254 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/255 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 585/840 variables, 255/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/840 variables, 90/376 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/840 variables, 3/379 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/840 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/840 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 379 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1285 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 255/255 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 9/9 constraints]
After SMT, in 4877ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 1 properties in 274 ms.
Support contains 6 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 585/585 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 253 transition count 547
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 253 transition count 547
Applied a total of 4 rules in 35 ms. Remains 253 /255 variables (removed 2) and now considering 547/585 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 253/255 places, 547/585 transitions.
RANDOM walk for 40000 steps (8 resets) in 187 ms. (212 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 352148 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :0 out of 2
Probabilistic random walk after 352148 steps, saw 261932 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :0
// Phase 1: matrix 547 rows 253 cols
[2024-05-23 07:07:49] [INFO ] Computed 22 invariants in 5 ms
[2024-05-23 07:07:49] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 221/227 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/234 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 18/252 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/253 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 547/800 variables, 253/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/800 variables, 90/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/800 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/800 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 365 constraints, problems are : Problem set: 0 solved, 2 unsolved in 457 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 253/253 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 221/227 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/234 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 18/252 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/253 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 547/800 variables, 253/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/800 variables, 90/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/800 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/800 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/800 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 800/800 variables, and 367 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1013 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 253/253 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1487ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 155 ms.
Support contains 6 out of 253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 547/547 transitions.
Applied a total of 0 rules in 21 ms. Remains 253 /253 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 253/253 places, 547/547 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 547/547 transitions.
Applied a total of 0 rules in 16 ms. Remains 253 /253 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2024-05-23 07:07:51] [INFO ] Invariant cache hit.
[2024-05-23 07:07:52] [INFO ] Implicit Places using invariants in 537 ms returned []
[2024-05-23 07:07:52] [INFO ] Invariant cache hit.
[2024-05-23 07:07:52] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 07:07:53] [INFO ] Implicit Places using invariants and state equation in 1344 ms returned []
Implicit Place search using SMT with State Equation took 1890 ms to find 0 implicit places.
[2024-05-23 07:07:53] [INFO ] Redundant transitions in 54 ms returned []
Running 537 sub problems to find dead transitions.
[2024-05-23 07:07:53] [INFO ] Invariant cache hit.
[2024-05-23 07:07:53] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 537 unsolved
[2024-05-23 07:08:00] [INFO ] Deduced a trap composed of 92 places in 349 ms of which 5 ms to minimize.
[2024-05-23 07:08:01] [INFO ] Deduced a trap composed of 39 places in 323 ms of which 4 ms to minimize.
[2024-05-23 07:08:02] [INFO ] Deduced a trap composed of 69 places in 331 ms of which 4 ms to minimize.
[2024-05-23 07:08:03] [INFO ] Deduced a trap composed of 106 places in 369 ms of which 5 ms to minimize.
[2024-05-23 07:08:03] [INFO ] Deduced a trap composed of 95 places in 340 ms of which 4 ms to minimize.
[2024-05-23 07:08:04] [INFO ] Deduced a trap composed of 63 places in 308 ms of which 4 ms to minimize.
[2024-05-23 07:08:04] [INFO ] Deduced a trap composed of 39 places in 324 ms of which 5 ms to minimize.
[2024-05-23 07:08:05] [INFO ] Deduced a trap composed of 68 places in 347 ms of which 5 ms to minimize.
[2024-05-23 07:08:05] [INFO ] Deduced a trap composed of 82 places in 326 ms of which 4 ms to minimize.
[2024-05-23 07:08:06] [INFO ] Deduced a trap composed of 109 places in 235 ms of which 3 ms to minimize.
[2024-05-23 07:08:06] [INFO ] Deduced a trap composed of 90 places in 338 ms of which 4 ms to minimize.
[2024-05-23 07:08:06] [INFO ] Deduced a trap composed of 71 places in 232 ms of which 3 ms to minimize.
[2024-05-23 07:08:07] [INFO ] Deduced a trap composed of 81 places in 338 ms of which 5 ms to minimize.
[2024-05-23 07:08:07] [INFO ] Deduced a trap composed of 113 places in 235 ms of which 3 ms to minimize.
[2024-05-23 07:08:07] [INFO ] Deduced a trap composed of 76 places in 343 ms of which 4 ms to minimize.
[2024-05-23 07:08:08] [INFO ] Deduced a trap composed of 79 places in 326 ms of which 4 ms to minimize.
[2024-05-23 07:08:08] [INFO ] Deduced a trap composed of 89 places in 331 ms of which 5 ms to minimize.
[2024-05-23 07:08:08] [INFO ] Deduced a trap composed of 86 places in 326 ms of which 4 ms to minimize.
[2024-05-23 07:08:09] [INFO ] Deduced a trap composed of 63 places in 225 ms of which 3 ms to minimize.
[2024-05-23 07:08:09] [INFO ] Deduced a trap composed of 88 places in 324 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 537 unsolved
[2024-05-23 07:08:11] [INFO ] Deduced a trap composed of 66 places in 329 ms of which 4 ms to minimize.
[2024-05-23 07:08:11] [INFO ] Deduced a trap composed of 56 places in 245 ms of which 3 ms to minimize.
[2024-05-23 07:08:12] [INFO ] Deduced a trap composed of 53 places in 229 ms of which 3 ms to minimize.
[2024-05-23 07:08:12] [INFO ] Deduced a trap composed of 69 places in 327 ms of which 4 ms to minimize.
[2024-05-23 07:08:12] [INFO ] Deduced a trap composed of 62 places in 322 ms of which 4 ms to minimize.
[2024-05-23 07:08:12] [INFO ] Deduced a trap composed of 71 places in 217 ms of which 3 ms to minimize.
[2024-05-23 07:08:13] [INFO ] Deduced a trap composed of 68 places in 327 ms of which 5 ms to minimize.
[2024-05-23 07:08:13] [INFO ] Deduced a trap composed of 70 places in 268 ms of which 4 ms to minimize.
[2024-05-23 07:08:13] [INFO ] Deduced a trap composed of 69 places in 227 ms of which 3 ms to minimize.
[2024-05-23 07:08:14] [INFO ] Deduced a trap composed of 66 places in 319 ms of which 4 ms to minimize.
[2024-05-23 07:08:14] [INFO ] Deduced a trap composed of 47 places in 322 ms of which 4 ms to minimize.
[2024-05-23 07:08:15] [INFO ] Deduced a trap composed of 67 places in 338 ms of which 4 ms to minimize.
[2024-05-23 07:08:15] [INFO ] Deduced a trap composed of 61 places in 330 ms of which 5 ms to minimize.
[2024-05-23 07:08:15] [INFO ] Deduced a trap composed of 82 places in 324 ms of which 4 ms to minimize.
[2024-05-23 07:08:16] [INFO ] Deduced a trap composed of 79 places in 323 ms of which 4 ms to minimize.
[2024-05-23 07:08:16] [INFO ] Deduced a trap composed of 80 places in 335 ms of which 8 ms to minimize.
[2024-05-23 07:08:16] [INFO ] Deduced a trap composed of 87 places in 328 ms of which 4 ms to minimize.
[2024-05-23 07:08:17] [INFO ] Deduced a trap composed of 58 places in 328 ms of which 5 ms to minimize.
[2024-05-23 07:08:17] [INFO ] Deduced a trap composed of 60 places in 331 ms of which 5 ms to minimize.
[2024-05-23 07:08:17] [INFO ] Deduced a trap composed of 61 places in 339 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 253/800 variables, and 62 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/253 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 537 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 537 unsolved
[2024-05-23 07:08:29] [INFO ] Deduced a trap composed of 66 places in 148 ms of which 3 ms to minimize.
[2024-05-23 07:08:29] [INFO ] Deduced a trap composed of 62 places in 316 ms of which 4 ms to minimize.
[2024-05-23 07:08:29] [INFO ] Deduced a trap composed of 65 places in 311 ms of which 5 ms to minimize.
[2024-05-23 07:08:30] [INFO ] Deduced a trap composed of 59 places in 334 ms of which 4 ms to minimize.
[2024-05-23 07:08:30] [INFO ] Deduced a trap composed of 67 places in 318 ms of which 5 ms to minimize.
[2024-05-23 07:08:30] [INFO ] Deduced a trap composed of 59 places in 307 ms of which 4 ms to minimize.
[2024-05-23 07:08:31] [INFO ] Deduced a trap composed of 61 places in 309 ms of which 5 ms to minimize.
[2024-05-23 07:08:31] [INFO ] Deduced a trap composed of 51 places in 316 ms of which 4 ms to minimize.
[2024-05-23 07:08:32] [INFO ] Deduced a trap composed of 92 places in 335 ms of which 5 ms to minimize.
[2024-05-23 07:08:33] [INFO ] Deduced a trap composed of 81 places in 272 ms of which 4 ms to minimize.
[2024-05-23 07:08:33] [INFO ] Deduced a trap composed of 81 places in 341 ms of which 5 ms to minimize.
[2024-05-23 07:08:33] [INFO ] Deduced a trap composed of 119 places in 332 ms of which 4 ms to minimize.
[2024-05-23 07:08:34] [INFO ] Deduced a trap composed of 111 places in 324 ms of which 5 ms to minimize.
[2024-05-23 07:08:34] [INFO ] Deduced a trap composed of 80 places in 328 ms of which 5 ms to minimize.
[2024-05-23 07:08:34] [INFO ] Deduced a trap composed of 73 places in 325 ms of which 4 ms to minimize.
[2024-05-23 07:08:35] [INFO ] Deduced a trap composed of 66 places in 319 ms of which 4 ms to minimize.
[2024-05-23 07:08:35] [INFO ] Deduced a trap composed of 85 places in 328 ms of which 4 ms to minimize.
[2024-05-23 07:08:35] [INFO ] Deduced a trap composed of 53 places in 326 ms of which 4 ms to minimize.
[2024-05-23 07:08:36] [INFO ] Deduced a trap composed of 59 places in 322 ms of which 4 ms to minimize.
[2024-05-23 07:08:36] [INFO ] Deduced a trap composed of 66 places in 267 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 253/800 variables, and 82 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/253 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/537 constraints, Known Traps: 60/60 constraints]
After SMT, in 60776ms problems are : Problem set: 0 solved, 537 unsolved
Search for dead transitions found 0 dead transitions in 60786ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62759 ms. Remains : 253/253 places, 547/547 transitions.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((!X(p0) U p1)))'
Support contains 6 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 443 transition count 718
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 443 transition count 718
Applied a total of 48 rules in 27 ms. Remains 443 /467 variables (removed 24) and now considering 718/1120 (removed 402) transitions.
// Phase 1: matrix 718 rows 443 cols
[2024-05-23 07:08:54] [INFO ] Computed 23 invariants in 19 ms
[2024-05-23 07:08:55] [INFO ] Implicit Places using invariants in 1057 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1059 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/467 places, 718/1120 transitions.
Applied a total of 0 rules in 11 ms. Remains 442 /442 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1104 ms. Remains : 442/467 places, 718/1120 transitions.
Stuttering acceptance computed with spot in 373 ms :[(NOT p1), (OR (NOT p1) p0), true]
Running random walk in product with property : Anderson-PT-10-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA Anderson-PT-10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-10-LTLFireability-00 finished in 1569 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 4 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 443 transition count 718
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 443 transition count 718
Applied a total of 48 rules in 42 ms. Remains 443 /467 variables (removed 24) and now considering 718/1120 (removed 402) transitions.
// Phase 1: matrix 718 rows 443 cols
[2024-05-23 07:08:56] [INFO ] Computed 23 invariants in 10 ms
[2024-05-23 07:08:57] [INFO ] Implicit Places using invariants in 893 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 900 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/467 places, 718/1120 transitions.
Applied a total of 0 rules in 37 ms. Remains 442 /442 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 979 ms. Remains : 442/467 places, 718/1120 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Anderson-PT-10-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-10-LTLFireability-01 finished in 1196 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' '!(((!p0&&X(X(F(p0)))) U G(!p1)))'
Support contains 5 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 442 transition count 681
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 442 transition count 681
Applied a total of 50 rules in 61 ms. Remains 442 /467 variables (removed 25) and now considering 681/1120 (removed 439) transitions.
// Phase 1: matrix 681 rows 442 cols
[2024-05-23 07:08:57] [INFO ] Computed 23 invariants in 9 ms
[2024-05-23 07:08:58] [INFO ] Implicit Places using invariants in 602 ms returned []
[2024-05-23 07:08:58] [INFO ] Invariant cache hit.
[2024-05-23 07:08:58] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 07:09:00] [INFO ] Implicit Places using invariants and state equation in 2617 ms returned []
Implicit Place search using SMT with State Equation took 3222 ms to find 0 implicit places.
Running 671 sub problems to find dead transitions.
[2024-05-23 07:09:00] [INFO ] Invariant cache hit.
[2024-05-23 07:09:00] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/441 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-23 07:09:16] [INFO ] Deduced a trap composed of 172 places in 546 ms of which 8 ms to minimize.
[2024-05-23 07:09:17] [INFO ] Deduced a trap composed of 140 places in 571 ms of which 7 ms to minimize.
[2024-05-23 07:09:18] [INFO ] Deduced a trap composed of 133 places in 548 ms of which 7 ms to minimize.
[2024-05-23 07:09:19] [INFO ] Deduced a trap composed of 130 places in 567 ms of which 7 ms to minimize.
[2024-05-23 07:09:19] [INFO ] Deduced a trap composed of 155 places in 547 ms of which 7 ms to minimize.
[2024-05-23 07:09:20] [INFO ] Deduced a trap composed of 217 places in 605 ms of which 6 ms to minimize.
[2024-05-23 07:09:20] [INFO ] Deduced a trap composed of 138 places in 557 ms of which 7 ms to minimize.
[2024-05-23 07:09:21] [INFO ] Deduced a trap composed of 98 places in 556 ms of which 7 ms to minimize.
[2024-05-23 07:09:22] [INFO ] Deduced a trap composed of 97 places in 565 ms of which 7 ms to minimize.
[2024-05-23 07:09:22] [INFO ] Deduced a trap composed of 123 places in 557 ms of which 7 ms to minimize.
[2024-05-23 07:09:23] [INFO ] Deduced a trap composed of 171 places in 558 ms of which 7 ms to minimize.
[2024-05-23 07:09:24] [INFO ] Deduced a trap composed of 148 places in 570 ms of which 7 ms to minimize.
[2024-05-23 07:09:24] [INFO ] Deduced a trap composed of 189 places in 550 ms of which 8 ms to minimize.
[2024-05-23 07:09:25] [INFO ] Deduced a trap composed of 144 places in 561 ms of which 7 ms to minimize.
[2024-05-23 07:09:25] [INFO ] Deduced a trap composed of 175 places in 550 ms of which 7 ms to minimize.
[2024-05-23 07:09:26] [INFO ] Deduced a trap composed of 138 places in 554 ms of which 7 ms to minimize.
[2024-05-23 07:09:26] [INFO ] Deduced a trap composed of 141 places in 547 ms of which 7 ms to minimize.
[2024-05-23 07:09:27] [INFO ] Deduced a trap composed of 98 places in 573 ms of which 7 ms to minimize.
[2024-05-23 07:09:28] [INFO ] Deduced a trap composed of 171 places in 668 ms of which 7 ms to minimize.
[2024-05-23 07:09:28] [INFO ] Deduced a trap composed of 101 places in 561 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/441 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 441/1123 variables, and 42 constraints, problems are : Problem set: 0 solved, 671 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/11 constraints, State Equation: 0/442 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 671/671 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 671 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/441 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/441 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 441/1123 variables, and 42 constraints, problems are : Problem set: 0 solved, 671 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/11 constraints, State Equation: 0/442 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/671 constraints, Known Traps: 20/20 constraints]
After SMT, in 61090ms problems are : Problem set: 0 solved, 671 unsolved
Search for dead transitions found 0 dead transitions in 61098ms
Starting structural reductions in LTL mode, iteration 1 : 442/467 places, 681/1120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64389 ms. Remains : 442/467 places, 681/1120 transitions.
Stuttering acceptance computed with spot in 205 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Running random walk in product with property : Anderson-PT-10-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 628 ms.
Product exploration explored 100000 steps with 0 reset in 548 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 148 ms. Reduced automaton from 6 states, 18 edges and 2 AP (stutter sensitive) to 6 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
RANDOM walk for 40000 steps (8 resets) in 184 ms. (216 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 171 ms. (232 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 330 ms. (120 steps per ms) remains 1/3 properties
[2024-05-23 07:10:03] [INFO ] Invariant cache hit.
[2024-05-23 07:10:03] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 425/1123 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 5/12 constraints, Generalized P Invariants (flows): 0/11 constraints, State Equation: 0/442 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 122ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 14 factoid took 512 ms. Reduced automaton from 6 states, 18 edges and 2 AP (stutter sensitive) to 6 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 274 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Support contains 5 out of 442 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 442/442 places, 681/681 transitions.
Applied a total of 0 rules in 9 ms. Remains 442 /442 variables (removed 0) and now considering 681/681 (removed 0) transitions.
[2024-05-23 07:10:05] [INFO ] Invariant cache hit.
[2024-05-23 07:10:05] [INFO ] Implicit Places using invariants in 760 ms returned []
[2024-05-23 07:10:05] [INFO ] Invariant cache hit.
[2024-05-23 07:10:06] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 07:10:08] [INFO ] Implicit Places using invariants and state equation in 2819 ms returned []
Implicit Place search using SMT with State Equation took 3596 ms to find 0 implicit places.
Running 671 sub problems to find dead transitions.
[2024-05-23 07:10:08] [INFO ] Invariant cache hit.
[2024-05-23 07:10:08] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/441 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-23 07:10:22] [INFO ] Deduced a trap composed of 172 places in 489 ms of which 8 ms to minimize.
[2024-05-23 07:10:22] [INFO ] Deduced a trap composed of 140 places in 457 ms of which 7 ms to minimize.
[2024-05-23 07:10:23] [INFO ] Deduced a trap composed of 133 places in 461 ms of which 7 ms to minimize.
[2024-05-23 07:10:23] [INFO ] Deduced a trap composed of 130 places in 468 ms of which 7 ms to minimize.
[2024-05-23 07:10:24] [INFO ] Deduced a trap composed of 155 places in 460 ms of which 6 ms to minimize.
[2024-05-23 07:10:25] [INFO ] Deduced a trap composed of 217 places in 456 ms of which 6 ms to minimize.
[2024-05-23 07:10:25] [INFO ] Deduced a trap composed of 138 places in 452 ms of which 7 ms to minimize.
[2024-05-23 07:10:26] [INFO ] Deduced a trap composed of 98 places in 455 ms of which 7 ms to minimize.
[2024-05-23 07:10:26] [INFO ] Deduced a trap composed of 97 places in 448 ms of which 7 ms to minimize.
[2024-05-23 07:10:27] [INFO ] Deduced a trap composed of 123 places in 469 ms of which 7 ms to minimize.
[2024-05-23 07:10:27] [INFO ] Deduced a trap composed of 171 places in 450 ms of which 7 ms to minimize.
[2024-05-23 07:10:28] [INFO ] Deduced a trap composed of 148 places in 563 ms of which 7 ms to minimize.
[2024-05-23 07:10:28] [INFO ] Deduced a trap composed of 189 places in 476 ms of which 5 ms to minimize.
[2024-05-23 07:10:29] [INFO ] Deduced a trap composed of 144 places in 463 ms of which 7 ms to minimize.
[2024-05-23 07:10:29] [INFO ] Deduced a trap composed of 175 places in 461 ms of which 6 ms to minimize.
[2024-05-23 07:10:30] [INFO ] Deduced a trap composed of 138 places in 527 ms of which 7 ms to minimize.
[2024-05-23 07:10:30] [INFO ] Deduced a trap composed of 141 places in 499 ms of which 6 ms to minimize.
[2024-05-23 07:10:31] [INFO ] Deduced a trap composed of 98 places in 455 ms of which 7 ms to minimize.
[2024-05-23 07:10:31] [INFO ] Deduced a trap composed of 171 places in 471 ms of which 7 ms to minimize.
[2024-05-23 07:10:32] [INFO ] Deduced a trap composed of 101 places in 470 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/441 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-23 07:10:36] [INFO ] Deduced a trap composed of 216 places in 459 ms of which 7 ms to minimize.
[2024-05-23 07:10:37] [INFO ] Deduced a trap composed of 123 places in 444 ms of which 5 ms to minimize.
[2024-05-23 07:10:37] [INFO ] Deduced a trap composed of 133 places in 417 ms of which 5 ms to minimize.
[2024-05-23 07:10:38] [INFO ] Deduced a trap composed of 250 places in 395 ms of which 4 ms to minimize.
[2024-05-23 07:10:38] [INFO ] Deduced a trap composed of 141 places in 429 ms of which 4 ms to minimize.
[2024-05-23 07:10:39] [INFO ] Deduced a trap composed of 144 places in 563 ms of which 7 ms to minimize.
[2024-05-23 07:10:39] [INFO ] Deduced a trap composed of 177 places in 531 ms of which 7 ms to minimize.
SMT process timed out in 31144ms, After SMT, problems are : Problem set: 0 solved, 671 unsolved
Search for dead transitions found 0 dead transitions in 31154ms
Finished structural reductions in LTL mode , in 1 iterations and 34763 ms. Remains : 442/442 places, 681/681 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 157 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter sensitive) to 6 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
RANDOM walk for 40000 steps (8 resets) in 331 ms. (120 steps per ms) remains 1/4 properties
BEST_FIRST walk for 21540 steps (4 resets) in 47 ms. (448 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 324 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter sensitive) to 6 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 283 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 286 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Product exploration explored 100000 steps with 0 reset in 246 ms.
Product exploration explored 100000 steps with 0 reset in 512 ms.
Applying partial POR strategy [true, false, true, false, true, false]
Stuttering acceptance computed with spot in 276 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Support contains 5 out of 442 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 442/442 places, 681/681 transitions.
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 89 Pre rules applied. Total rules applied 0 place count 442 transition count 681
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 0 with 89 rules applied. Total rules applied 89 place count 442 transition count 681
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 442 transition count 681
Deduced a syphon composed of 90 places in 1 ms
Applied a total of 90 rules in 67 ms. Remains 442 /442 variables (removed 0) and now considering 681/681 (removed 0) transitions.
[2024-05-23 07:10:43] [INFO ] Redundant transitions in 29 ms returned []
Running 671 sub problems to find dead transitions.
// Phase 1: matrix 681 rows 442 cols
[2024-05-23 07:10:43] [INFO ] Computed 23 invariants in 6 ms
[2024-05-23 07:10:43] [INFO ] State equation strengthened by 169 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/441 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-23 07:10:52] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 3 ms to minimize.
[2024-05-23 07:10:52] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 2 ms to minimize.
[2024-05-23 07:10:53] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 2 ms to minimize.
[2024-05-23 07:10:53] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-23 07:10:53] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-23 07:10:53] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-23 07:10:53] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 2 ms to minimize.
[2024-05-23 07:10:53] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-23 07:10:54] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-23 07:10:54] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-23 07:10:56] [INFO ] Deduced a trap composed of 91 places in 464 ms of which 5 ms to minimize.
[2024-05-23 07:10:57] [INFO ] Deduced a trap composed of 193 places in 463 ms of which 5 ms to minimize.
[2024-05-23 07:10:58] [INFO ] Deduced a trap composed of 155 places in 568 ms of which 7 ms to minimize.
[2024-05-23 07:10:58] [INFO ] Deduced a trap composed of 110 places in 490 ms of which 4 ms to minimize.
[2024-05-23 07:10:59] [INFO ] Deduced a trap composed of 163 places in 547 ms of which 7 ms to minimize.
[2024-05-23 07:10:59] [INFO ] Deduced a trap composed of 107 places in 486 ms of which 6 ms to minimize.
[2024-05-23 07:11:00] [INFO ] Deduced a trap composed of 106 places in 590 ms of which 7 ms to minimize.
[2024-05-23 07:11:00] [INFO ] Deduced a trap composed of 150 places in 491 ms of which 7 ms to minimize.
[2024-05-23 07:11:01] [INFO ] Deduced a trap composed of 95 places in 568 ms of which 7 ms to minimize.
[2024-05-23 07:11:01] [INFO ] Deduced a trap composed of 132 places in 487 ms of which 6 ms to minimize.
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/441 variables, 20/42 constraints. Problems are: Problem set: 90 solved, 581 unsolved
[2024-05-23 07:11:07] [INFO ] Deduced a trap composed of 124 places in 573 ms of which 7 ms to minimize.
[2024-05-23 07:11:07] [INFO ] Deduced a trap composed of 102 places in 532 ms of which 7 ms to minimize.
[2024-05-23 07:11:08] [INFO ] Deduced a trap composed of 79 places in 540 ms of which 7 ms to minimize.
[2024-05-23 07:11:09] [INFO ] Deduced a trap composed of 207 places in 552 ms of which 7 ms to minimize.
[2024-05-23 07:11:09] [INFO ] Deduced a trap composed of 187 places in 507 ms of which 7 ms to minimize.
[2024-05-23 07:11:10] [INFO ] Deduced a trap composed of 166 places in 523 ms of which 7 ms to minimize.
[2024-05-23 07:11:10] [INFO ] Deduced a trap composed of 230 places in 423 ms of which 6 ms to minimize.
[2024-05-23 07:11:11] [INFO ] Deduced a trap composed of 103 places in 504 ms of which 7 ms to minimize.
[2024-05-23 07:11:11] [INFO ] Deduced a trap composed of 84 places in 505 ms of which 7 ms to minimize.
[2024-05-23 07:11:12] [INFO ] Deduced a trap composed of 207 places in 570 ms of which 7 ms to minimize.
[2024-05-23 07:11:12] [INFO ] Deduced a trap composed of 86 places in 482 ms of which 7 ms to minimize.
[2024-05-23 07:11:13] [INFO ] Deduced a trap composed of 96 places in 539 ms of which 7 ms to minimize.
[2024-05-23 07:11:13] [INFO ] Deduced a trap composed of 111 places in 573 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 441/1123 variables, and 55 constraints, problems are : Problem set: 90 solved, 581 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/11 constraints, State Equation: 0/442 constraints, ReadFeed: 0/169 constraints, PredecessorRefiner: 671/671 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 90 solved, 581 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 1/1 constraints. Problems are: Problem set: 90 solved, 581 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 1/2 constraints. Problems are: Problem set: 90 solved, 581 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 33/35 constraints. Problems are: Problem set: 90 solved, 581 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/351 variables, 0/35 constraints. Problems are: Problem set: 90 solved, 581 unsolved
At refinement iteration 4 (OVERLAPS) 90/441 variables, 11/46 constraints. Problems are: Problem set: 90 solved, 581 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 9/55 constraints. Problems are: Problem set: 90 solved, 581 unsolved
[2024-05-23 07:11:31] [INFO ] Deduced a trap composed of 152 places in 483 ms of which 8 ms to minimize.
[2024-05-23 07:11:32] [INFO ] Deduced a trap composed of 161 places in 441 ms of which 5 ms to minimize.
[2024-05-23 07:11:32] [INFO ] Deduced a trap composed of 118 places in 462 ms of which 7 ms to minimize.
[2024-05-23 07:11:33] [INFO ] Deduced a trap composed of 112 places in 557 ms of which 7 ms to minimize.
[2024-05-23 07:11:33] [INFO ] Deduced a trap composed of 122 places in 559 ms of which 7 ms to minimize.
[2024-05-23 07:11:34] [INFO ] Deduced a trap composed of 144 places in 436 ms of which 5 ms to minimize.
[2024-05-23 07:11:34] [INFO ] Deduced a trap composed of 82 places in 412 ms of which 6 ms to minimize.
[2024-05-23 07:11:35] [INFO ] Deduced a trap composed of 96 places in 556 ms of which 8 ms to minimize.
[2024-05-23 07:11:35] [INFO ] Deduced a trap composed of 122 places in 550 ms of which 6 ms to minimize.
[2024-05-23 07:11:36] [INFO ] Deduced a trap composed of 133 places in 505 ms of which 6 ms to minimize.
[2024-05-23 07:11:36] [INFO ] Deduced a trap composed of 138 places in 513 ms of which 7 ms to minimize.
[2024-05-23 07:11:37] [INFO ] Deduced a trap composed of 165 places in 538 ms of which 7 ms to minimize.
[2024-05-23 07:11:38] [INFO ] Deduced a trap composed of 122 places in 502 ms of which 7 ms to minimize.
[2024-05-23 07:11:38] [INFO ] Deduced a trap composed of 109 places in 571 ms of which 8 ms to minimize.
[2024-05-23 07:11:39] [INFO ] Deduced a trap composed of 155 places in 559 ms of which 7 ms to minimize.
[2024-05-23 07:11:39] [INFO ] Deduced a trap composed of 106 places in 561 ms of which 7 ms to minimize.
[2024-05-23 07:11:40] [INFO ] Deduced a trap composed of 103 places in 496 ms of which 7 ms to minimize.
[2024-05-23 07:11:40] [INFO ] Deduced a trap composed of 139 places in 542 ms of which 7 ms to minimize.
[2024-05-23 07:11:41] [INFO ] Deduced a trap composed of 132 places in 441 ms of which 7 ms to minimize.
[2024-05-23 07:11:42] [INFO ] Deduced a trap composed of 211 places in 546 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 20/75 constraints. Problems are: Problem set: 90 solved, 581 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 441/1123 variables, and 75 constraints, problems are : Problem set: 90 solved, 581 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/11 constraints, State Equation: 0/442 constraints, ReadFeed: 0/169 constraints, PredecessorRefiner: 0/671 constraints, Known Traps: 53/53 constraints]
After SMT, in 60993ms problems are : Problem set: 90 solved, 581 unsolved
Search for dead transitions found 90 dead transitions in 61005ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) removed 90 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 442/442 places, 591/681 transitions.
Graph (complete) has 1561 edges and 442 vertex of which 352 are kept as prefixes of interest. Removing 90 places using SCC suffix rule.7 ms
Discarding 90 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 35 ms. Remains 352 /442 variables (removed 90) and now considering 591/591 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 352/442 places, 591/681 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61156 ms. Remains : 352/442 places, 591/681 transitions.
Built C files in :
/tmp/ltsmin14793312470436372187
[2024-05-23 07:11:44] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14793312470436372187
Running compilation step : cd /tmp/ltsmin14793312470436372187;'/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 2818 ms.
Running link step : cd /tmp/ltsmin14793312470436372187;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin14793312470436372187;'/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/stateBased1264587085850505390.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 442 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 442/442 places, 681/681 transitions.
Applied a total of 0 rules in 12 ms. Remains 442 /442 variables (removed 0) and now considering 681/681 (removed 0) transitions.
// Phase 1: matrix 681 rows 442 cols
[2024-05-23 07:11:59] [INFO ] Computed 23 invariants in 6 ms
[2024-05-23 07:11:59] [INFO ] Implicit Places using invariants in 529 ms returned []
[2024-05-23 07:11:59] [INFO ] Invariant cache hit.
[2024-05-23 07:12:00] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 07:12:02] [INFO ] Implicit Places using invariants and state equation in 3108 ms returned []
Implicit Place search using SMT with State Equation took 3639 ms to find 0 implicit places.
Running 671 sub problems to find dead transitions.
[2024-05-23 07:12:02] [INFO ] Invariant cache hit.
[2024-05-23 07:12:02] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/441 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-23 07:12:15] [INFO ] Deduced a trap composed of 172 places in 559 ms of which 8 ms to minimize.
[2024-05-23 07:12:16] [INFO ] Deduced a trap composed of 140 places in 578 ms of which 7 ms to minimize.
[2024-05-23 07:12:17] [INFO ] Deduced a trap composed of 133 places in 559 ms of which 7 ms to minimize.
[2024-05-23 07:12:17] [INFO ] Deduced a trap composed of 130 places in 468 ms of which 6 ms to minimize.
[2024-05-23 07:12:18] [INFO ] Deduced a trap composed of 155 places in 464 ms of which 6 ms to minimize.
[2024-05-23 07:12:19] [INFO ] Deduced a trap composed of 217 places in 538 ms of which 7 ms to minimize.
[2024-05-23 07:12:19] [INFO ] Deduced a trap composed of 138 places in 556 ms of which 7 ms to minimize.
[2024-05-23 07:12:20] [INFO ] Deduced a trap composed of 98 places in 545 ms of which 7 ms to minimize.
[2024-05-23 07:12:20] [INFO ] Deduced a trap composed of 97 places in 568 ms of which 7 ms to minimize.
[2024-05-23 07:12:21] [INFO ] Deduced a trap composed of 123 places in 595 ms of which 7 ms to minimize.
[2024-05-23 07:12:22] [INFO ] Deduced a trap composed of 171 places in 558 ms of which 7 ms to minimize.
[2024-05-23 07:12:22] [INFO ] Deduced a trap composed of 148 places in 567 ms of which 7 ms to minimize.
[2024-05-23 07:12:23] [INFO ] Deduced a trap composed of 189 places in 553 ms of which 7 ms to minimize.
[2024-05-23 07:12:23] [INFO ] Deduced a trap composed of 144 places in 554 ms of which 7 ms to minimize.
[2024-05-23 07:12:24] [INFO ] Deduced a trap composed of 175 places in 575 ms of which 7 ms to minimize.
[2024-05-23 07:12:25] [INFO ] Deduced a trap composed of 138 places in 564 ms of which 7 ms to minimize.
[2024-05-23 07:12:25] [INFO ] Deduced a trap composed of 141 places in 543 ms of which 7 ms to minimize.
[2024-05-23 07:12:26] [INFO ] Deduced a trap composed of 98 places in 536 ms of which 7 ms to minimize.
[2024-05-23 07:12:26] [INFO ] Deduced a trap composed of 171 places in 552 ms of which 7 ms to minimize.
[2024-05-23 07:12:27] [INFO ] Deduced a trap composed of 101 places in 576 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/441 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-23 07:12:31] [INFO ] Deduced a trap composed of 216 places in 477 ms of which 5 ms to minimize.
[2024-05-23 07:12:32] [INFO ] Deduced a trap composed of 123 places in 565 ms of which 8 ms to minimize.
[2024-05-23 07:12:32] [INFO ] Deduced a trap composed of 133 places in 561 ms of which 7 ms to minimize.
[2024-05-23 07:12:33] [INFO ] Deduced a trap composed of 250 places in 536 ms of which 7 ms to minimize.
[2024-05-23 07:12:33] [INFO ] Deduced a trap composed of 141 places in 535 ms of which 7 ms to minimize.
SMT process timed out in 31001ms, After SMT, problems are : Problem set: 0 solved, 671 unsolved
Search for dead transitions found 0 dead transitions in 31012ms
Finished structural reductions in LTL mode , in 1 iterations and 34666 ms. Remains : 442/442 places, 681/681 transitions.
Built C files in :
/tmp/ltsmin9577834483930306103
[2024-05-23 07:12:34] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9577834483930306103
Running compilation step : cd /tmp/ltsmin9577834483930306103;'/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 2433 ms.
Running link step : cd /tmp/ltsmin9577834483930306103;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin9577834483930306103;'/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/stateBased9298429461685550027.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 07:12:49] [INFO ] Flatten gal took : 68 ms
[2024-05-23 07:12:49] [INFO ] Flatten gal took : 67 ms
[2024-05-23 07:12:49] [INFO ] Time to serialize gal into /tmp/LTL12533774625615781507.gal : 16 ms
[2024-05-23 07:12:49] [INFO ] Time to serialize properties into /tmp/LTL4274973182576567917.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/LTL12533774625615781507.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12116603730826618725.hoa' '-atoms' '/tmp/LTL4274973182576567917.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/LTL4274973182576567917.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12116603730826618725.hoa
Detected timeout of ITS tools.
[2024-05-23 07:13:04] [INFO ] Flatten gal took : 32 ms
[2024-05-23 07:13:04] [INFO ] Flatten gal took : 32 ms
[2024-05-23 07:13:04] [INFO ] Time to serialize gal into /tmp/LTL18434001160800034778.gal : 9 ms
[2024-05-23 07:13:04] [INFO ] Time to serialize properties into /tmp/LTL6264960432959055454.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/LTL18434001160800034778.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6264960432959055454.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...276
Read 1 LTL properties
Checking formula 0 : !((((!("((slot_F.F.F.F.F.F.F.F.F.F==1)&&(cs_1_2==1))"))&&(X(X(F("((slot_F.F.F.F.F.F.F.F.F.F==1)&&(cs_1_2==1))")))))U(G(!("(((slot_F.F....208
Formula 0 simplified : ("((slot_F.F.F.F.F.F.F.F.F.F==1)&&(cs_1_2==1))" | XXG!"((slot_F.F.F.F.F.F.F.F.F.F==1)&&(cs_1_2==1))") R F"(((slot_F.F.F.F.F.F.T.F.F....189
Detected timeout of ITS tools.
[2024-05-23 07:13:19] [INFO ] Flatten gal took : 28 ms
[2024-05-23 07:13:19] [INFO ] Applying decomposition
[2024-05-23 07:13:19] [INFO ] Flatten gal took : 28 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/graph15239669904252496004.txt' '-o' '/tmp/graph15239669904252496004.bin' '-w' '/tmp/graph15239669904252496004.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15239669904252496004.bin' '-l' '-1' '-v' '-w' '/tmp/graph15239669904252496004.weights' '-q' '0' '-e' '0.001'
[2024-05-23 07:13:19] [INFO ] Decomposing Gal with order
[2024-05-23 07:13:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 07:13:20] [INFO ] Removed a total of 986 redundant transitions.
[2024-05-23 07:13:20] [INFO ] Flatten gal took : 165 ms
[2024-05-23 07:13:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 39 ms.
[2024-05-23 07:13:20] [INFO ] Time to serialize gal into /tmp/LTL4606830590101682808.gal : 19 ms
[2024-05-23 07:13:20] [INFO ] Time to serialize properties into /tmp/LTL18233474806690019561.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/LTL4606830590101682808.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18233474806690019561.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 : !((((!("((i3.u0.slot_F.F.F.F.F.F.F.F.F.F==1)&&(i3.u0.cs_1_2==1))"))&&(X(X(F("((i3.u0.slot_F.F.F.F.F.F.F.F.F.F==1)&&(i3.u0.cs_1_2==1))"...252
Formula 0 simplified : ("((i3.u0.slot_F.F.F.F.F.F.F.F.F.F==1)&&(i3.u0.cs_1_2==1))" | XXG!"((i3.u0.slot_F.F.F.F.F.F.F.F.F.F==1)&&(i3.u0.cs_1_2==1))") R F"((...233
Detected timeout of ITS tools.
Treatment of property Anderson-PT-10-LTLFireability-02 finished in 277869 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F((!p1 U (p2||G(!p1)))))))'
Support contains 6 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 443 transition count 718
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 443 transition count 718
Applied a total of 48 rules in 22 ms. Remains 443 /467 variables (removed 24) and now considering 718/1120 (removed 402) transitions.
// Phase 1: matrix 718 rows 443 cols
[2024-05-23 07:13:35] [INFO ] Computed 23 invariants in 7 ms
[2024-05-23 07:13:35] [INFO ] Implicit Places using invariants in 598 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 599 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/467 places, 718/1120 transitions.
Applied a total of 0 rules in 8 ms. Remains 442 /442 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 629 ms. Remains : 442/467 places, 718/1120 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) p1)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 389 ms.
Product exploration explored 100000 steps with 50000 reset in 395 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 p2 (NOT p1)), (X p0), (X p2), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 13 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-10-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-10-LTLFireability-03 finished in 1621 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(p1)||G(p2))))'
Support contains 5 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 443 transition count 700
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 443 transition count 700
Applied a total of 48 rules in 18 ms. Remains 443 /467 variables (removed 24) and now considering 700/1120 (removed 420) transitions.
// Phase 1: matrix 700 rows 443 cols
[2024-05-23 07:13:36] [INFO ] Computed 23 invariants in 5 ms
[2024-05-23 07:13:37] [INFO ] Implicit Places using invariants in 584 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 586 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/467 places, 700/1120 transitions.
Applied a total of 0 rules in 8 ms. Remains 442 /442 variables (removed 0) and now considering 700/700 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 612 ms. Remains : 442/467 places, 700/1120 transitions.
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 289 ms.
Product exploration explored 100000 steps with 50000 reset in 343 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 21 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-10-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-10-LTLFireability-04 finished in 1467 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(p1)&&p0)))'
Support contains 4 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 443 transition count 718
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 443 transition count 718
Applied a total of 48 rules in 32 ms. Remains 443 /467 variables (removed 24) and now considering 718/1120 (removed 402) transitions.
// Phase 1: matrix 718 rows 443 cols
[2024-05-23 07:13:38] [INFO ] Computed 23 invariants in 9 ms
[2024-05-23 07:13:39] [INFO ] Implicit Places using invariants in 1084 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1086 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/467 places, 718/1120 transitions.
Applied a total of 0 rules in 15 ms. Remains 442 /442 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1133 ms. Remains : 442/467 places, 718/1120 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-10-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Anderson-PT-10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-10-LTLFireability-05 finished in 1320 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(((p1 U p2)&&p0)) U G(p3))))))'
Support contains 8 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 445 transition count 756
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 445 transition count 756
Applied a total of 44 rules in 30 ms. Remains 445 /467 variables (removed 22) and now considering 756/1120 (removed 364) transitions.
// Phase 1: matrix 756 rows 445 cols
[2024-05-23 07:13:39] [INFO ] Computed 23 invariants in 10 ms
[2024-05-23 07:13:40] [INFO ] Implicit Places using invariants in 1059 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1061 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 444/467 places, 756/1120 transitions.
Applied a total of 0 rules in 13 ms. Remains 444 /444 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1105 ms. Remains : 444/467 places, 756/1120 transitions.
Stuttering acceptance computed with spot in 401 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), true, (NOT p2), (OR (AND (NOT p2) p3) (AND (NOT p0) p3)), (NOT p3)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-06
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-10-LTLFireability-06 finished in 1542 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||(!p0&&F(G(!p1)))))'
Support contains 6 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 467 transition count 1030
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 377 transition count 1030
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 204 place count 353 transition count 628
Iterating global reduction 0 with 24 rules applied. Total rules applied 228 place count 353 transition count 628
Applied a total of 228 rules in 59 ms. Remains 353 /467 variables (removed 114) and now considering 628/1120 (removed 492) transitions.
// Phase 1: matrix 628 rows 353 cols
[2024-05-23 07:13:41] [INFO ] Computed 23 invariants in 8 ms
[2024-05-23 07:13:42] [INFO ] Implicit Places using invariants in 994 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 996 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 352/467 places, 628/1120 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 352 transition count 530
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 196 place count 254 transition count 530
Applied a total of 196 rules in 20 ms. Remains 254 /352 variables (removed 98) and now considering 530/628 (removed 98) transitions.
// Phase 1: matrix 530 rows 254 cols
[2024-05-23 07:13:42] [INFO ] Computed 22 invariants in 10 ms
[2024-05-23 07:13:42] [INFO ] Implicit Places using invariants in 472 ms returned []
[2024-05-23 07:13:42] [INFO ] Invariant cache hit.
[2024-05-23 07:13:43] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 07:13:44] [INFO ] Implicit Places using invariants and state equation in 1507 ms returned []
Implicit Place search using SMT with State Equation took 1984 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 254/467 places, 530/1120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3060 ms. Remains : 254/467 places, 530/1120 transitions.
Stuttering acceptance computed with spot in 138 ms :[p0, true, (AND p0 p1), p1]
Running random walk in product with property : Anderson-PT-10-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 331 ms.
Product exploration explored 100000 steps with 0 reset in 403 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND p0 p1), p1]
RANDOM walk for 40000 steps (8 resets) in 524 ms. (76 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 143 ms. (277 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
[2024-05-23 07:13:45] [INFO ] Invariant cache hit.
[2024-05-23 07:13:45] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 223/227 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/245 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/254 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 07:13:46] [INFO ] Deduced a trap composed of 87 places in 332 ms of which 6 ms to minimize.
[2024-05-23 07:13:46] [INFO ] Deduced a trap composed of 87 places in 195 ms of which 3 ms to minimize.
[2024-05-23 07:13:46] [INFO ] Deduced a trap composed of 95 places in 192 ms of which 3 ms to minimize.
[2024-05-23 07:13:46] [INFO ] Deduced a trap composed of 40 places in 223 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 530/784 variables, 254/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/784 variables, 90/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/784 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/784 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 784/784 variables, and 370 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1411 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 254/254 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 223/227 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/245 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/254 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 530/784 variables, 254/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/784 variables, 90/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/784 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/784 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/784 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 784/784 variables, and 371 constraints, problems are : Problem set: 0 solved, 1 unsolved in 772 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 254/254 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 2207ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 530/530 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 254 transition count 528
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 252 transition count 528
Applied a total of 4 rules in 27 ms. Remains 252 /254 variables (removed 2) and now considering 528/530 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 252/254 places, 528/530 transitions.
RANDOM walk for 40000 steps (8 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 851673 steps, run timeout after 3001 ms. (steps per millisecond=283 ) properties seen :0 out of 1
Probabilistic random walk after 851673 steps, saw 613165 distinct states, run finished after 3001 ms. (steps per millisecond=283 ) properties seen :0
// Phase 1: matrix 528 rows 252 cols
[2024-05-23 07:13:51] [INFO ] Computed 22 invariants in 4 ms
[2024-05-23 07:13:51] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 221/225 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/233 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/251 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/252 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 07:13:51] [INFO ] Deduced a trap composed of 78 places in 203 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 528/780 variables, 252/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/780 variables, 90/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/780 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/780 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 780/780 variables, and 365 constraints, problems are : Problem set: 0 solved, 1 unsolved in 544 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 252/252 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 221/225 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/233 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/251 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/252 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 528/780 variables, 252/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/780 variables, 90/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/780 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/780 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/780 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 780/780 variables, and 366 constraints, problems are : Problem set: 0 solved, 1 unsolved in 460 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 252/252 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1019ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 528/528 transitions.
Applied a total of 0 rules in 12 ms. Remains 252 /252 variables (removed 0) and now considering 528/528 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 252/252 places, 528/528 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 528/528 transitions.
Applied a total of 0 rules in 12 ms. Remains 252 /252 variables (removed 0) and now considering 528/528 (removed 0) transitions.
[2024-05-23 07:13:52] [INFO ] Invariant cache hit.
[2024-05-23 07:13:52] [INFO ] Implicit Places using invariants in 564 ms returned []
[2024-05-23 07:13:52] [INFO ] Invariant cache hit.
[2024-05-23 07:13:53] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 07:13:54] [INFO ] Implicit Places using invariants and state equation in 1546 ms returned []
Implicit Place search using SMT with State Equation took 2112 ms to find 0 implicit places.
[2024-05-23 07:13:54] [INFO ] Redundant transitions in 9 ms returned []
Running 518 sub problems to find dead transitions.
[2024-05-23 07:13:54] [INFO ] Invariant cache hit.
[2024-05-23 07:13:54] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-23 07:14:01] [INFO ] Deduced a trap composed of 68 places in 313 ms of which 5 ms to minimize.
[2024-05-23 07:14:01] [INFO ] Deduced a trap composed of 78 places in 320 ms of which 4 ms to minimize.
[2024-05-23 07:14:02] [INFO ] Deduced a trap composed of 106 places in 256 ms of which 4 ms to minimize.
[2024-05-23 07:14:02] [INFO ] Deduced a trap composed of 89 places in 319 ms of which 4 ms to minimize.
[2024-05-23 07:14:02] [INFO ] Deduced a trap composed of 102 places in 316 ms of which 4 ms to minimize.
[2024-05-23 07:14:03] [INFO ] Deduced a trap composed of 98 places in 334 ms of which 5 ms to minimize.
[2024-05-23 07:14:03] [INFO ] Deduced a trap composed of 98 places in 233 ms of which 3 ms to minimize.
[2024-05-23 07:14:03] [INFO ] Deduced a trap composed of 99 places in 264 ms of which 4 ms to minimize.
[2024-05-23 07:14:03] [INFO ] Deduced a trap composed of 104 places in 320 ms of which 4 ms to minimize.
[2024-05-23 07:14:04] [INFO ] Deduced a trap composed of 98 places in 328 ms of which 4 ms to minimize.
[2024-05-23 07:14:04] [INFO ] Deduced a trap composed of 89 places in 221 ms of which 3 ms to minimize.
[2024-05-23 07:14:06] [INFO ] Deduced a trap composed of 95 places in 328 ms of which 5 ms to minimize.
[2024-05-23 07:14:06] [INFO ] Deduced a trap composed of 83 places in 273 ms of which 4 ms to minimize.
[2024-05-23 07:14:06] [INFO ] Deduced a trap composed of 76 places in 276 ms of which 4 ms to minimize.
[2024-05-23 07:14:07] [INFO ] Deduced a trap composed of 70 places in 280 ms of which 4 ms to minimize.
[2024-05-23 07:14:07] [INFO ] Deduced a trap composed of 61 places in 282 ms of which 4 ms to minimize.
[2024-05-23 07:14:07] [INFO ] Deduced a trap composed of 88 places in 270 ms of which 4 ms to minimize.
[2024-05-23 07:14:08] [INFO ] Deduced a trap composed of 66 places in 277 ms of which 4 ms to minimize.
[2024-05-23 07:14:08] [INFO ] Deduced a trap composed of 66 places in 253 ms of which 4 ms to minimize.
[2024-05-23 07:14:08] [INFO ] Deduced a trap composed of 80 places in 276 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-23 07:14:10] [INFO ] Deduced a trap composed of 72 places in 296 ms of which 4 ms to minimize.
[2024-05-23 07:14:11] [INFO ] Deduced a trap composed of 107 places in 319 ms of which 4 ms to minimize.
[2024-05-23 07:14:11] [INFO ] Deduced a trap composed of 102 places in 317 ms of which 5 ms to minimize.
[2024-05-23 07:14:11] [INFO ] Deduced a trap composed of 82 places in 321 ms of which 5 ms to minimize.
[2024-05-23 07:14:12] [INFO ] Deduced a trap composed of 82 places in 314 ms of which 4 ms to minimize.
[2024-05-23 07:14:12] [INFO ] Deduced a trap composed of 73 places in 318 ms of which 5 ms to minimize.
[2024-05-23 07:14:14] [INFO ] Deduced a trap composed of 54 places in 328 ms of which 5 ms to minimize.
[2024-05-23 07:14:14] [INFO ] Deduced a trap composed of 60 places in 333 ms of which 5 ms to minimize.
[2024-05-23 07:14:14] [INFO ] Deduced a trap composed of 60 places in 338 ms of which 5 ms to minimize.
[2024-05-23 07:14:15] [INFO ] Deduced a trap composed of 64 places in 327 ms of which 7 ms to minimize.
[2024-05-23 07:14:15] [INFO ] Deduced a trap composed of 56 places in 329 ms of which 4 ms to minimize.
[2024-05-23 07:14:15] [INFO ] Deduced a trap composed of 63 places in 335 ms of which 4 ms to minimize.
[2024-05-23 07:14:16] [INFO ] Deduced a trap composed of 44 places in 327 ms of which 4 ms to minimize.
[2024-05-23 07:14:16] [INFO ] Deduced a trap composed of 71 places in 298 ms of which 5 ms to minimize.
[2024-05-23 07:14:16] [INFO ] Deduced a trap composed of 76 places in 325 ms of which 4 ms to minimize.
[2024-05-23 07:14:17] [INFO ] Deduced a trap composed of 99 places in 322 ms of which 5 ms to minimize.
[2024-05-23 07:14:17] [INFO ] Deduced a trap composed of 87 places in 272 ms of which 4 ms to minimize.
[2024-05-23 07:14:17] [INFO ] Deduced a trap composed of 98 places in 325 ms of which 5 ms to minimize.
[2024-05-23 07:14:18] [INFO ] Deduced a trap composed of 112 places in 326 ms of which 4 ms to minimize.
[2024-05-23 07:14:18] [INFO ] Deduced a trap composed of 67 places in 283 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 252/780 variables, and 62 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/252 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 518 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-23 07:14:29] [INFO ] Deduced a trap composed of 63 places in 359 ms of which 4 ms to minimize.
[2024-05-23 07:14:30] [INFO ] Deduced a trap composed of 59 places in 331 ms of which 4 ms to minimize.
[2024-05-23 07:14:30] [INFO ] Deduced a trap composed of 72 places in 335 ms of which 5 ms to minimize.
[2024-05-23 07:14:31] [INFO ] Deduced a trap composed of 68 places in 331 ms of which 4 ms to minimize.
[2024-05-23 07:14:32] [INFO ] Deduced a trap composed of 77 places in 335 ms of which 5 ms to minimize.
[2024-05-23 07:14:32] [INFO ] Deduced a trap composed of 100 places in 313 ms of which 4 ms to minimize.
[2024-05-23 07:14:32] [INFO ] Deduced a trap composed of 75 places in 356 ms of which 4 ms to minimize.
[2024-05-23 07:14:33] [INFO ] Deduced a trap composed of 97 places in 343 ms of which 4 ms to minimize.
[2024-05-23 07:14:33] [INFO ] Deduced a trap composed of 62 places in 338 ms of which 5 ms to minimize.
[2024-05-23 07:14:33] [INFO ] Deduced a trap composed of 67 places in 332 ms of which 4 ms to minimize.
[2024-05-23 07:14:34] [INFO ] Deduced a trap composed of 90 places in 352 ms of which 4 ms to minimize.
[2024-05-23 07:14:34] [INFO ] Deduced a trap composed of 77 places in 347 ms of which 5 ms to minimize.
[2024-05-23 07:14:35] [INFO ] Deduced a trap composed of 72 places in 353 ms of which 5 ms to minimize.
[2024-05-23 07:14:35] [INFO ] Deduced a trap composed of 64 places in 348 ms of which 5 ms to minimize.
[2024-05-23 07:14:35] [INFO ] Deduced a trap composed of 106 places in 339 ms of which 4 ms to minimize.
[2024-05-23 07:14:36] [INFO ] Deduced a trap composed of 62 places in 313 ms of which 4 ms to minimize.
[2024-05-23 07:14:36] [INFO ] Deduced a trap composed of 69 places in 350 ms of which 5 ms to minimize.
[2024-05-23 07:14:36] [INFO ] Deduced a trap composed of 104 places in 341 ms of which 5 ms to minimize.
[2024-05-23 07:14:37] [INFO ] Deduced a trap composed of 77 places in 349 ms of which 5 ms to minimize.
[2024-05-23 07:14:37] [INFO ] Deduced a trap composed of 86 places in 346 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 252/780 variables, and 82 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/252 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/518 constraints, Known Traps: 60/60 constraints]
After SMT, in 60649ms problems are : Problem set: 0 solved, 518 unsolved
Search for dead transitions found 0 dead transitions in 60659ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62802 ms. Remains : 252/252 places, 528/528 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 100 Pre rules applied. Total rules applied 0 place count 252 transition count 428
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 152 transition count 428
Applied a total of 200 rules in 11 ms. Remains 152 /252 variables (removed 100) and now considering 428/528 (removed 100) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 428 rows 152 cols
[2024-05-23 07:14:54] [INFO ] Computed 22 invariants in 5 ms
[2024-05-23 07:14:54] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2024-05-23 07:14:54] [INFO ] [Real]Absence check using 13 positive and 9 generalized place invariants in 13 ms returned sat
[2024-05-23 07:14:55] [INFO ] After 282ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 07:14:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 22 ms returned sat
[2024-05-23 07:14:55] [INFO ] [Nat]Absence check using 13 positive and 9 generalized place invariants in 21 ms returned sat
[2024-05-23 07:14:55] [INFO ] After 292ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 07:14:55] [INFO ] After 356ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 07:14:55] [INFO ] After 495ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 814 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 165 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND p0 p1), p1]
Stuttering acceptance computed with spot in 104 ms :[(AND p0 p1), p1]
Support contains 6 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 530/530 transitions.
Applied a total of 0 rules in 14 ms. Remains 254 /254 variables (removed 0) and now considering 530/530 (removed 0) transitions.
// Phase 1: matrix 530 rows 254 cols
[2024-05-23 07:14:56] [INFO ] Computed 22 invariants in 5 ms
[2024-05-23 07:14:56] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-05-23 07:14:56] [INFO ] Invariant cache hit.
[2024-05-23 07:14:56] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 07:14:57] [INFO ] Implicit Places using invariants and state equation in 1235 ms returned []
Implicit Place search using SMT with State Equation took 1649 ms to find 0 implicit places.
[2024-05-23 07:14:57] [INFO ] Redundant transitions in 5 ms returned []
Running 520 sub problems to find dead transitions.
[2024-05-23 07:14:57] [INFO ] Invariant cache hit.
[2024-05-23 07:14:57] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-05-23 07:15:05] [INFO ] Deduced a trap composed of 94 places in 341 ms of which 5 ms to minimize.
[2024-05-23 07:15:06] [INFO ] Deduced a trap composed of 49 places in 263 ms of which 4 ms to minimize.
[2024-05-23 07:15:07] [INFO ] Deduced a trap composed of 85 places in 358 ms of which 4 ms to minimize.
[2024-05-23 07:15:07] [INFO ] Deduced a trap composed of 78 places in 335 ms of which 4 ms to minimize.
[2024-05-23 07:15:08] [INFO ] Deduced a trap composed of 69 places in 326 ms of which 5 ms to minimize.
[2024-05-23 07:15:08] [INFO ] Deduced a trap composed of 75 places in 334 ms of which 5 ms to minimize.
[2024-05-23 07:15:08] [INFO ] Deduced a trap composed of 59 places in 343 ms of which 5 ms to minimize.
[2024-05-23 07:15:09] [INFO ] Deduced a trap composed of 61 places in 330 ms of which 5 ms to minimize.
[2024-05-23 07:15:09] [INFO ] Deduced a trap composed of 112 places in 358 ms of which 4 ms to minimize.
[2024-05-23 07:15:09] [INFO ] Deduced a trap composed of 92 places in 347 ms of which 5 ms to minimize.
[2024-05-23 07:15:10] [INFO ] Deduced a trap composed of 81 places in 341 ms of which 4 ms to minimize.
[2024-05-23 07:15:10] [INFO ] Deduced a trap composed of 83 places in 350 ms of which 4 ms to minimize.
[2024-05-23 07:15:11] [INFO ] Deduced a trap composed of 67 places in 345 ms of which 4 ms to minimize.
[2024-05-23 07:15:11] [INFO ] Deduced a trap composed of 89 places in 348 ms of which 5 ms to minimize.
[2024-05-23 07:15:11] [INFO ] Deduced a trap composed of 89 places in 348 ms of which 5 ms to minimize.
[2024-05-23 07:15:12] [INFO ] Deduced a trap composed of 109 places in 349 ms of which 5 ms to minimize.
[2024-05-23 07:15:12] [INFO ] Deduced a trap composed of 90 places in 345 ms of which 5 ms to minimize.
[2024-05-23 07:15:12] [INFO ] Deduced a trap composed of 76 places in 343 ms of which 4 ms to minimize.
[2024-05-23 07:15:13] [INFO ] Deduced a trap composed of 99 places in 339 ms of which 4 ms to minimize.
[2024-05-23 07:15:13] [INFO ] Deduced a trap composed of 71 places in 336 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-05-23 07:15:15] [INFO ] Deduced a trap composed of 83 places in 336 ms of which 4 ms to minimize.
[2024-05-23 07:15:16] [INFO ] Deduced a trap composed of 78 places in 327 ms of which 4 ms to minimize.
[2024-05-23 07:15:16] [INFO ] Deduced a trap composed of 82 places in 339 ms of which 4 ms to minimize.
[2024-05-23 07:15:17] [INFO ] Deduced a trap composed of 110 places in 336 ms of which 5 ms to minimize.
[2024-05-23 07:15:17] [INFO ] Deduced a trap composed of 106 places in 343 ms of which 4 ms to minimize.
[2024-05-23 07:15:17] [INFO ] Deduced a trap composed of 68 places in 333 ms of which 4 ms to minimize.
[2024-05-23 07:15:20] [INFO ] Deduced a trap composed of 105 places in 356 ms of which 4 ms to minimize.
[2024-05-23 07:15:20] [INFO ] Deduced a trap composed of 83 places in 347 ms of which 4 ms to minimize.
[2024-05-23 07:15:21] [INFO ] Deduced a trap composed of 99 places in 348 ms of which 5 ms to minimize.
[2024-05-23 07:15:21] [INFO ] Deduced a trap composed of 73 places in 350 ms of which 5 ms to minimize.
[2024-05-23 07:15:22] [INFO ] Deduced a trap composed of 77 places in 336 ms of which 4 ms to minimize.
[2024-05-23 07:15:22] [INFO ] Deduced a trap composed of 75 places in 352 ms of which 5 ms to minimize.
[2024-05-23 07:15:22] [INFO ] Deduced a trap composed of 81 places in 345 ms of which 4 ms to minimize.
[2024-05-23 07:15:23] [INFO ] Deduced a trap composed of 94 places in 352 ms of which 4 ms to minimize.
[2024-05-23 07:15:23] [INFO ] Deduced a trap composed of 63 places in 355 ms of which 5 ms to minimize.
[2024-05-23 07:15:23] [INFO ] Deduced a trap composed of 98 places in 348 ms of which 4 ms to minimize.
[2024-05-23 07:15:24] [INFO ] Deduced a trap composed of 87 places in 285 ms of which 4 ms to minimize.
[2024-05-23 07:15:24] [INFO ] Deduced a trap composed of 106 places in 355 ms of which 5 ms to minimize.
[2024-05-23 07:15:25] [INFO ] Deduced a trap composed of 89 places in 349 ms of which 4 ms to minimize.
[2024-05-23 07:15:25] [INFO ] Deduced a trap composed of 89 places in 336 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 254/784 variables, and 62 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/254 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 520/520 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 520 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 254/784 variables, and 62 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/254 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/520 constraints, Known Traps: 40/40 constraints]
After SMT, in 60814ms problems are : Problem set: 0 solved, 520 unsolved
Search for dead transitions found 0 dead transitions in 60825ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62502 ms. Remains : 254/254 places, 530/530 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 81 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND p0 p1), p1]
RANDOM walk for 40000 steps (8 resets) in 183 ms. (217 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 59 ms. (666 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
[2024-05-23 07:15:58] [INFO ] Invariant cache hit.
[2024-05-23 07:15:58] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 223/227 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/245 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/254 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 07:15:59] [INFO ] Deduced a trap composed of 87 places in 301 ms of which 4 ms to minimize.
[2024-05-23 07:15:59] [INFO ] Deduced a trap composed of 87 places in 358 ms of which 4 ms to minimize.
[2024-05-23 07:16:00] [INFO ] Deduced a trap composed of 95 places in 328 ms of which 4 ms to minimize.
[2024-05-23 07:16:00] [INFO ] Deduced a trap composed of 40 places in 326 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 530/784 variables, 254/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/784 variables, 90/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/784 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/784 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 784/784 variables, and 370 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1901 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 254/254 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 223/227 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/245 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/254 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 530/784 variables, 254/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/784 variables, 90/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/784 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/784 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/784 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 784/784 variables, and 371 constraints, problems are : Problem set: 0 solved, 1 unsolved in 744 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 254/254 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 2663ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 530/530 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 254 transition count 528
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 252 transition count 528
Applied a total of 4 rules in 27 ms. Remains 252 /254 variables (removed 2) and now considering 528/530 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 252/254 places, 528/530 transitions.
RANDOM walk for 40000 steps (8 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 753398 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :0 out of 1
Probabilistic random walk after 753398 steps, saw 543969 distinct states, run finished after 3001 ms. (steps per millisecond=251 ) properties seen :0
// Phase 1: matrix 528 rows 252 cols
[2024-05-23 07:16:04] [INFO ] Computed 22 invariants in 5 ms
[2024-05-23 07:16:04] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 221/225 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/233 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/251 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/252 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 07:16:05] [INFO ] Deduced a trap composed of 78 places in 224 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 528/780 variables, 252/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/780 variables, 90/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/780 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/780 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 780/780 variables, and 365 constraints, problems are : Problem set: 0 solved, 1 unsolved in 694 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 252/252 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 221/225 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/233 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/251 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/252 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 528/780 variables, 252/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/780 variables, 90/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/780 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/780 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/780 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 780/780 variables, and 366 constraints, problems are : Problem set: 0 solved, 1 unsolved in 595 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 252/252 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1306ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 528/528 transitions.
Applied a total of 0 rules in 15 ms. Remains 252 /252 variables (removed 0) and now considering 528/528 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 252/252 places, 528/528 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 528/528 transitions.
Applied a total of 0 rules in 12 ms. Remains 252 /252 variables (removed 0) and now considering 528/528 (removed 0) transitions.
[2024-05-23 07:16:06] [INFO ] Invariant cache hit.
[2024-05-23 07:16:06] [INFO ] Implicit Places using invariants in 538 ms returned []
[2024-05-23 07:16:06] [INFO ] Invariant cache hit.
[2024-05-23 07:16:06] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 07:16:08] [INFO ] Implicit Places using invariants and state equation in 1537 ms returned []
Implicit Place search using SMT with State Equation took 2079 ms to find 0 implicit places.
[2024-05-23 07:16:08] [INFO ] Redundant transitions in 5 ms returned []
Running 518 sub problems to find dead transitions.
[2024-05-23 07:16:08] [INFO ] Invariant cache hit.
[2024-05-23 07:16:08] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-23 07:16:14] [INFO ] Deduced a trap composed of 68 places in 228 ms of which 3 ms to minimize.
[2024-05-23 07:16:15] [INFO ] Deduced a trap composed of 78 places in 334 ms of which 5 ms to minimize.
[2024-05-23 07:16:15] [INFO ] Deduced a trap composed of 106 places in 326 ms of which 5 ms to minimize.
[2024-05-23 07:16:15] [INFO ] Deduced a trap composed of 89 places in 228 ms of which 3 ms to minimize.
[2024-05-23 07:16:15] [INFO ] Deduced a trap composed of 102 places in 335 ms of which 5 ms to minimize.
[2024-05-23 07:16:16] [INFO ] Deduced a trap composed of 98 places in 335 ms of which 5 ms to minimize.
[2024-05-23 07:16:16] [INFO ] Deduced a trap composed of 98 places in 230 ms of which 3 ms to minimize.
[2024-05-23 07:16:16] [INFO ] Deduced a trap composed of 99 places in 271 ms of which 4 ms to minimize.
[2024-05-23 07:16:17] [INFO ] Deduced a trap composed of 104 places in 334 ms of which 4 ms to minimize.
[2024-05-23 07:16:17] [INFO ] Deduced a trap composed of 98 places in 312 ms of which 4 ms to minimize.
[2024-05-23 07:16:17] [INFO ] Deduced a trap composed of 89 places in 281 ms of which 4 ms to minimize.
[2024-05-23 07:16:19] [INFO ] Deduced a trap composed of 95 places in 340 ms of which 4 ms to minimize.
[2024-05-23 07:16:19] [INFO ] Deduced a trap composed of 83 places in 265 ms of which 3 ms to minimize.
[2024-05-23 07:16:20] [INFO ] Deduced a trap composed of 76 places in 341 ms of which 5 ms to minimize.
[2024-05-23 07:16:20] [INFO ] Deduced a trap composed of 70 places in 342 ms of which 4 ms to minimize.
[2024-05-23 07:16:20] [INFO ] Deduced a trap composed of 61 places in 342 ms of which 4 ms to minimize.
[2024-05-23 07:16:21] [INFO ] Deduced a trap composed of 88 places in 334 ms of which 4 ms to minimize.
[2024-05-23 07:16:21] [INFO ] Deduced a trap composed of 66 places in 246 ms of which 3 ms to minimize.
[2024-05-23 07:16:21] [INFO ] Deduced a trap composed of 66 places in 352 ms of which 5 ms to minimize.
[2024-05-23 07:16:22] [INFO ] Deduced a trap composed of 80 places in 343 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-23 07:16:23] [INFO ] Deduced a trap composed of 72 places in 337 ms of which 4 ms to minimize.
[2024-05-23 07:16:24] [INFO ] Deduced a trap composed of 107 places in 334 ms of which 5 ms to minimize.
[2024-05-23 07:16:24] [INFO ] Deduced a trap composed of 102 places in 341 ms of which 5 ms to minimize.
[2024-05-23 07:16:25] [INFO ] Deduced a trap composed of 82 places in 332 ms of which 4 ms to minimize.
[2024-05-23 07:16:25] [INFO ] Deduced a trap composed of 82 places in 329 ms of which 5 ms to minimize.
[2024-05-23 07:16:25] [INFO ] Deduced a trap composed of 73 places in 329 ms of which 4 ms to minimize.
[2024-05-23 07:16:27] [INFO ] Deduced a trap composed of 54 places in 269 ms of which 4 ms to minimize.
[2024-05-23 07:16:27] [INFO ] Deduced a trap composed of 60 places in 328 ms of which 4 ms to minimize.
[2024-05-23 07:16:27] [INFO ] Deduced a trap composed of 60 places in 338 ms of which 5 ms to minimize.
[2024-05-23 07:16:27] [INFO ] Deduced a trap composed of 64 places in 219 ms of which 3 ms to minimize.
[2024-05-23 07:16:28] [INFO ] Deduced a trap composed of 56 places in 285 ms of which 4 ms to minimize.
[2024-05-23 07:16:28] [INFO ] Deduced a trap composed of 63 places in 281 ms of which 4 ms to minimize.
[2024-05-23 07:16:28] [INFO ] Deduced a trap composed of 44 places in 286 ms of which 4 ms to minimize.
[2024-05-23 07:16:29] [INFO ] Deduced a trap composed of 71 places in 226 ms of which 3 ms to minimize.
[2024-05-23 07:16:29] [INFO ] Deduced a trap composed of 76 places in 221 ms of which 3 ms to minimize.
[2024-05-23 07:16:29] [INFO ] Deduced a trap composed of 99 places in 239 ms of which 3 ms to minimize.
[2024-05-23 07:16:30] [INFO ] Deduced a trap composed of 87 places in 333 ms of which 4 ms to minimize.
[2024-05-23 07:16:30] [INFO ] Deduced a trap composed of 98 places in 248 ms of which 4 ms to minimize.
[2024-05-23 07:16:30] [INFO ] Deduced a trap composed of 112 places in 226 ms of which 3 ms to minimize.
[2024-05-23 07:16:30] [INFO ] Deduced a trap composed of 67 places in 250 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-23 07:16:37] [INFO ] Deduced a trap composed of 67 places in 342 ms of which 4 ms to minimize.
[2024-05-23 07:16:37] [INFO ] Deduced a trap composed of 76 places in 331 ms of which 4 ms to minimize.
[2024-05-23 07:16:38] [INFO ] Deduced a trap composed of 102 places in 358 ms of which 5 ms to minimize.
[2024-05-23 07:16:38] [INFO ] Deduced a trap composed of 101 places in 348 ms of which 4 ms to minimize.
[2024-05-23 07:16:38] [INFO ] Deduced a trap composed of 94 places in 328 ms of which 5 ms to minimize.
SMT process timed out in 30695ms, After SMT, problems are : Problem set: 0 solved, 518 unsolved
Search for dead transitions found 0 dead transitions in 30706ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32809 ms. Remains : 252/252 places, 528/528 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 100 Pre rules applied. Total rules applied 0 place count 252 transition count 428
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 152 transition count 428
Applied a total of 200 rules in 17 ms. Remains 152 /252 variables (removed 100) and now considering 428/528 (removed 100) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 428 rows 152 cols
[2024-05-23 07:16:38] [INFO ] Computed 22 invariants in 4 ms
[2024-05-23 07:16:38] [INFO ] [Real]Absence check using 13 positive place invariants in 20 ms returned sat
[2024-05-23 07:16:38] [INFO ] [Real]Absence check using 13 positive and 9 generalized place invariants in 18 ms returned sat
[2024-05-23 07:16:39] [INFO ] After 393ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 07:16:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 23 ms returned sat
[2024-05-23 07:16:39] [INFO ] [Nat]Absence check using 13 positive and 9 generalized place invariants in 20 ms returned sat
[2024-05-23 07:16:39] [INFO ] After 286ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 07:16:39] [INFO ] After 348ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 07:16:39] [INFO ] After 497ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 920 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 149 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND p0 p1), p1]
Stuttering acceptance computed with spot in 92 ms :[(AND p0 p1), p1]
Stuttering acceptance computed with spot in 84 ms :[(AND p0 p1), p1]
Product exploration explored 100000 steps with 0 reset in 337 ms.
Product exploration explored 100000 steps with 0 reset in 370 ms.
Built C files in :
/tmp/ltsmin14563778269331958832
[2024-05-23 07:16:40] [INFO ] Computing symmetric may disable matrix : 530 transitions.
[2024-05-23 07:16:40] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 07:16:40] [INFO ] Computing symmetric may enable matrix : 530 transitions.
[2024-05-23 07:16:40] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 07:16:41] [INFO ] Computing Do-Not-Accords matrix : 530 transitions.
[2024-05-23 07:16:41] [INFO ] Computation of Completed DNA matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 07:16:41] [INFO ] Built C files in 184ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14563778269331958832
Running compilation step : cd /tmp/ltsmin14563778269331958832;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14563778269331958832;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14563778269331958832;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 6 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 530/530 transitions.
Applied a total of 0 rules in 7 ms. Remains 254 /254 variables (removed 0) and now considering 530/530 (removed 0) transitions.
// Phase 1: matrix 530 rows 254 cols
[2024-05-23 07:16:44] [INFO ] Computed 22 invariants in 3 ms
[2024-05-23 07:16:44] [INFO ] Implicit Places using invariants in 561 ms returned []
[2024-05-23 07:16:44] [INFO ] Invariant cache hit.
[2024-05-23 07:16:45] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 07:16:46] [INFO ] Implicit Places using invariants and state equation in 1576 ms returned []
Implicit Place search using SMT with State Equation took 2139 ms to find 0 implicit places.
[2024-05-23 07:16:46] [INFO ] Redundant transitions in 5 ms returned []
Running 520 sub problems to find dead transitions.
[2024-05-23 07:16:46] [INFO ] Invariant cache hit.
[2024-05-23 07:16:46] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-05-23 07:16:53] [INFO ] Deduced a trap composed of 94 places in 347 ms of which 5 ms to minimize.
[2024-05-23 07:16:54] [INFO ] Deduced a trap composed of 49 places in 220 ms of which 3 ms to minimize.
[2024-05-23 07:16:54] [INFO ] Deduced a trap composed of 85 places in 221 ms of which 3 ms to minimize.
[2024-05-23 07:16:55] [INFO ] Deduced a trap composed of 78 places in 346 ms of which 5 ms to minimize.
[2024-05-23 07:16:55] [INFO ] Deduced a trap composed of 69 places in 194 ms of which 3 ms to minimize.
[2024-05-23 07:16:55] [INFO ] Deduced a trap composed of 75 places in 214 ms of which 3 ms to minimize.
[2024-05-23 07:16:56] [INFO ] Deduced a trap composed of 59 places in 335 ms of which 4 ms to minimize.
[2024-05-23 07:16:56] [INFO ] Deduced a trap composed of 61 places in 225 ms of which 3 ms to minimize.
[2024-05-23 07:16:56] [INFO ] Deduced a trap composed of 112 places in 282 ms of which 4 ms to minimize.
[2024-05-23 07:16:57] [INFO ] Deduced a trap composed of 92 places in 281 ms of which 4 ms to minimize.
[2024-05-23 07:16:57] [INFO ] Deduced a trap composed of 81 places in 279 ms of which 4 ms to minimize.
[2024-05-23 07:16:57] [INFO ] Deduced a trap composed of 83 places in 277 ms of which 5 ms to minimize.
[2024-05-23 07:16:57] [INFO ] Deduced a trap composed of 67 places in 279 ms of which 4 ms to minimize.
[2024-05-23 07:16:58] [INFO ] Deduced a trap composed of 89 places in 281 ms of which 5 ms to minimize.
[2024-05-23 07:16:58] [INFO ] Deduced a trap composed of 89 places in 259 ms of which 4 ms to minimize.
[2024-05-23 07:16:58] [INFO ] Deduced a trap composed of 109 places in 268 ms of which 4 ms to minimize.
[2024-05-23 07:16:59] [INFO ] Deduced a trap composed of 90 places in 280 ms of which 4 ms to minimize.
[2024-05-23 07:16:59] [INFO ] Deduced a trap composed of 76 places in 278 ms of which 4 ms to minimize.
[2024-05-23 07:16:59] [INFO ] Deduced a trap composed of 99 places in 261 ms of which 3 ms to minimize.
[2024-05-23 07:16:59] [INFO ] Deduced a trap composed of 71 places in 349 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-05-23 07:17:02] [INFO ] Deduced a trap composed of 83 places in 346 ms of which 4 ms to minimize.
[2024-05-23 07:17:02] [INFO ] Deduced a trap composed of 78 places in 333 ms of which 4 ms to minimize.
[2024-05-23 07:17:03] [INFO ] Deduced a trap composed of 82 places in 337 ms of which 4 ms to minimize.
[2024-05-23 07:17:03] [INFO ] Deduced a trap composed of 110 places in 330 ms of which 4 ms to minimize.
[2024-05-23 07:17:03] [INFO ] Deduced a trap composed of 106 places in 239 ms of which 4 ms to minimize.
[2024-05-23 07:17:04] [INFO ] Deduced a trap composed of 68 places in 210 ms of which 2 ms to minimize.
[2024-05-23 07:17:06] [INFO ] Deduced a trap composed of 105 places in 284 ms of which 4 ms to minimize.
[2024-05-23 07:17:06] [INFO ] Deduced a trap composed of 83 places in 274 ms of which 4 ms to minimize.
[2024-05-23 07:17:06] [INFO ] Deduced a trap composed of 99 places in 281 ms of which 4 ms to minimize.
[2024-05-23 07:17:07] [INFO ] Deduced a trap composed of 73 places in 362 ms of which 5 ms to minimize.
[2024-05-23 07:17:07] [INFO ] Deduced a trap composed of 77 places in 282 ms of which 4 ms to minimize.
[2024-05-23 07:17:07] [INFO ] Deduced a trap composed of 75 places in 281 ms of which 4 ms to minimize.
[2024-05-23 07:17:08] [INFO ] Deduced a trap composed of 81 places in 337 ms of which 4 ms to minimize.
[2024-05-23 07:17:08] [INFO ] Deduced a trap composed of 94 places in 209 ms of which 3 ms to minimize.
[2024-05-23 07:17:08] [INFO ] Deduced a trap composed of 63 places in 223 ms of which 3 ms to minimize.
[2024-05-23 07:17:09] [INFO ] Deduced a trap composed of 98 places in 356 ms of which 5 ms to minimize.
[2024-05-23 07:17:09] [INFO ] Deduced a trap composed of 87 places in 336 ms of which 4 ms to minimize.
[2024-05-23 07:17:09] [INFO ] Deduced a trap composed of 106 places in 232 ms of which 3 ms to minimize.
[2024-05-23 07:17:10] [INFO ] Deduced a trap composed of 89 places in 365 ms of which 5 ms to minimize.
[2024-05-23 07:17:10] [INFO ] Deduced a trap composed of 89 places in 295 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 254/784 variables, and 62 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/254 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 520/520 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 520 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 254/784 variables, and 62 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/254 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/520 constraints, Known Traps: 40/40 constraints]
After SMT, in 60651ms problems are : Problem set: 0 solved, 520 unsolved
Search for dead transitions found 0 dead transitions in 60661ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62822 ms. Remains : 254/254 places, 530/530 transitions.
Built C files in :
/tmp/ltsmin14764456080755648210
[2024-05-23 07:17:47] [INFO ] Computing symmetric may disable matrix : 530 transitions.
[2024-05-23 07:17:47] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 07:17:47] [INFO ] Computing symmetric may enable matrix : 530 transitions.
[2024-05-23 07:17:47] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 07:17:47] [INFO ] Computing Do-Not-Accords matrix : 530 transitions.
[2024-05-23 07:17:47] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 07:17:47] [INFO ] Built C files in 77ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14764456080755648210
Running compilation step : cd /tmp/ltsmin14764456080755648210;'/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 2631 ms.
Running link step : cd /tmp/ltsmin14764456080755648210;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin14764456080755648210;'/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/stateBased10862006527403817584.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 07:18:02] [INFO ] Flatten gal took : 22 ms
[2024-05-23 07:18:02] [INFO ] Flatten gal took : 19 ms
[2024-05-23 07:18:02] [INFO ] Time to serialize gal into /tmp/LTL10493887996593367290.gal : 5 ms
[2024-05-23 07:18:02] [INFO ] Time to serialize properties into /tmp/LTL8737378647126938361.prop : 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/LTL10493887996593367290.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12869054935729477178.hoa' '-atoms' '/tmp/LTL8737378647126938361.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/LTL8737378647126938361.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12869054935729477178.hoa
Detected timeout of ITS tools.
[2024-05-23 07:18:17] [INFO ] Flatten gal took : 19 ms
[2024-05-23 07:18:17] [INFO ] Flatten gal took : 22 ms
[2024-05-23 07:18:17] [INFO ] Time to serialize gal into /tmp/LTL3277828420382054087.gal : 5 ms
[2024-05-23 07:18:17] [INFO ] Time to serialize properties into /tmp/LTL1615726303267526670.ltl : 2 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/LTL3277828420382054087.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1615726303267526670.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("((((next_8==1)&&(ncs_5_7==1))||(next_18!=1))||(ncs_9_3!=1))"))||(F(G("((next_16!=1)||(p1_3_9!=1))")))))
Formula 0 simplified : F!"((((next_8==1)&&(ncs_5_7==1))||(next_18!=1))||(ncs_9_3!=1))" & GF!"((next_16!=1)||(p1_3_9!=1))"
Detected timeout of ITS tools.
[2024-05-23 07:18:32] [INFO ] Flatten gal took : 20 ms
[2024-05-23 07:18:32] [INFO ] Applying decomposition
[2024-05-23 07:18:32] [INFO ] Flatten gal took : 20 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/graph7387708386358579202.txt' '-o' '/tmp/graph7387708386358579202.bin' '-w' '/tmp/graph7387708386358579202.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7387708386358579202.bin' '-l' '-1' '-v' '-w' '/tmp/graph7387708386358579202.weights' '-q' '0' '-e' '0.001'
[2024-05-23 07:18:32] [INFO ] Decomposing Gal with order
[2024-05-23 07:18:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 07:18:32] [INFO ] Removed a total of 955 redundant transitions.
[2024-05-23 07:18:32] [INFO ] Flatten gal took : 48 ms
[2024-05-23 07:18:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 128 labels/synchronizations in 25 ms.
[2024-05-23 07:18:32] [INFO ] Time to serialize gal into /tmp/LTL10242895780458958886.gal : 5 ms
[2024-05-23 07:18:32] [INFO ] Time to serialize properties into /tmp/LTL2505458006158139701.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/LTL10242895780458958886.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2505458006158139701.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("((((i3.i1.u7.next_8==1)&&(i4.u13.ncs_5_7==1))||(i3.i1.u12.next_18!=1))||(i3.i0.u39.ncs_9_3!=1))"))||(F(G("((i3.i1.u11.next_16!=...187
Formula 0 simplified : F!"((((i3.i1.u7.next_8==1)&&(i4.u13.ncs_5_7==1))||(i3.i1.u12.next_18!=1))||(i3.i0.u39.ncs_9_3!=1))" & GF!"((i3.i1.u11.next_16!=1)||(...177
Detected timeout of ITS tools.
Treatment of property Anderson-PT-10-LTLFireability-08 finished in 306357 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 467 transition count 1030
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 377 transition count 1030
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 205 place count 352 transition count 609
Iterating global reduction 0 with 25 rules applied. Total rules applied 230 place count 352 transition count 609
Applied a total of 230 rules in 26 ms. Remains 352 /467 variables (removed 115) and now considering 609/1120 (removed 511) transitions.
// Phase 1: matrix 609 rows 352 cols
[2024-05-23 07:18:47] [INFO ] Computed 23 invariants in 5 ms
[2024-05-23 07:18:48] [INFO ] Implicit Places using invariants in 879 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 SI_LTL mode, iteration 1 : 351/467 places, 609/1120 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 351 transition count 510
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 252 transition count 510
Applied a total of 198 rules in 13 ms. Remains 252 /351 variables (removed 99) and now considering 510/609 (removed 99) transitions.
// Phase 1: matrix 510 rows 252 cols
[2024-05-23 07:18:48] [INFO ] Computed 22 invariants in 5 ms
[2024-05-23 07:18:49] [INFO ] Implicit Places using invariants in 545 ms returned []
[2024-05-23 07:18:49] [INFO ] Invariant cache hit.
[2024-05-23 07:18:49] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 07:18:50] [INFO ] Implicit Places using invariants and state equation in 1448 ms returned []
Implicit Place search using SMT with State Equation took 1994 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 252/467 places, 510/1120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2913 ms. Remains : 252/467 places, 510/1120 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 260 ms.
Stack based approach found an accepted trace after 123 steps with 0 reset with depth 124 and stack size 124 in 0 ms.
FORMULA Anderson-PT-10-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-09 finished in 3248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 467 transition count 1030
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 377 transition count 1030
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 205 place count 352 transition count 609
Iterating global reduction 0 with 25 rules applied. Total rules applied 230 place count 352 transition count 609
Applied a total of 230 rules in 54 ms. Remains 352 /467 variables (removed 115) and now considering 609/1120 (removed 511) transitions.
// Phase 1: matrix 609 rows 352 cols
[2024-05-23 07:18:50] [INFO ] Computed 23 invariants in 7 ms
[2024-05-23 07:18:51] [INFO ] Implicit Places using invariants in 900 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 901 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 351/467 places, 609/1120 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 351 transition count 510
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 252 transition count 510
Applied a total of 198 rules in 11 ms. Remains 252 /351 variables (removed 99) and now considering 510/609 (removed 99) transitions.
// Phase 1: matrix 510 rows 252 cols
[2024-05-23 07:18:51] [INFO ] Computed 22 invariants in 3 ms
[2024-05-23 07:18:52] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-05-23 07:18:52] [INFO ] Invariant cache hit.
[2024-05-23 07:18:52] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 07:18:53] [INFO ] Implicit Places using invariants and state equation in 1561 ms returned []
Implicit Place search using SMT with State Equation took 1900 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 252/467 places, 510/1120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2868 ms. Remains : 252/467 places, 510/1120 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-10
Product exploration explored 100000 steps with 1 reset in 265 ms.
Stack based approach found an accepted trace after 84 steps with 2 reset with depth 70 and stack size 70 in 0 ms.
FORMULA Anderson-PT-10-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-10 finished in 3206 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 442 transition count 699
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 442 transition count 699
Applied a total of 50 rules in 27 ms. Remains 442 /467 variables (removed 25) and now considering 699/1120 (removed 421) transitions.
// Phase 1: matrix 699 rows 442 cols
[2024-05-23 07:18:54] [INFO ] Computed 23 invariants in 7 ms
[2024-05-23 07:18:54] [INFO ] Implicit Places using invariants in 831 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 833 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 441/467 places, 699/1120 transitions.
Applied a total of 0 rules in 8 ms. Remains 441 /441 variables (removed 0) and now considering 699/699 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 870 ms. Remains : 441/467 places, 699/1120 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-11
Product exploration explored 100000 steps with 8 reset in 158 ms.
Stack based approach found an accepted trace after 71 steps with 0 reset with depth 72 and stack size 72 in 0 ms.
FORMULA Anderson-PT-10-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-11 finished in 1122 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((G(p1)&&p0))&&F(G(p2)))))'
Support contains 5 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 444 transition count 719
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 444 transition count 719
Applied a total of 46 rules in 18 ms. Remains 444 /467 variables (removed 23) and now considering 719/1120 (removed 401) transitions.
// Phase 1: matrix 719 rows 444 cols
[2024-05-23 07:18:55] [INFO ] Computed 23 invariants in 5 ms
[2024-05-23 07:18:55] [INFO ] Implicit Places using invariants in 635 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 639 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 443/467 places, 719/1120 transitions.
Applied a total of 0 rules in 7 ms. Remains 443 /443 variables (removed 0) and now considering 719/719 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 665 ms. Remains : 443/467 places, 719/1120 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 153 ms.
Stack based approach found an accepted trace after 71 steps with 0 reset with depth 72 and stack size 72 in 0 ms.
FORMULA Anderson-PT-10-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-12 finished in 1028 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||F(G(p1)))))))'
Support contains 4 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 443 transition count 718
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 443 transition count 718
Applied a total of 48 rules in 17 ms. Remains 443 /467 variables (removed 24) and now considering 718/1120 (removed 402) transitions.
// Phase 1: matrix 718 rows 443 cols
[2024-05-23 07:18:56] [INFO ] Computed 23 invariants in 5 ms
[2024-05-23 07:18:57] [INFO ] Implicit Places using invariants in 958 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 960 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/467 places, 718/1120 transitions.
Applied a total of 0 rules in 13 ms. Remains 442 /442 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 990 ms. Remains : 442/467 places, 718/1120 transitions.
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-10-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 241 ms.
Stack based approach found an accepted trace after 75 steps with 0 reset with depth 76 and stack size 76 in 1 ms.
FORMULA Anderson-PT-10-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-13 finished in 1483 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(G(p0))&&F(p1))))'
Support contains 4 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 467 transition count 1030
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 377 transition count 1030
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 204 place count 353 transition count 628
Iterating global reduction 0 with 24 rules applied. Total rules applied 228 place count 353 transition count 628
Applied a total of 228 rules in 41 ms. Remains 353 /467 variables (removed 114) and now considering 628/1120 (removed 492) transitions.
// Phase 1: matrix 628 rows 353 cols
[2024-05-23 07:18:57] [INFO ] Computed 23 invariants in 8 ms
[2024-05-23 07:18:58] [INFO ] Implicit Places using invariants in 1003 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1009 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 352/467 places, 628/1120 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 352 transition count 530
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 196 place count 254 transition count 530
Applied a total of 196 rules in 16 ms. Remains 254 /352 variables (removed 98) and now considering 530/628 (removed 98) transitions.
// Phase 1: matrix 530 rows 254 cols
[2024-05-23 07:18:58] [INFO ] Computed 22 invariants in 5 ms
[2024-05-23 07:18:59] [INFO ] Implicit Places using invariants in 520 ms returned []
[2024-05-23 07:18:59] [INFO ] Invariant cache hit.
[2024-05-23 07:18:59] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 07:19:00] [INFO ] Implicit Places using invariants and state equation in 1565 ms returned []
Implicit Place search using SMT with State Equation took 2087 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 254/467 places, 530/1120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3156 ms. Remains : 254/467 places, 530/1120 transitions.
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-15
Product exploration explored 100000 steps with 6 reset in 284 ms.
Stack based approach found an accepted trace after 57 steps with 0 reset with depth 58 and stack size 58 in 1 ms.
FORMULA Anderson-PT-10-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-15 finished in 3695 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' '!(((!p0&&X(X(F(p0)))) U G(!p1)))'
Found a Shortening insensitive property : Anderson-PT-10-LTLFireability-02
Stuttering acceptance computed with spot in 275 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Support contains 5 out of 467 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 89 Pre rules applied. Total rules applied 0 place count 467 transition count 1031
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 0 with 178 rules applied. Total rules applied 178 place count 378 transition count 1031
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 203 place count 353 transition count 592
Iterating global reduction 0 with 25 rules applied. Total rules applied 228 place count 353 transition count 592
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 230 place count 352 transition count 591
Applied a total of 230 rules in 57 ms. Remains 352 /467 variables (removed 115) and now considering 591/1120 (removed 529) transitions.
// Phase 1: matrix 591 rows 352 cols
[2024-05-23 07:19:01] [INFO ] Computed 23 invariants in 8 ms
[2024-05-23 07:19:02] [INFO ] Implicit Places using invariants in 768 ms returned []
[2024-05-23 07:19:02] [INFO ] Invariant cache hit.
[2024-05-23 07:19:03] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 07:19:04] [INFO ] Implicit Places using invariants and state equation in 2279 ms returned []
Implicit Place search using SMT with State Equation took 3047 ms to find 0 implicit places.
Running 581 sub problems to find dead transitions.
[2024-05-23 07:19:04] [INFO ] Invariant cache hit.
[2024-05-23 07:19:04] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 3 (OVERLAPS) 1/352 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-23 07:19:30] [INFO ] Deduced a trap composed of 110 places in 462 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 581 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 352/943 variables, and 24 constraints, problems are : Problem set: 0 solved, 581 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/352 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 581/581 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 581 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/351 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 4 (OVERLAPS) 1/352 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-23 07:19:47] [INFO ] Deduced a trap composed of 143 places in 470 ms of which 7 ms to minimize.
[2024-05-23 07:19:47] [INFO ] Deduced a trap composed of 162 places in 399 ms of which 6 ms to minimize.
[2024-05-23 07:19:48] [INFO ] Deduced a trap composed of 74 places in 451 ms of which 5 ms to minimize.
[2024-05-23 07:19:48] [INFO ] Deduced a trap composed of 98 places in 429 ms of which 6 ms to minimize.
[2024-05-23 07:19:48] [INFO ] Deduced a trap composed of 105 places in 443 ms of which 5 ms to minimize.
[2024-05-23 07:19:49] [INFO ] Deduced a trap composed of 89 places in 453 ms of which 6 ms to minimize.
[2024-05-23 07:19:49] [INFO ] Deduced a trap composed of 186 places in 460 ms of which 6 ms to minimize.
[2024-05-23 07:19:50] [INFO ] Deduced a trap composed of 63 places in 448 ms of which 5 ms to minimize.
[2024-05-23 07:19:50] [INFO ] Deduced a trap composed of 88 places in 473 ms of which 5 ms to minimize.
[2024-05-23 07:19:51] [INFO ] Deduced a trap composed of 131 places in 485 ms of which 6 ms to minimize.
[2024-05-23 07:19:51] [INFO ] Deduced a trap composed of 60 places in 455 ms of which 6 ms to minimize.
[2024-05-23 07:19:52] [INFO ] Deduced a trap composed of 165 places in 400 ms of which 6 ms to minimize.
[2024-05-23 07:19:53] [INFO ] Deduced a trap composed of 117 places in 465 ms of which 6 ms to minimize.
[2024-05-23 07:19:53] [INFO ] Deduced a trap composed of 206 places in 454 ms of which 5 ms to minimize.
[2024-05-23 07:19:54] [INFO ] Deduced a trap composed of 225 places in 419 ms of which 5 ms to minimize.
[2024-05-23 07:19:54] [INFO ] Deduced a trap composed of 210 places in 324 ms of which 3 ms to minimize.
[2024-05-23 07:19:54] [INFO ] Deduced a trap composed of 207 places in 278 ms of which 4 ms to minimize.
[2024-05-23 07:19:55] [INFO ] Deduced a trap composed of 207 places in 402 ms of which 5 ms to minimize.
[2024-05-23 07:19:55] [INFO ] Deduced a trap composed of 217 places in 398 ms of which 6 ms to minimize.
[2024-05-23 07:19:55] [INFO ] Deduced a trap composed of 176 places in 431 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-23 07:20:00] [INFO ] Deduced a trap composed of 112 places in 424 ms of which 6 ms to minimize.
[2024-05-23 07:20:01] [INFO ] Deduced a trap composed of 223 places in 420 ms of which 6 ms to minimize.
[2024-05-23 07:20:03] [INFO ] Deduced a trap composed of 81 places in 463 ms of which 5 ms to minimize.
[2024-05-23 07:20:03] [INFO ] Deduced a trap composed of 127 places in 293 ms of which 4 ms to minimize.
[2024-05-23 07:20:04] [INFO ] Deduced a trap composed of 119 places in 464 ms of which 6 ms to minimize.
[2024-05-23 07:20:04] [INFO ] Deduced a trap composed of 181 places in 385 ms of which 6 ms to minimize.
[2024-05-23 07:20:05] [INFO ] Deduced a trap composed of 179 places in 448 ms of which 6 ms to minimize.
[2024-05-23 07:20:05] [INFO ] Deduced a trap composed of 167 places in 400 ms of which 5 ms to minimize.
[2024-05-23 07:20:05] [INFO ] Deduced a trap composed of 182 places in 297 ms of which 3 ms to minimize.
SMT process timed out in 60915ms, After SMT, problems are : Problem set: 0 solved, 581 unsolved
Search for dead transitions found 0 dead transitions in 60924ms
Starting structural reductions in LI_LTL mode, iteration 1 : 352/467 places, 591/1120 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 64031 ms. Remains : 352/467 places, 591/1120 transitions.
Running random walk in product with property : Anderson-PT-10-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 241 ms.
Product exploration explored 100000 steps with 0 reset in 287 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 139 ms. Reduced automaton from 6 states, 18 edges and 2 AP (stutter sensitive) to 6 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
RANDOM walk for 40000 steps (8 resets) in 392 ms. (101 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 152 ms. (261 steps per ms) remains 1/3 properties
[2024-05-23 07:20:07] [INFO ] Invariant cache hit.
[2024-05-23 07:20:07] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 321/326 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 7/333 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 352/943 variables, and 23 constraints, problems are : Problem set: 1 solved, 0 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/352 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 140ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 14 factoid took 373 ms. Reduced automaton from 6 states, 18 edges and 2 AP (stutter sensitive) to 6 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 241 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 591/591 transitions.
Applied a total of 0 rules in 6 ms. Remains 352 /352 variables (removed 0) and now considering 591/591 (removed 0) transitions.
[2024-05-23 07:20:08] [INFO ] Invariant cache hit.
[2024-05-23 07:20:09] [INFO ] Implicit Places using invariants in 1023 ms returned []
[2024-05-23 07:20:09] [INFO ] Invariant cache hit.
[2024-05-23 07:20:09] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 07:20:11] [INFO ] Implicit Places using invariants and state equation in 2107 ms returned []
Implicit Place search using SMT with State Equation took 3136 ms to find 0 implicit places.
Running 581 sub problems to find dead transitions.
[2024-05-23 07:20:11] [INFO ] Invariant cache hit.
[2024-05-23 07:20:11] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 3 (OVERLAPS) 1/352 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-23 07:20:35] [INFO ] Deduced a trap composed of 110 places in 471 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 581 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 352/943 variables, and 24 constraints, problems are : Problem set: 0 solved, 581 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/352 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 581/581 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 581 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/351 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 4 (OVERLAPS) 1/352 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-23 07:20:51] [INFO ] Deduced a trap composed of 143 places in 296 ms of which 4 ms to minimize.
[2024-05-23 07:20:52] [INFO ] Deduced a trap composed of 162 places in 292 ms of which 4 ms to minimize.
[2024-05-23 07:20:52] [INFO ] Deduced a trap composed of 74 places in 295 ms of which 4 ms to minimize.
[2024-05-23 07:20:52] [INFO ] Deduced a trap composed of 98 places in 300 ms of which 3 ms to minimize.
[2024-05-23 07:20:52] [INFO ] Deduced a trap composed of 105 places in 286 ms of which 4 ms to minimize.
[2024-05-23 07:20:53] [INFO ] Deduced a trap composed of 89 places in 297 ms of which 3 ms to minimize.
[2024-05-23 07:20:53] [INFO ] Deduced a trap composed of 186 places in 369 ms of which 5 ms to minimize.
[2024-05-23 07:20:53] [INFO ] Deduced a trap composed of 63 places in 352 ms of which 4 ms to minimize.
[2024-05-23 07:20:54] [INFO ] Deduced a trap composed of 88 places in 352 ms of which 5 ms to minimize.
[2024-05-23 07:20:54] [INFO ] Deduced a trap composed of 131 places in 345 ms of which 5 ms to minimize.
[2024-05-23 07:20:55] [INFO ] Deduced a trap composed of 60 places in 346 ms of which 4 ms to minimize.
[2024-05-23 07:20:55] [INFO ] Deduced a trap composed of 165 places in 304 ms of which 4 ms to minimize.
[2024-05-23 07:20:56] [INFO ] Deduced a trap composed of 117 places in 389 ms of which 6 ms to minimize.
[2024-05-23 07:20:56] [INFO ] Deduced a trap composed of 206 places in 335 ms of which 3 ms to minimize.
[2024-05-23 07:20:56] [INFO ] Deduced a trap composed of 225 places in 336 ms of which 4 ms to minimize.
[2024-05-23 07:20:57] [INFO ] Deduced a trap composed of 210 places in 305 ms of which 3 ms to minimize.
[2024-05-23 07:20:57] [INFO ] Deduced a trap composed of 207 places in 322 ms of which 6 ms to minimize.
[2024-05-23 07:20:57] [INFO ] Deduced a trap composed of 207 places in 365 ms of which 4 ms to minimize.
[2024-05-23 07:20:58] [INFO ] Deduced a trap composed of 217 places in 285 ms of which 3 ms to minimize.
[2024-05-23 07:20:58] [INFO ] Deduced a trap composed of 176 places in 299 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-23 07:21:01] [INFO ] Deduced a trap composed of 112 places in 286 ms of which 4 ms to minimize.
[2024-05-23 07:21:02] [INFO ] Deduced a trap composed of 223 places in 367 ms of which 5 ms to minimize.
[2024-05-23 07:21:03] [INFO ] Deduced a trap composed of 81 places in 312 ms of which 4 ms to minimize.
[2024-05-23 07:21:04] [INFO ] Deduced a trap composed of 127 places in 299 ms of which 4 ms to minimize.
[2024-05-23 07:21:04] [INFO ] Deduced a trap composed of 119 places in 348 ms of which 6 ms to minimize.
[2024-05-23 07:21:04] [INFO ] Deduced a trap composed of 181 places in 362 ms of which 6 ms to minimize.
[2024-05-23 07:21:05] [INFO ] Deduced a trap composed of 179 places in 351 ms of which 5 ms to minimize.
[2024-05-23 07:21:05] [INFO ] Deduced a trap composed of 167 places in 365 ms of which 5 ms to minimize.
[2024-05-23 07:21:05] [INFO ] Deduced a trap composed of 182 places in 332 ms of which 3 ms to minimize.
[2024-05-23 07:21:06] [INFO ] Deduced a trap composed of 168 places in 384 ms of which 6 ms to minimize.
[2024-05-23 07:21:06] [INFO ] Deduced a trap composed of 177 places in 395 ms of which 6 ms to minimize.
[2024-05-23 07:21:07] [INFO ] Deduced a trap composed of 173 places in 446 ms of which 6 ms to minimize.
[2024-05-23 07:21:07] [INFO ] Deduced a trap composed of 146 places in 452 ms of which 6 ms to minimize.
[2024-05-23 07:21:08] [INFO ] Deduced a trap composed of 179 places in 395 ms of which 6 ms to minimize.
[2024-05-23 07:21:08] [INFO ] Deduced a trap composed of 144 places in 381 ms of which 4 ms to minimize.
[2024-05-23 07:21:08] [INFO ] Deduced a trap composed of 140 places in 450 ms of which 6 ms to minimize.
[2024-05-23 07:21:09] [INFO ] Deduced a trap composed of 171 places in 445 ms of which 6 ms to minimize.
[2024-05-23 07:21:09] [INFO ] Deduced a trap composed of 166 places in 437 ms of which 6 ms to minimize.
[2024-05-23 07:21:10] [INFO ] Deduced a trap composed of 151 places in 446 ms of which 6 ms to minimize.
[2024-05-23 07:21:10] [INFO ] Deduced a trap composed of 170 places in 461 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 581 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/943 variables, and 64 constraints, problems are : Problem set: 0 solved, 581 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/352 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/581 constraints, Known Traps: 41/41 constraints]
After SMT, in 60701ms problems are : Problem set: 0 solved, 581 unsolved
Search for dead transitions found 0 dead transitions in 60713ms
Finished structural reductions in LTL mode , in 1 iterations and 63856 ms. Remains : 352/352 places, 591/591 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 143 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter sensitive) to 6 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
RANDOM walk for 40000 steps (8 resets) in 374 ms. (106 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
[2024-05-23 07:21:12] [INFO ] Invariant cache hit.
[2024-05-23 07:21:12] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 321/324 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/332 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/332 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 20/352 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 591/943 variables, 352/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/943 variables, 90/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/943 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/943 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 943/943 variables, and 465 constraints, problems are : Problem set: 0 solved, 1 unsolved in 572 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 352/352 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 321/324 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/332 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/332 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 20/352 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 591/943 variables, 352/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/943 variables, 90/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 943/943 variables, and 466 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 352/352 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1610ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 3 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 591/591 transitions.
Applied a total of 0 rules in 18 ms. Remains 352 /352 variables (removed 0) and now considering 591/591 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 352/352 places, 591/591 transitions.
RANDOM walk for 40000 steps (8 resets) in 188 ms. (211 steps per ms) remains 1/1 properties
BEST_FIRST walk for 16089 steps (3 resets) in 31 ms. (502 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 294 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter sensitive) to 6 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 272 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 265 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Product exploration explored 100000 steps with 0 reset in 433 ms.
Product exploration explored 100000 steps with 0 reset in 443 ms.
Applying partial POR strategy [true, false, true, false, true, false]
Stuttering acceptance computed with spot in 277 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 591/591 transitions.
Applied a total of 0 rules in 11 ms. Remains 352 /352 variables (removed 0) and now considering 591/591 (removed 0) transitions.
[2024-05-23 07:21:16] [INFO ] Redundant transitions in 4 ms returned []
Running 581 sub problems to find dead transitions.
[2024-05-23 07:21:16] [INFO ] Invariant cache hit.
[2024-05-23 07:21:16] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 3 (OVERLAPS) 1/352 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-23 07:21:40] [INFO ] Deduced a trap composed of 110 places in 472 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 581 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 352/943 variables, and 24 constraints, problems are : Problem set: 0 solved, 581 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/352 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 581/581 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 581 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/351 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 4 (OVERLAPS) 1/352 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-23 07:21:57] [INFO ] Deduced a trap composed of 143 places in 309 ms of which 4 ms to minimize.
[2024-05-23 07:21:57] [INFO ] Deduced a trap composed of 162 places in 395 ms of which 6 ms to minimize.
[2024-05-23 07:21:58] [INFO ] Deduced a trap composed of 74 places in 418 ms of which 6 ms to minimize.
[2024-05-23 07:21:58] [INFO ] Deduced a trap composed of 98 places in 325 ms of which 4 ms to minimize.
[2024-05-23 07:21:58] [INFO ] Deduced a trap composed of 105 places in 373 ms of which 5 ms to minimize.
[2024-05-23 07:21:59] [INFO ] Deduced a trap composed of 89 places in 419 ms of which 5 ms to minimize.
[2024-05-23 07:21:59] [INFO ] Deduced a trap composed of 186 places in 352 ms of which 4 ms to minimize.
[2024-05-23 07:21:59] [INFO ] Deduced a trap composed of 63 places in 338 ms of which 5 ms to minimize.
[2024-05-23 07:22:00] [INFO ] Deduced a trap composed of 88 places in 347 ms of which 5 ms to minimize.
[2024-05-23 07:22:00] [INFO ] Deduced a trap composed of 131 places in 352 ms of which 4 ms to minimize.
[2024-05-23 07:22:01] [INFO ] Deduced a trap composed of 60 places in 445 ms of which 5 ms to minimize.
[2024-05-23 07:22:01] [INFO ] Deduced a trap composed of 165 places in 449 ms of which 5 ms to minimize.
[2024-05-23 07:22:02] [INFO ] Deduced a trap composed of 117 places in 457 ms of which 6 ms to minimize.
[2024-05-23 07:22:02] [INFO ] Deduced a trap composed of 206 places in 441 ms of which 6 ms to minimize.
[2024-05-23 07:22:03] [INFO ] Deduced a trap composed of 225 places in 472 ms of which 6 ms to minimize.
[2024-05-23 07:22:03] [INFO ] Deduced a trap composed of 210 places in 464 ms of which 6 ms to minimize.
[2024-05-23 07:22:04] [INFO ] Deduced a trap composed of 207 places in 473 ms of which 6 ms to minimize.
[2024-05-23 07:22:04] [INFO ] Deduced a trap composed of 207 places in 468 ms of which 7 ms to minimize.
[2024-05-23 07:22:05] [INFO ] Deduced a trap composed of 217 places in 465 ms of which 6 ms to minimize.
[2024-05-23 07:22:05] [INFO ] Deduced a trap composed of 176 places in 440 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-23 07:22:10] [INFO ] Deduced a trap composed of 112 places in 469 ms of which 7 ms to minimize.
[2024-05-23 07:22:12] [INFO ] Deduced a trap composed of 223 places in 448 ms of which 6 ms to minimize.
[2024-05-23 07:22:13] [INFO ] Deduced a trap composed of 81 places in 477 ms of which 6 ms to minimize.
[2024-05-23 07:22:14] [INFO ] Deduced a trap composed of 127 places in 453 ms of which 5 ms to minimize.
[2024-05-23 07:22:14] [INFO ] Deduced a trap composed of 119 places in 462 ms of which 6 ms to minimize.
[2024-05-23 07:22:15] [INFO ] Deduced a trap composed of 181 places in 463 ms of which 6 ms to minimize.
[2024-05-23 07:22:15] [INFO ] Deduced a trap composed of 179 places in 453 ms of which 5 ms to minimize.
[2024-05-23 07:22:16] [INFO ] Deduced a trap composed of 167 places in 437 ms of which 5 ms to minimize.
[2024-05-23 07:22:16] [INFO ] Deduced a trap composed of 182 places in 439 ms of which 6 ms to minimize.
[2024-05-23 07:22:16] [INFO ] Deduced a trap composed of 168 places in 444 ms of which 6 ms to minimize.
[2024-05-23 07:22:17] [INFO ] Deduced a trap composed of 177 places in 447 ms of which 6 ms to minimize.
SMT process timed out in 60802ms, After SMT, problems are : Problem set: 0 solved, 581 unsolved
Search for dead transitions found 0 dead transitions in 60809ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60831 ms. Remains : 352/352 places, 591/591 transitions.
Built C files in :
/tmp/ltsmin16193849455208619735
[2024-05-23 07:22:17] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16193849455208619735
Running compilation step : cd /tmp/ltsmin16193849455208619735;'/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 2297 ms.
Running link step : cd /tmp/ltsmin16193849455208619735;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin16193849455208619735;'/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/stateBased14427011995499479151.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 591/591 transitions.
Applied a total of 0 rules in 6 ms. Remains 352 /352 variables (removed 0) and now considering 591/591 (removed 0) transitions.
[2024-05-23 07:22:32] [INFO ] Invariant cache hit.
[2024-05-23 07:22:33] [INFO ] Implicit Places using invariants in 605 ms returned []
[2024-05-23 07:22:33] [INFO ] Invariant cache hit.
[2024-05-23 07:22:33] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 07:22:34] [INFO ] Implicit Places using invariants and state equation in 1696 ms returned []
Implicit Place search using SMT with State Equation took 2302 ms to find 0 implicit places.
Running 581 sub problems to find dead transitions.
[2024-05-23 07:22:34] [INFO ] Invariant cache hit.
[2024-05-23 07:22:34] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 3 (OVERLAPS) 1/352 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-23 07:22:56] [INFO ] Deduced a trap composed of 110 places in 340 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-23 07:23:03] [INFO ] Deduced a trap composed of 89 places in 289 ms of which 3 ms to minimize.
[2024-05-23 07:23:03] [INFO ] Deduced a trap composed of 105 places in 278 ms of which 4 ms to minimize.
[2024-05-23 07:23:03] [INFO ] Deduced a trap composed of 100 places in 279 ms of which 3 ms to minimize.
[2024-05-23 07:23:04] [INFO ] Deduced a trap composed of 139 places in 277 ms of which 4 ms to minimize.
[2024-05-23 07:23:04] [INFO ] Deduced a trap composed of 130 places in 268 ms of which 4 ms to minimize.
[2024-05-23 07:23:04] [INFO ] Deduced a trap composed of 105 places in 271 ms of which 3 ms to minimize.
[2024-05-23 07:23:04] [INFO ] Deduced a trap composed of 87 places in 271 ms of which 3 ms to minimize.
[2024-05-23 07:23:05] [INFO ] Deduced a trap composed of 83 places in 275 ms of which 3 ms to minimize.
[2024-05-23 07:23:05] [INFO ] Deduced a trap composed of 77 places in 270 ms of which 4 ms to minimize.
[2024-05-23 07:23:05] [INFO ] Deduced a trap composed of 183 places in 266 ms of which 4 ms to minimize.
SMT process timed out in 30843ms, After SMT, problems are : Problem set: 0 solved, 581 unsolved
Search for dead transitions found 0 dead transitions in 30849ms
Finished structural reductions in LTL mode , in 1 iterations and 33158 ms. Remains : 352/352 places, 591/591 transitions.
Built C files in :
/tmp/ltsmin13232056303179753592
[2024-05-23 07:23:05] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13232056303179753592
Running compilation step : cd /tmp/ltsmin13232056303179753592;'/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 1844 ms.
Running link step : cd /tmp/ltsmin13232056303179753592;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13232056303179753592;'/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/stateBased12093703298700978593.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 07:23:20] [INFO ] Flatten gal took : 19 ms
[2024-05-23 07:23:20] [INFO ] Flatten gal took : 18 ms
[2024-05-23 07:23:20] [INFO ] Time to serialize gal into /tmp/LTL4627010132091431158.gal : 5 ms
[2024-05-23 07:23:20] [INFO ] Time to serialize properties into /tmp/LTL3542929216432451550.prop : 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/LTL4627010132091431158.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6501413118421162635.hoa' '-atoms' '/tmp/LTL3542929216432451550.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/LTL3542929216432451550.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6501413118421162635.hoa
Detected timeout of ITS tools.
[2024-05-23 07:23:36] [INFO ] Flatten gal took : 17 ms
[2024-05-23 07:23:36] [INFO ] Flatten gal took : 18 ms
[2024-05-23 07:23:36] [INFO ] Time to serialize gal into /tmp/LTL6621499987347555483.gal : 4 ms
[2024-05-23 07:23:36] [INFO ] Time to serialize properties into /tmp/LTL8531892227654424664.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/LTL6621499987347555483.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8531892227654424664.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 : !((((!("((slot_F.F.F.F.F.F.F.F.F.F==1)&&(cs_1_2==1))"))&&(X(X(F("((slot_F.F.F.F.F.F.F.F.F.F==1)&&(cs_1_2==1))")))))U(G(!("(((slot_F.F....208
Formula 0 simplified : ("((slot_F.F.F.F.F.F.F.F.F.F==1)&&(cs_1_2==1))" | XXG!"((slot_F.F.F.F.F.F.F.F.F.F==1)&&(cs_1_2==1))") R F"(((slot_F.F.F.F.F.F.T.F.F....189
Detected timeout of ITS tools.
[2024-05-23 07:23:51] [INFO ] Flatten gal took : 18 ms
[2024-05-23 07:23:51] [INFO ] Applying decomposition
[2024-05-23 07:23:51] [INFO ] Flatten gal took : 18 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/graph15597856671882102162.txt' '-o' '/tmp/graph15597856671882102162.bin' '-w' '/tmp/graph15597856671882102162.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15597856671882102162.bin' '-l' '-1' '-v' '-w' '/tmp/graph15597856671882102162.weights' '-q' '0' '-e' '0.001'
[2024-05-23 07:23:51] [INFO ] Decomposing Gal with order
[2024-05-23 07:23:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 07:23:51] [INFO ] Removed a total of 917 redundant transitions.
[2024-05-23 07:23:51] [INFO ] Flatten gal took : 48 ms
[2024-05-23 07:23:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 125 labels/synchronizations in 18 ms.
[2024-05-23 07:23:51] [INFO ] Time to serialize gal into /tmp/LTL7332740785404580218.gal : 7 ms
[2024-05-23 07:23:51] [INFO ] Time to serialize properties into /tmp/LTL17212910693015499766.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/LTL7332740785404580218.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17212910693015499766.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 : !((((!("((i0.u0.slot_F.F.F.F.F.F.F.F.F.F==1)&&(i4.u11.cs_1_2==1))"))&&(X(X(F("((i0.u0.slot_F.F.F.F.F.F.F.F.F.F==1)&&(i4.u11.cs_1_2==1)...255
Formula 0 simplified : ("((i0.u0.slot_F.F.F.F.F.F.F.F.F.F==1)&&(i4.u11.cs_1_2==1))" | XXG!"((i0.u0.slot_F.F.F.F.F.F.F.F.F.F==1)&&(i4.u11.cs_1_2==1))") R F"...236
Detected timeout of ITS tools.
Treatment of property Anderson-PT-10-LTLFireability-02 finished in 304974 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||(!p0&&F(G(!p1)))))'
[2024-05-23 07:24:06] [INFO ] Flatten gal took : 33 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12018742783214553903
[2024-05-23 07:24:06] [INFO ] Computing symmetric may disable matrix : 1120 transitions.
[2024-05-23 07:24:06] [INFO ] Applying decomposition
[2024-05-23 07:24:06] [INFO ] Computation of Complete disable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 07:24:06] [INFO ] Computing symmetric may enable matrix : 1120 transitions.
[2024-05-23 07:24:06] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 07:24:06] [INFO ] Flatten gal took : 41 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/graph16063608704110054704.txt' '-o' '/tmp/graph16063608704110054704.bin' '-w' '/tmp/graph16063608704110054704.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16063608704110054704.bin' '-l' '-1' '-v' '-w' '/tmp/graph16063608704110054704.weights' '-q' '0' '-e' '0.001'
[2024-05-23 07:24:06] [INFO ] Decomposing Gal with order
[2024-05-23 07:24:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 07:24:06] [INFO ] Removed a total of 1957 redundant transitions.
[2024-05-23 07:24:06] [INFO ] Flatten gal took : 94 ms
[2024-05-23 07:24:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 231 labels/synchronizations in 22 ms.
[2024-05-23 07:24:06] [INFO ] Time to serialize gal into /tmp/LTLFireability604094627006833520.gal : 9 ms
[2024-05-23 07:24:06] [INFO ] Time to serialize properties into /tmp/LTLFireability8995686777059074742.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/LTLFireability604094627006833520.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8995686777059074742.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...275
Read 2 LTL properties
[2024-05-23 07:24:06] [INFO ] Computing Do-Not-Accords matrix : 1120 transitions.
[2024-05-23 07:24:07] [INFO ] Computation of Completed DNA matrix. took 46 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 07:24:07] [INFO ] Built C files in 469ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12018742783214553903
Running compilation step : cd /tmp/ltsmin12018742783214553903;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' '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'
Checking formula 0 : !((((!("((u0.slot_F.F.F.F.F.F.F.F.F.F==1)&&(u0.cs_1_2==1))"))&&(X(X(F("((u0.slot_F.F.F.F.F.F.F.F.F.F==1)&&(u0.cs_1_2==1))")))))U(G(!("...234
Formula 0 simplified : ("((u0.slot_F.F.F.F.F.F.F.F.F.F==1)&&(u0.cs_1_2==1))" | XXG!"((u0.slot_F.F.F.F.F.F.F.F.F.F==1)&&(u0.cs_1_2==1))") R F"(((u0.slot_F.F...215
Compilation finished in 6891 ms.
Running link step : cd /tmp/ltsmin12018742783214553903;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 157 ms.
Running LTSmin : cd /tmp/ltsmin12018742783214553903;'/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' '--ltl' '((!(LTLAPp0==true)&&X(X(<>((LTLAPp0==true))))) U [](!(LTLAPp1==true)))' '--buchi-type=spotba'
LTSmin run took 10826 ms.
FORMULA Anderson-PT-10-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin12018742783214553903;'/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' '--ltl' '([](!(LTLAPp2==true))||(!(LTLAPp2==true)&&<>([](!(LTLAPp3==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin12018742783214553903;'/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' '--ltl' '([](!(LTLAPp2==true))||(!(LTLAPp2==true)&&<>([](!(LTLAPp3==true)))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin12018742783214553903;'/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' '--ltl' '([](!(LTLAPp2==true))||(!(LTLAPp2==true)&&<>([](!(LTLAPp3==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-23 07:50:22] [INFO ] Applying decomposition
[2024-05-23 07:50:22] [INFO ] Flatten gal took : 167 ms
[2024-05-23 07:50:22] [INFO ] Decomposing Gal with order
[2024-05-23 07:50:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 07:50:23] [INFO ] Removed a total of 1343 redundant transitions.
[2024-05-23 07:50:23] [INFO ] Flatten gal took : 639 ms
[2024-05-23 07:50:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 364 labels/synchronizations in 44 ms.
[2024-05-23 07:50:23] [INFO ] Time to serialize gal into /tmp/LTLFireability12653705071484554375.gal : 55 ms
[2024-05-23 07:50:23] [INFO ] Time to serialize properties into /tmp/LTLFireability17694478642689893775.ltl : 55 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/LTLFireability12653705071484554375.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17694478642689893775.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...278
Read 1 LTL properties
Checking formula 0 : !(((G(!("(((!((u11.next_8==1)&&(u2.ncs_5_7==1)))&&(u11.next_18==1))&&(u6.ncs_9_3==1))")))||(F(G(!("((u11.next_16==1)&&(u10.p1_3_9==1))...162
Formula 0 simplified : F"(((!((u11.next_8==1)&&(u2.ncs_5_7==1)))&&(u11.next_18==1))&&(u6.ncs_9_3==1))" & GF"((u11.next_16==1)&&(u10.p1_3_9==1))"
Reverse transition relation is NOT exact ! Due to transitions t10, t30, t40, t41, t52, t62, t63, t64, t85, t94, t97, t104, t105, t106, t113, t117, t119, t1...1568
BK_TIME_CONFINEMENT_REACHED
--------------------
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-10"
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-10, 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-171620118400364"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-10.tgz
mv Anderson-PT-10 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 ;