About the Execution of ITS-Tools for CircularTrains-PT-096
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5814.831 | 3600000.00 | 4965101.00 | 10357.30 | FFFTTFTTF??TFFF? | 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.r070-tall-171620505700348.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 CircularTrains-PT-096, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620505700348
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 14:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 14:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 14:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K Apr 12 14:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 73K 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 CircularTrains-PT-096-LTLFireability-00
FORMULA_NAME CircularTrains-PT-096-LTLFireability-01
FORMULA_NAME CircularTrains-PT-096-LTLFireability-02
FORMULA_NAME CircularTrains-PT-096-LTLFireability-03
FORMULA_NAME CircularTrains-PT-096-LTLFireability-04
FORMULA_NAME CircularTrains-PT-096-LTLFireability-05
FORMULA_NAME CircularTrains-PT-096-LTLFireability-06
FORMULA_NAME CircularTrains-PT-096-LTLFireability-07
FORMULA_NAME CircularTrains-PT-096-LTLFireability-08
FORMULA_NAME CircularTrains-PT-096-LTLFireability-09
FORMULA_NAME CircularTrains-PT-096-LTLFireability-10
FORMULA_NAME CircularTrains-PT-096-LTLFireability-11
FORMULA_NAME CircularTrains-PT-096-LTLFireability-12
FORMULA_NAME CircularTrains-PT-096-LTLFireability-13
FORMULA_NAME CircularTrains-PT-096-LTLFireability-14
FORMULA_NAME CircularTrains-PT-096-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716283927165
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-096
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 09:32:08] [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-21 09:32:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 09:32:08] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2024-05-21 09:32:08] [INFO ] Transformed 192 places.
[2024-05-21 09:32:08] [INFO ] Transformed 96 transitions.
[2024-05-21 09:32:08] [INFO ] Parsed PT model containing 192 places and 96 transitions and 384 arcs in 150 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CircularTrains-PT-096-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-096-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 96/96 transitions.
Applied a total of 0 rules in 20 ms. Remains 192 /192 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 192 cols
[2024-05-21 09:32:08] [INFO ] Computed 97 invariants in 26 ms
[2024-05-21 09:32:08] [INFO ] Implicit Places using invariants in 301 ms returned [1, 4, 8, 10, 14, 20, 27, 29, 39, 49, 109, 115, 116, 123, 125, 144, 155, 162, 174, 177, 182, 183, 186, 189]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 332 ms to find 24 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 168/192 places, 96/96 transitions.
Applied a total of 0 rules in 6 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 374 ms. Remains : 168/192 places, 96/96 transitions.
Support contains 50 out of 168 places after structural reductions.
[2024-05-21 09:32:09] [INFO ] Flatten gal took : 28 ms
[2024-05-21 09:32:09] [INFO ] Flatten gal took : 12 ms
[2024-05-21 09:32:09] [INFO ] Input system was already deterministic with 96 transitions.
Support contains 48 out of 168 places (down from 50) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 27 to 25
RANDOM walk for 444 steps (0 resets) in 76 ms. (5 steps per ms) remains 0/25 properties
FORMULA CircularTrains-PT-096-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!((F(G(p0))||(F((G(p2)&&p1))&&F(p0))))'
Support contains 6 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 168 transition count 80
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 33 place count 152 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 151 transition count 79
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 34 place count 151 transition count 73
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 46 place count 145 transition count 73
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 58 place count 139 transition count 67
Applied a total of 58 rules in 46 ms. Remains 139 /168 variables (removed 29) and now considering 67/96 (removed 29) transitions.
// Phase 1: matrix 67 rows 139 cols
[2024-05-21 09:32:09] [INFO ] Computed 73 invariants in 3 ms
[2024-05-21 09:32:09] [INFO ] Implicit Places using invariants in 117 ms returned [2, 23, 120, 122, 124, 130, 135, 136]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 118 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/168 places, 67/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 131 transition count 65
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 129 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 128 transition count 64
Applied a total of 6 rules in 8 ms. Remains 128 /131 variables (removed 3) and now considering 64/67 (removed 3) transitions.
// Phase 1: matrix 64 rows 128 cols
[2024-05-21 09:32:09] [INFO ] Computed 65 invariants in 3 ms
[2024-05-21 09:32:09] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-21 09:32:09] [INFO ] Invariant cache hit.
[2024-05-21 09:32:10] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 128/168 places, 64/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 377 ms. Remains : 128/168 places, 64/96 transitions.
Stuttering acceptance computed with spot in 417 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 491 ms.
Product exploration explored 100000 steps with 0 reset in 521 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) p2 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 p2 p0))), (X (NOT p1)), (X (X (NOT (AND p1 p2 (NOT p0)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (OR (AND (NOT p1) p0) (AND (NOT p2) p0))), (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), (X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0))))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 850 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 212 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false, false]
RANDOM walk for 1801 steps (0 resets) in 64 ms. (27 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 p2 p0))), (X (NOT p1)), (X (X (NOT (AND p1 p2 (NOT p0)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (OR (AND (NOT p1) p0) (AND (NOT p2) p0))), (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), (X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0))))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p2))), (F (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (F (NOT (AND p0 p2))), (F (NOT (OR p0 (NOT p2)))), (F (NOT p2)), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (AND (OR p0 p1) (OR p0 p2)))), (F p1), (F (NOT p0)), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 6 factoid took 1326 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 212 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 198 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false, false]
Support contains 6 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 5 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-21 09:32:14] [INFO ] Invariant cache hit.
[2024-05-21 09:32:14] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-21 09:32:14] [INFO ] Invariant cache hit.
[2024-05-21 09:32:14] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-05-21 09:32:14] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2024-05-21 09:32:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 803 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1619 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 2444ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2452ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2637 ms. Remains : 128/128 places, 64/64 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X p0), (X (NOT p0)), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 1197 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 196 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false, false]
RANDOM walk for 840 steps (0 resets) in 27 ms. (30 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X p0), (X (NOT p0)), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p2))), (F (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (F (NOT (AND p0 p2))), (F (NOT (OR p0 (NOT p2)))), (F (NOT p2)), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (AND (OR p0 p1) (OR p0 p2)))), (F p1), (F (NOT p0)), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 6 factoid took 1378 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 203 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 261 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 179 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false, false]
Product exploration explored 100000 steps with 0 reset in 378 ms.
Product exploration explored 100000 steps with 0 reset in 443 ms.
Built C files in :
/tmp/ltsmin10164143257887772676
[2024-05-21 09:32:21] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2024-05-21 09:32:21] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:32:21] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2024-05-21 09:32:21] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:32:21] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2024-05-21 09:32:21] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:32:21] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10164143257887772676
Running compilation step : cd /tmp/ltsmin10164143257887772676;'/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 328 ms.
Running link step : cd /tmp/ltsmin10164143257887772676;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin10164143257887772676;'/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/stateBased8717109287872018910.hoa' '--buchi-type=spotba'
LTSmin run took 307 ms.
FORMULA CircularTrains-PT-096-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-096-LTLFireability-00 finished in 12411 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((X(p1)&&p0))))'
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 6 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 168 cols
[2024-05-21 09:32:22] [INFO ] Computed 73 invariants in 3 ms
[2024-05-21 09:32:22] [INFO ] Implicit Places using invariants in 89 ms returned [3, 29, 146, 148, 150, 163, 164]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 89 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/168 places, 96/96 transitions.
Applied a total of 0 rules in 8 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 104 ms. Remains : 161/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-096-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-096-LTLFireability-01 finished in 231 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(G(p0))))))'
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-21 09:32:22] [INFO ] Invariant cache hit.
[2024-05-21 09:32:22] [INFO ] Implicit Places using invariants in 88 ms returned [3, 29, 146, 148, 150, 158, 163, 164]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 90 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/168 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 96 ms. Remains : 160/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-02
Entered a terminal (fully accepting) state of product in 86 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-096-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-096-LTLFireability-02 finished in 164 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(p2)&&p1))))'
Support contains 6 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-21 09:32:22] [INFO ] Invariant cache hit.
[2024-05-21 09:32:22] [INFO ] Implicit Places using invariants in 94 ms returned [3, 29, 146, 158, 163, 164]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 99 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 162 /162 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 102 ms. Remains : 162/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-04
Product exploration explored 100000 steps with 1472 reset in 400 ms.
Product exploration explored 100000 steps with 1521 reset in 409 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 3 factoid took 361 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
RANDOM walk for 358 steps (0 resets) in 7 ms. (44 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F p1), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 3 factoid took 503 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 140 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
// Phase 1: matrix 96 rows 162 cols
[2024-05-21 09:32:24] [INFO ] Computed 67 invariants in 1 ms
[2024-05-21 09:32:24] [INFO ] [Real]Absence check using 61 positive place invariants in 10 ms returned sat
[2024-05-21 09:32:24] [INFO ] [Real]Absence check using 61 positive and 6 generalized place invariants in 5 ms returned sat
[2024-05-21 09:32:24] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2024-05-21 09:32:25] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-21 09:32:25] [INFO ] Added : 61 causal constraints over 13 iterations in 264 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
[2024-05-21 09:32:25] [INFO ] Invariant cache hit.
[2024-05-21 09:32:25] [INFO ] [Real]Absence check using 61 positive place invariants in 9 ms returned sat
[2024-05-21 09:32:25] [INFO ] [Real]Absence check using 61 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-21 09:32:25] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2024-05-21 09:32:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:32:25] [INFO ] [Nat]Absence check using 61 positive place invariants in 9 ms returned sat
[2024-05-21 09:32:25] [INFO ] [Nat]Absence check using 61 positive and 6 generalized place invariants in 5 ms returned sat
[2024-05-21 09:32:25] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2024-05-21 09:32:25] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-21 09:32:26] [INFO ] Added : 61 causal constraints over 13 iterations in 335 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 6 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 162 /162 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-21 09:32:26] [INFO ] Invariant cache hit.
[2024-05-21 09:32:26] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-21 09:32:26] [INFO ] Invariant cache hit.
[2024-05-21 09:32:26] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-21 09:32:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 61/159 variables, 61/62 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 3/162 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 96/258 variables, 162/229 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/258 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 229 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1740 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 61/159 variables, 61/62 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 3/162 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 96/258 variables, 162/229 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 64/293 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 0/258 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 293 constraints, problems are : Problem set: 0 solved, 64 unsolved in 6373 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 8124ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 8126ms
Finished structural reductions in LTL mode , in 1 iterations and 8333 ms. Remains : 162/162 places, 96/96 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X p2), (X (NOT p2)), (X (NOT p1)), (X p1), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 363 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
RANDOM walk for 257 steps (0 resets) in 7 ms. (32 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X p2), (X (NOT p2)), (X (NOT p1)), (X p1), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F p1), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 2 factoid took 765 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 170 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
[2024-05-21 09:32:36] [INFO ] Invariant cache hit.
[2024-05-21 09:32:36] [INFO ] [Real]Absence check using 61 positive place invariants in 10 ms returned sat
[2024-05-21 09:32:36] [INFO ] [Real]Absence check using 61 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-21 09:32:36] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2024-05-21 09:32:36] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-21 09:32:36] [INFO ] Added : 61 causal constraints over 13 iterations in 266 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
[2024-05-21 09:32:36] [INFO ] Invariant cache hit.
[2024-05-21 09:32:36] [INFO ] [Real]Absence check using 61 positive place invariants in 10 ms returned sat
[2024-05-21 09:32:36] [INFO ] [Real]Absence check using 61 positive and 6 generalized place invariants in 8 ms returned sat
[2024-05-21 09:32:36] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2024-05-21 09:32:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:32:36] [INFO ] [Nat]Absence check using 61 positive place invariants in 10 ms returned sat
[2024-05-21 09:32:36] [INFO ] [Nat]Absence check using 61 positive and 6 generalized place invariants in 5 ms returned sat
[2024-05-21 09:32:37] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2024-05-21 09:32:37] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-21 09:32:37] [INFO ] Added : 61 causal constraints over 13 iterations in 339 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 184 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 1524 reset in 380 ms.
Product exploration explored 100000 steps with 1529 reset in 407 ms.
Applying partial POR strategy [false, true, true, false]
Stuttering acceptance computed with spot in 179 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 6 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 96/96 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 162 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 162 transition count 96
Deduced a syphon composed of 29 places in 0 ms
Applied a total of 29 rules in 16 ms. Remains 162 /162 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-21 09:32:38] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 162 cols
[2024-05-21 09:32:38] [INFO ] Computed 67 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 61/159 variables, 61/62 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-21 09:32:39] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 7 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-21 09:32:39] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2024-05-21 09:32:39] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-05-21 09:32:39] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-21 09:32:39] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-05-21 09:32:39] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-05-21 09:32:39] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2024-05-21 09:32:39] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
[2024-05-21 09:32:39] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-21 09:32:39] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-21 09:32:39] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-21 09:32:39] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-05-21 09:32:39] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-21 09:32:39] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-21 09:32:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-05-21 09:32:39] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-05-21 09:32:39] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-05-21 09:32:39] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-05-21 09:32:39] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-05-21 09:32:39] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 20/84 constraints. Problems are: Problem set: 20 solved, 44 unsolved
[2024-05-21 09:32:39] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-21 09:32:39] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-05-21 09:32:39] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-21 09:32:39] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-21 09:32:40] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-21 09:32:40] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-21 09:32:40] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 3 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-05-21 09:32:40] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-21 09:32:40] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD53 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 9/93 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/93 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 3/162 variables, 3/96 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/96 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 96/258 variables, 162/258 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/258 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 11 (OVERLAPS) 0/258 variables, 0/258 constraints. Problems are: Problem set: 29 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 258 constraints, problems are : Problem set: 29 solved, 35 unsolved in 2164 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 29 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 90/159 variables, 61/61 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 3/64 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 29/93 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/93 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 3/162 variables, 3/96 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/96 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 96/258 variables, 162/258 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 35/293 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/293 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 10 (OVERLAPS) 0/258 variables, 0/293 constraints. Problems are: Problem set: 29 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 293 constraints, problems are : Problem set: 29 solved, 35 unsolved in 1695 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 35/64 constraints, Known Traps: 29/29 constraints]
After SMT, in 3873ms problems are : Problem set: 29 solved, 35 unsolved
Search for dead transitions found 29 dead transitions in 3874ms
Found 29 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 29 transitions
Dead transitions reduction (with SMT) removed 29 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 162/162 places, 67/96 transitions.
Graph (complete) has 264 edges and 162 vertex of which 133 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.3 ms
Discarding 29 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 133 /162 variables (removed 29) and now considering 67/67 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 133/162 places, 67/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3910 ms. Remains : 133/162 places, 67/96 transitions.
Built C files in :
/tmp/ltsmin12304680950643002631
[2024-05-21 09:32:42] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12304680950643002631
Running compilation step : cd /tmp/ltsmin12304680950643002631;'/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 224 ms.
Running link step : cd /tmp/ltsmin12304680950643002631;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12304680950643002631;'/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/stateBased2441913015916883707.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 96/96 transitions.
Applied a total of 0 rules in 7 ms. Remains 162 /162 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 162 cols
[2024-05-21 09:32:57] [INFO ] Computed 67 invariants in 4 ms
[2024-05-21 09:32:57] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-21 09:32:57] [INFO ] Invariant cache hit.
[2024-05-21 09:32:58] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-21 09:32:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 61/159 variables, 61/62 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 3/162 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 96/258 variables, 162/229 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/258 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 229 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1788 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 61/159 variables, 61/62 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 3/162 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 96/258 variables, 162/229 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 64/293 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 0/258 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 293 constraints, problems are : Problem set: 0 solved, 64 unsolved in 6399 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 8196ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 8197ms
Finished structural reductions in LTL mode , in 1 iterations and 8514 ms. Remains : 162/162 places, 96/96 transitions.
Built C files in :
/tmp/ltsmin3838864023522233418
[2024-05-21 09:33:06] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3838864023522233418
Running compilation step : cd /tmp/ltsmin3838864023522233418;'/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 216 ms.
Running link step : cd /tmp/ltsmin3838864023522233418;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin3838864023522233418;'/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/stateBased9233742265252994287.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 09:33:21] [INFO ] Flatten gal took : 8 ms
[2024-05-21 09:33:21] [INFO ] Flatten gal took : 6 ms
[2024-05-21 09:33:21] [INFO ] Time to serialize gal into /tmp/LTL15765119607764154244.gal : 3 ms
[2024-05-21 09:33:21] [INFO ] Time to serialize properties into /tmp/LTL15421554518695966295.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/LTL15765119607764154244.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7773925256461019024.hoa' '-atoms' '/tmp/LTL15421554518695966295.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/LTL15421554518695966295.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7773925256461019024.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-21 09:33:36] [INFO ] Flatten gal took : 6 ms
[2024-05-21 09:33:36] [INFO ] Flatten gal took : 6 ms
[2024-05-21 09:33:36] [INFO ] Time to serialize gal into /tmp/LTL18433730684265736333.gal : 2 ms
[2024-05-21 09:33:36] [INFO ] Time to serialize properties into /tmp/LTL5746276796074960268.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/LTL18433730684265736333.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5746276796074960268.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 : !((X((F("((Section_11>=1)&&(F12>=1))"))||(("((Section_10>=1)&&(F11>=1))")&&(F("((Section_70>=1)&&(F71>=1))"))))))
Formula 0 simplified : X(G!"((Section_11>=1)&&(F12>=1))" & (!"((Section_10>=1)&&(F11>=1))" | G!"((Section_70>=1)&&(F71>=1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-21 09:33:51] [INFO ] Flatten gal took : 7 ms
[2024-05-21 09:33:51] [INFO ] Applying decomposition
[2024-05-21 09:33:51] [INFO ] Flatten gal took : 6 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/graph8117852881659310894.txt' '-o' '/tmp/graph8117852881659310894.bin' '-w' '/tmp/graph8117852881659310894.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8117852881659310894.bin' '-l' '-1' '-v' '-w' '/tmp/graph8117852881659310894.weights' '-q' '0' '-e' '0.001'
[2024-05-21 09:33:51] [INFO ] Decomposing Gal with order
[2024-05-21 09:33:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 09:33:51] [INFO ] Flatten gal took : 30 ms
[2024-05-21 09:33:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 09:33:51] [INFO ] Time to serialize gal into /tmp/LTL1071926533703880573.gal : 3 ms
[2024-05-21 09:33:51] [INFO ] Time to serialize properties into /tmp/LTL14994074928404874798.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/LTL1071926533703880573.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14994074928404874798.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 : !((X((F("((i7.u10.Section_11>=1)&&(i7.u14.F12>=1))"))||(("((i7.u23.Section_10>=1)&&(i7.u10.F11>=1))")&&(F("((i4.u24.Section_70>=1)&&(i...175
Formula 0 simplified : X(G!"((i7.u10.Section_11>=1)&&(i7.u14.F12>=1))" & (!"((i7.u23.Section_10>=1)&&(i7.u10.F11>=1))" | G!"((i4.u24.Section_70>=1)&&(i4.u0...167
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-096-LTLFireability-04 finished in 104391 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((G((X(p1)||p0))||(X(F(p3))&&p2))))'
Support contains 6 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 4 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 168 cols
[2024-05-21 09:34:06] [INFO ] Computed 73 invariants in 2 ms
[2024-05-21 09:34:06] [INFO ] Implicit Places using invariants in 135 ms returned [29, 146, 148, 158, 163, 164]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 143 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 162 /162 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 148 ms. Remains : 162/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p1)), true, (NOT p3)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-05
Entered a terminal (fully accepting) state of product in 299 steps with 43 reset in 2 ms.
FORMULA CircularTrains-PT-096-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-096-LTLFireability-05 finished in 388 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 168 transition count 78
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 150 transition count 78
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 36 place count 150 transition count 73
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 46 place count 145 transition count 73
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 58 place count 139 transition count 67
Applied a total of 58 rules in 10 ms. Remains 139 /168 variables (removed 29) and now considering 67/96 (removed 29) transitions.
// Phase 1: matrix 67 rows 139 cols
[2024-05-21 09:34:07] [INFO ] Computed 73 invariants in 2 ms
[2024-05-21 09:34:07] [INFO ] Implicit Places using invariants in 118 ms returned [2, 23, 120, 122, 124, 130, 135, 136]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 127 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/168 places, 67/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 131 transition count 65
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 129 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 128 transition count 64
Applied a total of 6 rules in 5 ms. Remains 128 /131 variables (removed 3) and now considering 64/67 (removed 3) transitions.
// Phase 1: matrix 64 rows 128 cols
[2024-05-21 09:34:07] [INFO ] Computed 65 invariants in 1 ms
[2024-05-21 09:34:07] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-21 09:34:07] [INFO ] Invariant cache hit.
[2024-05-21 09:34:07] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 128/168 places, 64/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 346 ms. Remains : 128/168 places, 64/96 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-07
Product exploration explored 100000 steps with 1503 reset in 366 ms.
Product exploration explored 100000 steps with 1481 reset in 398 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 158 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 61 steps (0 resets) in 4 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 183 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 5 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-21 09:34:08] [INFO ] Invariant cache hit.
[2024-05-21 09:34:09] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 09:34:09] [INFO ] Invariant cache hit.
[2024-05-21 09:34:09] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-05-21 09:34:09] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2024-05-21 09:34:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 669 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1624 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 2300ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2303ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2494 ms. Remains : 128/128 places, 64/64 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 181 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 16 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 176 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1491 reset in 364 ms.
Product exploration explored 100000 steps with 1495 reset in 406 ms.
Built C files in :
/tmp/ltsmin11449680146729742027
[2024-05-21 09:34:12] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2024-05-21 09:34:12] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:34:12] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2024-05-21 09:34:12] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:34:12] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2024-05-21 09:34:12] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:34:12] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11449680146729742027
Running compilation step : cd /tmp/ltsmin11449680146729742027;'/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 212 ms.
Running link step : cd /tmp/ltsmin11449680146729742027;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin11449680146729742027;'/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/stateBased8820428877712291992.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 20 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-21 09:34:28] [INFO ] Invariant cache hit.
[2024-05-21 09:34:28] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-21 09:34:28] [INFO ] Invariant cache hit.
[2024-05-21 09:34:28] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2024-05-21 09:34:28] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2024-05-21 09:34:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 644 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1599 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 2250ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2251ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2472 ms. Remains : 128/128 places, 64/64 transitions.
Built C files in :
/tmp/ltsmin14555099534032537098
[2024-05-21 09:34:30] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2024-05-21 09:34:30] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:34:30] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2024-05-21 09:34:30] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:34:30] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2024-05-21 09:34:30] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:34:30] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14555099534032537098
Running compilation step : cd /tmp/ltsmin14555099534032537098;'/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 205 ms.
Running link step : cd /tmp/ltsmin14555099534032537098;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin14555099534032537098;'/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/stateBased14774664635464868428.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 09:34:45] [INFO ] Flatten gal took : 5 ms
[2024-05-21 09:34:45] [INFO ] Flatten gal took : 7 ms
[2024-05-21 09:34:45] [INFO ] Time to serialize gal into /tmp/LTL13444854236662546937.gal : 4 ms
[2024-05-21 09:34:45] [INFO ] Time to serialize properties into /tmp/LTL9546675672192926575.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/LTL13444854236662546937.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12228477357686818914.hoa' '-atoms' '/tmp/LTL9546675672192926575.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/LTL9546675672192926575.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12228477357686818914.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-21 09:35:00] [INFO ] Flatten gal took : 4 ms
[2024-05-21 09:35:00] [INFO ] Flatten gal took : 5 ms
[2024-05-21 09:35:00] [INFO ] Time to serialize gal into /tmp/LTL6136994556796917804.gal : 1 ms
[2024-05-21 09:35:00] [INFO ] Time to serialize properties into /tmp/LTL9570441937517402039.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/LTL6136994556796917804.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9570441937517402039.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((Section_48>=1)&&(F49>=1))"))))
Formula 0 simplified : FG!"((Section_48>=1)&&(F49>=1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-21 09:35:15] [INFO ] Flatten gal took : 9 ms
[2024-05-21 09:35:15] [INFO ] Applying decomposition
[2024-05-21 09:35:15] [INFO ] Flatten gal took : 4 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/graph1504591293522669803.txt' '-o' '/tmp/graph1504591293522669803.bin' '-w' '/tmp/graph1504591293522669803.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1504591293522669803.bin' '-l' '-1' '-v' '-w' '/tmp/graph1504591293522669803.weights' '-q' '0' '-e' '0.001'
[2024-05-21 09:35:15] [INFO ] Decomposing Gal with order
[2024-05-21 09:35:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 09:35:15] [INFO ] Flatten gal took : 8 ms
[2024-05-21 09:35:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 09:35:15] [INFO ] Time to serialize gal into /tmp/LTL5941424015721730552.gal : 2 ms
[2024-05-21 09:35:15] [INFO ] Time to serialize properties into /tmp/LTL12905260207343520379.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/LTL5941424015721730552.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12905260207343520379.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i12.i0.u39.Section_48>=1)&&(i12.i1.u59.F49>=1))"))))
Formula 0 simplified : FG!"((i12.i0.u39.Section_48>=1)&&(i12.i1.u59.F49>=1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-096-LTLFireability-07 finished in 83683 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 168 transition count 78
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 150 transition count 78
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 36 place count 150 transition count 72
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 48 place count 144 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 60 place count 138 transition count 66
Applied a total of 60 rules in 12 ms. Remains 138 /168 variables (removed 30) and now considering 66/96 (removed 30) transitions.
// Phase 1: matrix 66 rows 138 cols
[2024-05-21 09:35:30] [INFO ] Computed 73 invariants in 1 ms
[2024-05-21 09:35:30] [INFO ] Implicit Places using invariants in 111 ms returned [2, 23, 119, 121, 123, 129, 134, 135]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 128 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/168 places, 66/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 130 transition count 64
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 128 transition count 64
Applied a total of 4 rules in 3 ms. Remains 128 /130 variables (removed 2) and now considering 64/66 (removed 2) transitions.
// Phase 1: matrix 64 rows 128 cols
[2024-05-21 09:35:31] [INFO ] Computed 65 invariants in 4 ms
[2024-05-21 09:35:31] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-21 09:35:31] [INFO ] Invariant cache hit.
[2024-05-21 09:35:31] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 128/168 places, 64/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 353 ms. Remains : 128/168 places, 64/96 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 320 ms.
Product exploration explored 100000 steps with 0 reset in 389 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 144 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 30 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 295 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2024-05-21 09:35:32] [INFO ] Invariant cache hit.
[2024-05-21 09:35:32] [INFO ] [Real]Absence check using 63 positive place invariants in 9 ms returned sat
[2024-05-21 09:35:32] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-21 09:35:32] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-21 09:35:32] [INFO ] Computed and/alt/rep : 32/64/32 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-21 09:35:32] [INFO ] Added : 30 causal constraints over 6 iterations in 72 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-21 09:35:32] [INFO ] Invariant cache hit.
[2024-05-21 09:35:32] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-21 09:35:32] [INFO ] Invariant cache hit.
[2024-05-21 09:35:32] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2024-05-21 09:35:32] [INFO ] Redundant transitions in 0 ms returned []
Running 32 sub problems to find dead transitions.
[2024-05-21 09:35:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 660 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1589 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 2253ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2253ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2457 ms. Remains : 128/128 places, 64/64 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 181 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
RANDOM walk for 101 steps (0 resets) in 6 ms. (14 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 176 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2024-05-21 09:35:35] [INFO ] Invariant cache hit.
[2024-05-21 09:35:35] [INFO ] [Real]Absence check using 63 positive place invariants in 9 ms returned sat
[2024-05-21 09:35:35] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-21 09:35:35] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-05-21 09:35:35] [INFO ] Computed and/alt/rep : 32/64/32 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-21 09:35:35] [INFO ] Added : 30 causal constraints over 6 iterations in 70 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 319 ms.
Product exploration explored 100000 steps with 0 reset in 444 ms.
Built C files in :
/tmp/ltsmin10872525492937659344
[2024-05-21 09:35:36] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2024-05-21 09:35:36] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:35:36] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2024-05-21 09:35:36] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:35:36] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2024-05-21 09:35:36] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:35:36] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10872525492937659344
Running compilation step : cd /tmp/ltsmin10872525492937659344;'/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 188 ms.
Running link step : cd /tmp/ltsmin10872525492937659344;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10872525492937659344;'/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/stateBased7798702697875162549.hoa' '--buchi-type=spotba'
LTSmin run took 233 ms.
FORMULA CircularTrains-PT-096-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-096-LTLFireability-08 finished in 6346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(((X(p0)||F(!p1)) U (G((X(p0)||F(!p1)))||(!p2&&(X(p0)||F(!p1)))))))||(!p2&&F(((X(p0)||F(!p1)) U (G((X(p0)||F(!p1)))||(!p2&&(X(p0)||F(!p1))))))))))'
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 168 cols
[2024-05-21 09:35:37] [INFO ] Computed 73 invariants in 2 ms
[2024-05-21 09:35:37] [INFO ] Implicit Places using invariants in 98 ms returned [3, 146, 148, 150, 158, 163, 164]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 99 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 101 ms. Remains : 161/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), false]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-09
Product exploration explored 100000 steps with 5604 reset in 400 ms.
Product exploration explored 100000 steps with 5634 reset in 424 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 p2 (NOT p1) p0), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND p2 p1 (NOT p0)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p1 p0))), (X (X (NOT (AND p2 p1 p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 515 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), false]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (8 resets) in 421 ms. (94 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 1/1 properties
// Phase 1: matrix 96 rows 161 cols
[2024-05-21 09:35:39] [INFO ] Computed 66 invariants in 2 ms
Problem apf2 is UNSAT
After SMT solving in domain Real declared 4/257 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 15 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, Generalized P Invariants (flows): 0/3 constraints, State Equation: 0/161 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 18ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND p2 p1 (NOT p0))))), (G (OR (NOT p1) p0 (NOT p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p1 p0))), (X (X (NOT (AND p2 p1 p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p1) p0))), (F p1), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 700 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-21 09:35:40] [INFO ] Invariant cache hit.
[2024-05-21 09:35:40] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 09:35:40] [INFO ] Invariant cache hit.
[2024-05-21 09:35:40] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-21 09:35:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/160 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/161 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 227 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1566 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/160 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/161 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 64/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 291 constraints, problems are : Problem set: 0 solved, 64 unsolved in 3858 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 5431ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 5432ms
Finished structural reductions in LTL mode , in 1 iterations and 5624 ms. Remains : 161/161 places, 96/96 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X p0)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 373 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 278 steps (0 resets) in 9 ms. (27 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X p0)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 3 factoid took 454 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 5559 reset in 416 ms.
Product exploration explored 100000 steps with 5561 reset in 425 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 161 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 161 transition count 96
Deduced a syphon composed of 31 places in 0 ms
Applied a total of 31 rules in 8 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-21 09:35:47] [INFO ] Redundant transitions in 2 ms returned []
Running 64 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 161 cols
[2024-05-21 09:35:47] [INFO ] Computed 66 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/160 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-21 09:35:48] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-21 09:35:48] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-21 09:35:48] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-21 09:35:48] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-05-21 09:35:48] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 7 ms to minimize.
[2024-05-21 09:35:48] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-05-21 09:35:48] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2024-05-21 09:35:48] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
[2024-05-21 09:35:48] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2024-05-21 09:35:48] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-21 09:35:48] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
[2024-05-21 09:35:48] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-05-21 09:35:48] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2024-05-21 09:35:48] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-21 09:35:48] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 1 ms to minimize.
[2024-05-21 09:35:48] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-21 09:35:48] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-21 09:35:48] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-05-21 09:35:48] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-05-21 09:35:48] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 20/85 constraints. Problems are: Problem set: 20 solved, 44 unsolved
[2024-05-21 09:35:48] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-21 09:35:48] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 2/87 constraints. Problems are: Problem set: 22 solved, 42 unsolved
[2024-05-21 09:35:48] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-21 09:35:48] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-21 09:35:49] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-21 09:35:49] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-05-21 09:35:49] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 2 ms to minimize.
[2024-05-21 09:35:49] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-05-21 09:35:49] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 7/94 constraints. Problems are: Problem set: 29 solved, 35 unsolved
[2024-05-21 09:35:49] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-21 09:35:49] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/96 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/96 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 1/161 variables, 1/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 96/257 variables, 161/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 0/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 12 (OVERLAPS) 0/257 variables, 0/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 258 constraints, problems are : Problem set: 31 solved, 33 unsolved in 2236 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 31 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 94/160 variables, 63/63 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 2/65 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 31/96 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/96 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/161 variables, 1/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 96/257 variables, 161/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 33/291 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/291 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/257 variables, 0/291 constraints. Problems are: Problem set: 31 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 291 constraints, problems are : Problem set: 31 solved, 33 unsolved in 1310 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 33/64 constraints, Known Traps: 31/31 constraints]
After SMT, in 3556ms problems are : Problem set: 31 solved, 33 unsolved
Search for dead transitions found 31 dead transitions in 3557ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 161/161 places, 65/96 transitions.
Graph (complete) has 260 edges and 161 vertex of which 130 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.2 ms
Discarding 31 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 130 /161 variables (removed 31) and now considering 65/65 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 130/161 places, 65/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3582 ms. Remains : 130/161 places, 65/96 transitions.
Built C files in :
/tmp/ltsmin14923937054664630108
[2024-05-21 09:35:51] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14923937054664630108
Running compilation step : cd /tmp/ltsmin14923937054664630108;'/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 207 ms.
Running link step : cd /tmp/ltsmin14923937054664630108;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin14923937054664630108;'/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/stateBased4346459687908107428.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 161 cols
[2024-05-21 09:36:06] [INFO ] Computed 66 invariants in 3 ms
[2024-05-21 09:36:06] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-21 09:36:06] [INFO ] Invariant cache hit.
[2024-05-21 09:36:06] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-21 09:36:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/160 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/161 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 227 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1562 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/160 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/161 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 64/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 291 constraints, problems are : Problem set: 0 solved, 64 unsolved in 3926 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 5496ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 5497ms
Finished structural reductions in LTL mode , in 1 iterations and 5703 ms. Remains : 161/161 places, 96/96 transitions.
Built C files in :
/tmp/ltsmin6969599083587594616
[2024-05-21 09:36:12] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6969599083587594616
Running compilation step : cd /tmp/ltsmin6969599083587594616;'/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 222 ms.
Running link step : cd /tmp/ltsmin6969599083587594616;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6969599083587594616;'/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/stateBased11005963366059577492.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 09:36:27] [INFO ] Flatten gal took : 5 ms
[2024-05-21 09:36:27] [INFO ] Flatten gal took : 4 ms
[2024-05-21 09:36:27] [INFO ] Time to serialize gal into /tmp/LTL1944863549893741295.gal : 1 ms
[2024-05-21 09:36:27] [INFO ] Time to serialize properties into /tmp/LTL10023846138349967450.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/LTL1944863549893741295.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2662669499179695140.hoa' '-atoms' '/tmp/LTL10023846138349967450.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...318
Loading property file /tmp/LTL10023846138349967450.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2662669499179695140.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-21 09:36:42] [INFO ] Flatten gal took : 7 ms
[2024-05-21 09:36:42] [INFO ] Flatten gal took : 3 ms
[2024-05-21 09:36:42] [INFO ] Time to serialize gal into /tmp/LTL5262785161201698756.gal : 1 ms
[2024-05-21 09:36:42] [INFO ] Time to serialize properties into /tmp/LTL17461414762340320916.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/LTL5262785161201698756.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17461414762340320916.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 : !((F((G(F(((X("(((Section_48>=1)&&(F49>=1))||(!((F14>=1)&&(Section_13>=1))))"))||(F(!("((F14>=1)&&(Section_13>=1))"))))U((G((X("(((Sec...823
Formula 0 simplified : G(FG("((Section_48>=1)&&(F49>=1))" U (X!"(((Section_48>=1)&&(F49>=1))||(!((F14>=1)&&(Section_13>=1))))" & G"((F14>=1)&&(Section_13>=...333
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-21 09:36:57] [INFO ] Flatten gal took : 7 ms
[2024-05-21 09:36:57] [INFO ] Applying decomposition
[2024-05-21 09:36:57] [INFO ] Flatten gal took : 5 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/graph11504304298343615557.txt' '-o' '/tmp/graph11504304298343615557.bin' '-w' '/tmp/graph11504304298343615557.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11504304298343615557.bin' '-l' '-1' '-v' '-w' '/tmp/graph11504304298343615557.weights' '-q' '0' '-e' '0.001'
[2024-05-21 09:36:57] [INFO ] Decomposing Gal with order
[2024-05-21 09:36:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 09:36:57] [INFO ] Flatten gal took : 6 ms
[2024-05-21 09:36:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 09:36:57] [INFO ] Time to serialize gal into /tmp/LTL10089301485269716644.gal : 1 ms
[2024-05-21 09:36:57] [INFO ] Time to serialize properties into /tmp/LTL11319694731524061112.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/LTL10089301485269716644.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11319694731524061112.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...256
Read 1 LTL properties
Checking formula 0 : !((F((G(F(((X("(((i3.u22.Section_48>=1)&&(i3.u22.F49>=1))||(!((i11.u18.F14>=1)&&(i11.u18.Section_13>=1))))"))||(F(!("((i11.u18.F14>=1)...1141
Formula 0 simplified : G(FG("((i3.u22.Section_48>=1)&&(i3.u22.F49>=1))" U (X!"(((i3.u22.Section_48>=1)&&(i3.u22.F49>=1))||(!((i11.u18.F14>=1)&&(i11.u18.Sec...467
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-096-LTLFireability-09 finished in 95472 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(X(((G(p0) U p1)||F(p2)))))))'
Support contains 6 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 168 cols
[2024-05-21 09:37:12] [INFO ] Computed 73 invariants in 2 ms
[2024-05-21 09:37:12] [INFO ] Implicit Places using invariants in 95 ms returned [3, 29, 146, 148, 150, 158, 163]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 95 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 97 ms. Remains : 161/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-10
Product exploration explored 100000 steps with 6404 reset in 356 ms.
Product exploration explored 100000 steps with 6543 reset in 389 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) p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 84 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
RANDOM walk for 461 steps (0 resets) in 9 ms. (46 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2)]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2))), (F p0), (F (NOT (OR p0 p1 p2))), (F p1), (F (NOT p2)), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 1 factoid took 240 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Support contains 6 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 161 cols
[2024-05-21 09:37:14] [INFO ] Computed 66 invariants in 2 ms
[2024-05-21 09:37:15] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 09:37:15] [INFO ] Invariant cache hit.
[2024-05-21 09:37:15] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-21 09:37:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 62/159 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 2/161 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 227 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1534 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 62/159 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 2/161 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 64/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 291 constraints, problems are : Problem set: 0 solved, 64 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 6555ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 6556ms
Finished structural reductions in LTL mode , in 1 iterations and 6744 ms. Remains : 161/161 places, 96/96 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
RANDOM walk for 322 steps (0 resets) in 14 ms. (21 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2)]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2))), (F p0), (F (NOT (OR p0 p1 p2))), (F p1), (F (NOT p2)), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 1 factoid took 344 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 278 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 6925 reset in 363 ms.
Product exploration explored 100000 steps with 6816 reset in 382 ms.
Applying partial POR strategy [false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 305 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Support contains 6 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 161 transition count 96
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 28 place count 161 transition count 96
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 161 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 161 transition count 96
Deduced a syphon composed of 31 places in 0 ms
Applied a total of 31 rules in 11 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-21 09:37:24] [INFO ] Redundant transitions in 2 ms returned []
Running 64 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 161 cols
[2024-05-21 09:37:24] [INFO ] Computed 66 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 62/159 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-21 09:37:24] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-21 09:37:24] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-21 09:37:24] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-21 09:37:24] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-21 09:37:24] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-05-21 09:37:24] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-05-21 09:37:24] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-05-21 09:37:24] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2024-05-21 09:37:24] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-21 09:37:24] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 6 ms to minimize.
[2024-05-21 09:37:24] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-21 09:37:24] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
[2024-05-21 09:37:25] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-05-21 09:37:25] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
Problem TDEAD62 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD51 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 14/78 constraints. Problems are: Problem set: 14 solved, 50 unsolved
[2024-05-21 09:37:25] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-21 09:37:25] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-21 09:37:25] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-05-21 09:37:25] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-21 09:37:25] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
[2024-05-21 09:37:25] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-05-21 09:37:25] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-21 09:37:25] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-05-21 09:37:25] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-05-21 09:37:25] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-05-21 09:37:25] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD32 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 11/89 constraints. Problems are: Problem set: 25 solved, 39 unsolved
[2024-05-21 09:37:25] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-21 09:37:25] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-21 09:37:25] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-21 09:37:25] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-21 09:37:25] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-05-21 09:37:25] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 6/95 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/95 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 2/161 variables, 2/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 96/257 variables, 161/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 0/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 11 (OVERLAPS) 0/257 variables, 0/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 258 constraints, problems are : Problem set: 31 solved, 33 unsolved in 2104 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 31 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 93/159 variables, 62/62 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 31/95 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/95 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 2/161 variables, 2/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 96/257 variables, 161/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 33/291 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/291 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/257 variables, 0/291 constraints. Problems are: Problem set: 31 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 291 constraints, problems are : Problem set: 31 solved, 33 unsolved in 1456 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 33/64 constraints, Known Traps: 31/31 constraints]
After SMT, in 3573ms problems are : Problem set: 31 solved, 33 unsolved
Search for dead transitions found 31 dead transitions in 3574ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 161/161 places, 65/96 transitions.
Graph (complete) has 260 edges and 161 vertex of which 130 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 130 /161 variables (removed 31) and now considering 65/65 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 130/161 places, 65/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3599 ms. Remains : 130/161 places, 65/96 transitions.
Built C files in :
/tmp/ltsmin3550988100261854992
[2024-05-21 09:37:27] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3550988100261854992
Running compilation step : cd /tmp/ltsmin3550988100261854992;'/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 208 ms.
Running link step : cd /tmp/ltsmin3550988100261854992;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin3550988100261854992;'/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/stateBased9724323440267447957.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 161 cols
[2024-05-21 09:37:43] [INFO ] Computed 66 invariants in 1 ms
[2024-05-21 09:37:43] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-21 09:37:43] [INFO ] Invariant cache hit.
[2024-05-21 09:37:43] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-21 09:37:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 62/159 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 2/161 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 227 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1471 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 62/159 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 2/161 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 64/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 291 constraints, problems are : Problem set: 0 solved, 64 unsolved in 4982 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 6459ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 6460ms
Finished structural reductions in LTL mode , in 1 iterations and 6659 ms. Remains : 161/161 places, 96/96 transitions.
Built C files in :
/tmp/ltsmin624043064481211463
[2024-05-21 09:37:49] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin624043064481211463
Running compilation step : cd /tmp/ltsmin624043064481211463;'/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 218 ms.
Running link step : cd /tmp/ltsmin624043064481211463;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin624043064481211463;'/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/stateBased3611937901046111555.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 09:38:04] [INFO ] Flatten gal took : 6 ms
[2024-05-21 09:38:04] [INFO ] Flatten gal took : 4 ms
[2024-05-21 09:38:04] [INFO ] Time to serialize gal into /tmp/LTL18241752411772235319.gal : 1 ms
[2024-05-21 09:38:04] [INFO ] Time to serialize properties into /tmp/LTL16818385391909463154.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/LTL18241752411772235319.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2095885374200363660.hoa' '-atoms' '/tmp/LTL16818385391909463154.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/LTL16818385391909463154.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2095885374200363660.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-21 09:38:19] [INFO ] Flatten gal took : 6 ms
[2024-05-21 09:38:19] [INFO ] Flatten gal took : 3 ms
[2024-05-21 09:38:19] [INFO ] Time to serialize gal into /tmp/LTL2834905741370242413.gal : 1 ms
[2024-05-21 09:38:19] [INFO ] Time to serialize properties into /tmp/LTL15288229850463298907.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/LTL2834905741370242413.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15288229850463298907.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 : !((X(X(X(X(((G("((F6>=1)&&(Section_5>=1))"))U("((Section_49>=1)&&(F50>=1))"))||(F("((F76>=1)&&(Section_75>=1))"))))))))
Formula 0 simplified : XXXX((F!"((F6>=1)&&(Section_5>=1))" R !"((Section_49>=1)&&(F50>=1))") & G!"((F76>=1)&&(Section_75>=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-21 09:38:34] [INFO ] Flatten gal took : 4 ms
[2024-05-21 09:38:34] [INFO ] Applying decomposition
[2024-05-21 09:38:34] [INFO ] Flatten gal took : 3 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/graph2226702322875749317.txt' '-o' '/tmp/graph2226702322875749317.bin' '-w' '/tmp/graph2226702322875749317.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2226702322875749317.bin' '-l' '-1' '-v' '-w' '/tmp/graph2226702322875749317.weights' '-q' '0' '-e' '0.001'
[2024-05-21 09:38:34] [INFO ] Decomposing Gal with order
[2024-05-21 09:38:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 09:38:34] [INFO ] Flatten gal took : 6 ms
[2024-05-21 09:38:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 09:38:34] [INFO ] Time to serialize gal into /tmp/LTL15837668383313817637.gal : 2 ms
[2024-05-21 09:38:34] [INFO ] Time to serialize properties into /tmp/LTL16449287371755413763.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/LTL15837668383313817637.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16449287371755413763.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...256
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(((G("((i12.u26.F6>=1)&&(i13.u0.Section_5>=1))"))U("((i9.u19.Section_49>=1)&&(i9.u30.F50>=1))"))||(F("((i0.u15.F76>=1)&&(i0....183
Formula 0 simplified : XXXX((F!"((i12.u26.F6>=1)&&(i13.u0.Section_5>=1))" R !"((i9.u19.Section_49>=1)&&(i9.u30.F50>=1))") & G!"((i0.u15.F76>=1)&&(i0.u15.Se...170
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-096-LTLFireability-10 finished in 97349 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 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 168 cols
[2024-05-21 09:38:50] [INFO ] Computed 73 invariants in 0 ms
[2024-05-21 09:38:50] [INFO ] Implicit Places using invariants in 83 ms returned [3, 29, 146, 148, 150, 158, 163, 164]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 84 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 87 ms. Remains : 160/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-11
Product exploration explored 100000 steps with 1483 reset in 362 ms.
Product exploration explored 100000 steps with 1461 reset in 375 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 278 steps (0 resets) in 5 ms. (46 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 96 rows 160 cols
[2024-05-21 09:38:51] [INFO ] Computed 65 invariants in 2 ms
[2024-05-21 09:38:51] [INFO ] [Real]Absence check using 63 positive place invariants in 9 ms returned sat
[2024-05-21 09:38:51] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-21 09:38:51] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-21 09:38:51] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-21 09:38:51] [INFO ] Added : 61 causal constraints over 13 iterations in 232 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 96/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 160 transition count 66
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 130 transition count 66
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 60 place count 130 transition count 64
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 128 transition count 64
Applied a total of 64 rules in 11 ms. Remains 128 /160 variables (removed 32) and now considering 64/96 (removed 32) transitions.
// Phase 1: matrix 64 rows 128 cols
[2024-05-21 09:38:51] [INFO ] Computed 65 invariants in 1 ms
[2024-05-21 09:38:51] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-21 09:38:51] [INFO ] Invariant cache hit.
[2024-05-21 09:38:52] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-05-21 09:38:52] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2024-05-21 09:38:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 621 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1377 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 2003ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2004ms
Starting structural reductions in SI_LTL mode, iteration 1 : 128/160 places, 64/96 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2205 ms. Remains : 128/160 places, 64/96 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 105 steps (0 resets) in 5 ms. (17 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
[2024-05-21 09:38:54] [INFO ] Invariant cache hit.
[2024-05-21 09:38:54] [INFO ] [Real]Absence check using 63 positive place invariants in 24 ms returned sat
[2024-05-21 09:38:54] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 09:38:54] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-05-21 09:38:54] [INFO ] Computed and/alt/rep : 32/64/32 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-21 09:38:54] [INFO ] Added : 30 causal constraints over 6 iterations in 71 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2893 reset in 366 ms.
Product exploration explored 100000 steps with 2865 reset in 408 ms.
Built C files in :
/tmp/ltsmin9488186278617961154
[2024-05-21 09:38:55] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2024-05-21 09:38:55] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:38:55] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2024-05-21 09:38:55] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:38:55] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2024-05-21 09:38:55] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:38:55] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9488186278617961154
Running compilation step : cd /tmp/ltsmin9488186278617961154;'/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 198 ms.
Running link step : cd /tmp/ltsmin9488186278617961154;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin9488186278617961154;'/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/stateBased12671125496297078678.hoa' '--buchi-type=spotba'
LTSmin run took 198 ms.
FORMULA CircularTrains-PT-096-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-096-LTLFireability-11 finished in 6060 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(G(p1)))))'
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 168 cols
[2024-05-21 09:38:56] [INFO ] Computed 73 invariants in 1 ms
[2024-05-21 09:38:56] [INFO ] Implicit Places using invariants in 89 ms returned [3, 29, 146, 148, 150, 158, 164]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 100 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/168 places, 96/96 transitions.
Applied a total of 0 rules in 0 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 102 ms. Remains : 161/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 321 ms.
Product exploration explored 100000 steps with 0 reset in 392 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 p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 168 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 260 steps (0 resets) in 6 ms. (37 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 220 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 161 cols
[2024-05-21 09:38:57] [INFO ] Computed 66 invariants in 1 ms
[2024-05-21 09:38:58] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 09:38:58] [INFO ] Invariant cache hit.
[2024-05-21 09:38:58] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-21 09:38:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 63/160 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 1/161 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 227 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1675 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 63/160 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 1/161 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 64/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 291 constraints, problems are : Problem set: 0 solved, 64 unsolved in 4587 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 6268ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 6268ms
Finished structural reductions in LTL mode , in 1 iterations and 6452 ms. Remains : 161/161 places, 96/96 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 302 steps (0 resets) in 10 ms. (27 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 244 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 331 ms.
Product exploration explored 100000 steps with 0 reset in 405 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 161 transition count 96
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 28 place count 161 transition count 96
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 161 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 161 transition count 96
Deduced a syphon composed of 31 places in 0 ms
Applied a total of 31 rules in 13 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-21 09:39:06] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 161 cols
[2024-05-21 09:39:06] [INFO ] Computed 66 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 63/160 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-21 09:39:06] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-21 09:39:06] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-21 09:39:06] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-21 09:39:06] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2024-05-21 09:39:07] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-05-21 09:39:07] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
[2024-05-21 09:39:07] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2024-05-21 09:39:07] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
[2024-05-21 09:39:07] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-21 09:39:07] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-21 09:39:07] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2024-05-21 09:39:07] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-05-21 09:39:07] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-21 09:39:07] [INFO ] Deduced a trap composed of 2 places in 12 ms of which 1 ms to minimize.
[2024-05-21 09:39:07] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-21 09:39:07] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-05-21 09:39:07] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-05-21 09:39:07] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-05-21 09:39:07] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-05-21 09:39:07] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 20/85 constraints. Problems are: Problem set: 20 solved, 44 unsolved
[2024-05-21 09:39:07] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-21 09:39:07] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-21 09:39:07] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-21 09:39:07] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-05-21 09:39:07] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-05-21 09:39:07] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-05-21 09:39:07] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-21 09:39:07] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD51 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 8/93 constraints. Problems are: Problem set: 28 solved, 36 unsolved
[2024-05-21 09:39:07] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-21 09:39:07] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-21 09:39:07] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 3/96 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/96 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 1/161 variables, 1/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 96/257 variables, 161/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 0/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 12 (OVERLAPS) 0/257 variables, 0/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 258 constraints, problems are : Problem set: 31 solved, 33 unsolved in 2249 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 31 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 94/160 variables, 63/63 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 2/65 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 31/96 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/96 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/161 variables, 1/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 96/257 variables, 161/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 33/291 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/291 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/257 variables, 0/291 constraints. Problems are: Problem set: 31 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 291 constraints, problems are : Problem set: 31 solved, 33 unsolved in 1683 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 33/64 constraints, Known Traps: 31/31 constraints]
After SMT, in 3941ms problems are : Problem set: 31 solved, 33 unsolved
Search for dead transitions found 31 dead transitions in 3943ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 161/161 places, 65/96 transitions.
Graph (complete) has 260 edges and 161 vertex of which 130 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.4 ms
Discarding 31 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 130 /161 variables (removed 31) and now considering 65/65 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 130/161 places, 65/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3975 ms. Remains : 130/161 places, 65/96 transitions.
Built C files in :
/tmp/ltsmin2181637097730222029
[2024-05-21 09:39:10] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2181637097730222029
Running compilation step : cd /tmp/ltsmin2181637097730222029;'/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 210 ms.
Running link step : cd /tmp/ltsmin2181637097730222029;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin2181637097730222029;'/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/stateBased1881612067862935056.hoa' '--buchi-type=spotba'
LTSmin run took 830 ms.
FORMULA CircularTrains-PT-096-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-096-LTLFireability-12 finished in 15386 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 168 transition count 79
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 35 place count 151 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 150 transition count 78
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 36 place count 150 transition count 72
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 48 place count 144 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 60 place count 138 transition count 66
Applied a total of 60 rules in 5 ms. Remains 138 /168 variables (removed 30) and now considering 66/96 (removed 30) transitions.
// Phase 1: matrix 66 rows 138 cols
[2024-05-21 09:39:11] [INFO ] Computed 73 invariants in 0 ms
[2024-05-21 09:39:11] [INFO ] Implicit Places using invariants in 114 ms returned [2, 23, 119, 121, 123, 134, 135]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 115 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/168 places, 66/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 131 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 130 transition count 65
Applied a total of 2 rules in 2 ms. Remains 130 /131 variables (removed 1) and now considering 65/66 (removed 1) transitions.
// Phase 1: matrix 65 rows 130 cols
[2024-05-21 09:39:11] [INFO ] Computed 66 invariants in 0 ms
[2024-05-21 09:39:11] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 09:39:11] [INFO ] Invariant cache hit.
[2024-05-21 09:39:11] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 130/168 places, 65/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 276 ms. Remains : 130/168 places, 65/96 transitions.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 334 ms.
Product exploration explored 100000 steps with 0 reset in 413 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 258 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 144 steps (0 resets) in 6 ms. (20 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 1 factoid took 329 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-21 09:39:13] [INFO ] Invariant cache hit.
[2024-05-21 09:39:13] [INFO ] [Real]Absence check using 63 positive place invariants in 8 ms returned sat
[2024-05-21 09:39:13] [INFO ] [Real]Absence check using 63 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-21 09:39:13] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-21 09:39:13] [INFO ] Computed and/alt/rep : 33/65/33 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-21 09:39:13] [INFO ] Added : 30 causal constraints over 6 iterations in 80 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 65/65 transitions.
Applied a total of 0 rules in 2 ms. Remains 130 /130 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-21 09:39:13] [INFO ] Invariant cache hit.
[2024-05-21 09:39:13] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 09:39:13] [INFO ] Invariant cache hit.
[2024-05-21 09:39:13] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2024-05-21 09:39:13] [INFO ] Redundant transitions in 1 ms returned []
Running 33 sub problems to find dead transitions.
[2024-05-21 09:39:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 63/129 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 196 constraints, problems are : Problem set: 0 solved, 33 unsolved in 738 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 63/129 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 33/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 229 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1405 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 2147ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 2147ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2313 ms. Remains : 130/130 places, 65/65 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 254 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 201 steps (0 resets) in 6 ms. (28 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 1 factoid took 271 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-21 09:39:16] [INFO ] Invariant cache hit.
[2024-05-21 09:39:17] [INFO ] [Real]Absence check using 63 positive place invariants in 9 ms returned sat
[2024-05-21 09:39:17] [INFO ] [Real]Absence check using 63 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-21 09:39:17] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-21 09:39:17] [INFO ] Computed and/alt/rep : 33/65/33 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-21 09:39:17] [INFO ] Added : 30 causal constraints over 6 iterations in 72 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 320 ms.
Product exploration explored 100000 steps with 0 reset in 396 ms.
Built C files in :
/tmp/ltsmin13389382663104510780
[2024-05-21 09:39:18] [INFO ] Computing symmetric may disable matrix : 65 transitions.
[2024-05-21 09:39:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:39:18] [INFO ] Computing symmetric may enable matrix : 65 transitions.
[2024-05-21 09:39:18] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:39:18] [INFO ] Computing Do-Not-Accords matrix : 65 transitions.
[2024-05-21 09:39:18] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:39:18] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13389382663104510780
Running compilation step : cd /tmp/ltsmin13389382663104510780;'/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 182 ms.
Running link step : cd /tmp/ltsmin13389382663104510780;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin13389382663104510780;'/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/stateBased9316202845529599462.hoa' '--buchi-type=spotba'
LTSmin run took 236 ms.
FORMULA CircularTrains-PT-096-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-096-LTLFireability-13 finished in 7048 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 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 168 cols
[2024-05-21 09:39:18] [INFO ] Computed 73 invariants in 0 ms
[2024-05-21 09:39:18] [INFO ] Implicit Places using invariants in 86 ms returned [3, 29, 146, 148, 150, 158, 163, 164]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 86 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 88 ms. Remains : 160/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-15
Product exploration explored 100000 steps with 1486 reset in 354 ms.
Product exploration explored 100000 steps with 1488 reset in 378 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 (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 99 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 361 steps (0 resets) in 7 ms. (45 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 9 factoid took 110 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 96 rows 160 cols
[2024-05-21 09:39:20] [INFO ] Computed 65 invariants in 0 ms
[2024-05-21 09:39:20] [INFO ] [Real]Absence check using 63 positive place invariants in 10 ms returned sat
[2024-05-21 09:39:20] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-21 09:39:20] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2024-05-21 09:39:20] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-21 09:39:20] [INFO ] Added : 61 causal constraints over 13 iterations in 189 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 160 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-21 09:39:20] [INFO ] Invariant cache hit.
[2024-05-21 09:39:20] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 09:39:20] [INFO ] Invariant cache hit.
[2024-05-21 09:39:20] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-21 09:39:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/159 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/256 variables, 160/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/256 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 225 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1508 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/159 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/256 variables, 160/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 64/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/256 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 289 constraints, problems are : Problem set: 0 solved, 64 unsolved in 4103 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 5617ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 5617ms
Finished structural reductions in LTL mode , in 1 iterations and 5797 ms. Remains : 160/160 places, 96/96 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 62 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 214 steps (0 resets) in 5 ms. (35 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-21 09:39:26] [INFO ] Invariant cache hit.
[2024-05-21 09:39:26] [INFO ] [Real]Absence check using 63 positive place invariants in 9 ms returned sat
[2024-05-21 09:39:26] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-21 09:39:26] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-05-21 09:39:26] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-21 09:39:27] [INFO ] Added : 61 causal constraints over 13 iterations in 278 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1507 reset in 356 ms.
Product exploration explored 100000 steps with 1482 reset in 383 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 96/96 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 160 transition count 96
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 30 place count 160 transition count 96
Deduced a syphon composed of 32 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 160 transition count 96
Deduced a syphon composed of 32 places in 0 ms
Applied a total of 32 rules in 8 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-21 09:39:28] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 160 cols
[2024-05-21 09:39:28] [INFO ] Computed 65 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/159 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-21 09:39:28] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-05-21 09:39:28] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2024-05-21 09:39:28] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-21 09:39:28] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-05-21 09:39:28] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-05-21 09:39:28] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2024-05-21 09:39:28] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-21 09:39:28] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-21 09:39:28] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-21 09:39:28] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
[2024-05-21 09:39:28] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
[2024-05-21 09:39:28] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-05-21 09:39:28] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-05-21 09:39:29] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-05-21 09:39:29] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD59 is UNSAT
[2024-05-21 09:39:29] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-21 09:39:29] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD54 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 17/81 constraints. Problems are: Problem set: 17 solved, 47 unsolved
[2024-05-21 09:39:29] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-21 09:39:29] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2024-05-21 09:39:29] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
[2024-05-21 09:39:29] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2024-05-21 09:39:29] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-21 09:39:29] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-05-21 09:39:29] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 7/88 constraints. Problems are: Problem set: 24 solved, 40 unsolved
[2024-05-21 09:39:29] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-21 09:39:29] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-21 09:39:29] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-05-21 09:39:29] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-21 09:39:29] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2024-05-21 09:39:29] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 6/94 constraints. Problems are: Problem set: 30 solved, 34 unsolved
[2024-05-21 09:39:29] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-21 09:39:29] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD7 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 2/96 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/96 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 1/160 variables, 1/97 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/97 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 96/256 variables, 160/257 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/256 variables, 0/257 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 12 (OVERLAPS) 0/256 variables, 0/257 constraints. Problems are: Problem set: 32 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 257 constraints, problems are : Problem set: 32 solved, 32 unsolved in 2366 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 32 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 95/159 variables, 63/63 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 32/96 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/96 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 1/160 variables, 1/97 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/97 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 96/256 variables, 160/257 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 32/289 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 0/289 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 0/256 variables, 0/289 constraints. Problems are: Problem set: 32 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 289 constraints, problems are : Problem set: 32 solved, 32 unsolved in 1532 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 32/64 constraints, Known Traps: 32/32 constraints]
After SMT, in 3905ms problems are : Problem set: 32 solved, 32 unsolved
Search for dead transitions found 32 dead transitions in 3907ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 160/160 places, 64/96 transitions.
Graph (complete) has 256 edges and 160 vertex of which 128 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Discarding 32 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 128 /160 variables (removed 32) and now considering 64/64 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 128/160 places, 64/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3937 ms. Remains : 128/160 places, 64/96 transitions.
Built C files in :
/tmp/ltsmin6501386004673485991
[2024-05-21 09:39:32] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6501386004673485991
Running compilation step : cd /tmp/ltsmin6501386004673485991;'/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 227 ms.
Running link step : cd /tmp/ltsmin6501386004673485991;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin6501386004673485991;'/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/stateBased17163988168470770972.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 160 cols
[2024-05-21 09:39:47] [INFO ] Computed 65 invariants in 2 ms
[2024-05-21 09:39:47] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-21 09:39:47] [INFO ] Invariant cache hit.
[2024-05-21 09:39:47] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-21 09:39:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/159 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/256 variables, 160/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/256 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 225 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1535 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/159 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/256 variables, 160/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 64/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/256 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 289 constraints, problems are : Problem set: 0 solved, 64 unsolved in 4045 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 5586ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 5587ms
Finished structural reductions in LTL mode , in 1 iterations and 5784 ms. Remains : 160/160 places, 96/96 transitions.
Built C files in :
/tmp/ltsmin13306827084382259580
[2024-05-21 09:39:53] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13306827084382259580
Running compilation step : cd /tmp/ltsmin13306827084382259580;'/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 221 ms.
Running link step : cd /tmp/ltsmin13306827084382259580;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13306827084382259580;'/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/stateBased1196284158181011113.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 09:40:08] [INFO ] Flatten gal took : 16 ms
[2024-05-21 09:40:08] [INFO ] Flatten gal took : 15 ms
[2024-05-21 09:40:08] [INFO ] Time to serialize gal into /tmp/LTL9708076211075516631.gal : 4 ms
[2024-05-21 09:40:08] [INFO ] Time to serialize properties into /tmp/LTL1749671082724956632.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/LTL9708076211075516631.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14991870720256321193.hoa' '-atoms' '/tmp/LTL1749671082724956632.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...318
Loading property file /tmp/LTL1749671082724956632.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14991870720256321193.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-21 09:40:23] [INFO ] Flatten gal took : 4 ms
[2024-05-21 09:40:23] [INFO ] Flatten gal took : 4 ms
[2024-05-21 09:40:23] [INFO ] Time to serialize gal into /tmp/LTL4880512808036659414.gal : 1 ms
[2024-05-21 09:40:23] [INFO ] Time to serialize properties into /tmp/LTL5164614909627829968.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/LTL4880512808036659414.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5164614909627829968.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 : !(((F("((F87>=1)&&(Section_86>=1))"))||(X(G("((Section_11>=1)&&(F12>=1))")))))
Formula 0 simplified : G!"((F87>=1)&&(Section_86>=1))" & XF!"((Section_11>=1)&&(F12>=1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-21 09:40:38] [INFO ] Flatten gal took : 4 ms
[2024-05-21 09:40:38] [INFO ] Applying decomposition
[2024-05-21 09:40:38] [INFO ] Flatten gal took : 4 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/graph16614480464939362115.txt' '-o' '/tmp/graph16614480464939362115.bin' '-w' '/tmp/graph16614480464939362115.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16614480464939362115.bin' '-l' '-1' '-v' '-w' '/tmp/graph16614480464939362115.weights' '-q' '0' '-e' '0.001'
[2024-05-21 09:40:38] [INFO ] Decomposing Gal with order
[2024-05-21 09:40:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 09:40:38] [INFO ] Flatten gal took : 6 ms
[2024-05-21 09:40:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 09:40:38] [INFO ] Time to serialize gal into /tmp/LTL6625190582764753094.gal : 2 ms
[2024-05-21 09:40:38] [INFO ] Time to serialize properties into /tmp/LTL10775016256808234449.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/LTL6625190582764753094.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10775016256808234449.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 : !(((F("((i1.u3.F87>=1)&&(i1.u4.Section_86>=1))"))||(X(G("((i0.u19.Section_11>=1)&&(i3.u28.F12>=1))")))))
Formula 0 simplified : G!"((i1.u3.F87>=1)&&(i1.u4.Section_86>=1))" & XF!"((i0.u19.Section_11>=1)&&(i3.u28.F12>=1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-096-LTLFireability-15 finished in 95000 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(p2)&&p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(((X(p0)||F(!p1)) U (G((X(p0)||F(!p1)))||(!p2&&(X(p0)||F(!p1)))))))||(!p2&&F(((X(p0)||F(!p1)) U (G((X(p0)||F(!p1)))||(!p2&&(X(p0)||F(!p1))))))))))'
Found a Shortening insensitive property : CircularTrains-PT-096-LTLFireability-09
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), false]
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 168 transition count 78
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 150 transition count 78
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 36 place count 150 transition count 73
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 46 place count 145 transition count 73
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 58 place count 139 transition count 67
Applied a total of 58 rules in 13 ms. Remains 139 /168 variables (removed 29) and now considering 67/96 (removed 29) transitions.
// Phase 1: matrix 67 rows 139 cols
[2024-05-21 09:40:54] [INFO ] Computed 73 invariants in 2 ms
[2024-05-21 09:40:54] [INFO ] Implicit Places using invariants in 85 ms returned [2, 120, 122, 124, 130, 135, 136]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 86 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 132/168 places, 67/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 132 transition count 66
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 131 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 130 transition count 65
Applied a total of 4 rules in 3 ms. Remains 130 /132 variables (removed 2) and now considering 65/67 (removed 2) transitions.
// Phase 1: matrix 65 rows 130 cols
[2024-05-21 09:40:54] [INFO ] Computed 66 invariants in 1 ms
[2024-05-21 09:40:54] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 09:40:54] [INFO ] Invariant cache hit.
[2024-05-21 09:40:54] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 130/168 places, 65/96 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 259 ms. Remains : 130/168 places, 65/96 transitions.
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-09
Product exploration explored 100000 steps with 6282 reset in 404 ms.
Product exploration explored 100000 steps with 6398 reset in 442 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 p2 (NOT p1) p0), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND p2 p1 (NOT p0)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p1 p0))), (X (X (NOT (AND p2 p1 p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 493 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), false]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (8 resets) in 234 ms. (170 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
[2024-05-21 09:40:55] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
After SMT solving in domain Real declared 4/195 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 17 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, Generalized P Invariants (flows): 0/3 constraints, State Equation: 0/130 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 24ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND p2 p1 (NOT p0))))), (G (OR (NOT p1) p0 (NOT p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p1 p0))), (X (X (NOT (AND p2 p1 p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p1) p0))), (F p1), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 918 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 65/65 transitions.
Applied a total of 0 rules in 1 ms. Remains 130 /130 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-21 09:40:57] [INFO ] Invariant cache hit.
[2024-05-21 09:40:57] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 09:40:57] [INFO ] Invariant cache hit.
[2024-05-21 09:40:57] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 33 sub problems to find dead transitions.
[2024-05-21 09:40:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 63/129 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 196 constraints, problems are : Problem set: 0 solved, 33 unsolved in 677 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 63/129 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 33/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 229 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1596 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 2278ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 2278ms
Finished structural reductions in LTL mode , in 1 iterations and 2458 ms. Remains : 130/130 places, 65/65 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 p2 (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X p0)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 418 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 141 steps (0 resets) in 7 ms. (17 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X p0)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 3 factoid took 535 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 6372 reset in 401 ms.
Product exploration explored 100000 steps with 6518 reset in 431 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 65/65 transitions.
Applied a total of 0 rules in 2 ms. Remains 130 /130 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-21 09:41:01] [INFO ] Redundant transitions in 0 ms returned []
Running 33 sub problems to find dead transitions.
[2024-05-21 09:41:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 63/129 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 196 constraints, problems are : Problem set: 0 solved, 33 unsolved in 679 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 63/129 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 33/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 229 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1588 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 2273ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 2273ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2280 ms. Remains : 130/130 places, 65/65 transitions.
Built C files in :
/tmp/ltsmin16549435472074038772
[2024-05-21 09:41:04] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16549435472074038772
Running compilation step : cd /tmp/ltsmin16549435472074038772;'/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 191 ms.
Running link step : cd /tmp/ltsmin16549435472074038772;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16549435472074038772;'/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/stateBased3593775217866402717.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 65/65 transitions.
Applied a total of 0 rules in 2 ms. Remains 130 /130 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-21 09:41:19] [INFO ] Invariant cache hit.
[2024-05-21 09:41:19] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-21 09:41:19] [INFO ] Invariant cache hit.
[2024-05-21 09:41:19] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 33 sub problems to find dead transitions.
[2024-05-21 09:41:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 63/129 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 196 constraints, problems are : Problem set: 0 solved, 33 unsolved in 683 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 63/129 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 33/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 229 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1603 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 2291ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 2293ms
Finished structural reductions in LTL mode , in 1 iterations and 2485 ms. Remains : 130/130 places, 65/65 transitions.
Built C files in :
/tmp/ltsmin13773654105853441179
[2024-05-21 09:41:21] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13773654105853441179
Running compilation step : cd /tmp/ltsmin13773654105853441179;'/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 192 ms.
Running link step : cd /tmp/ltsmin13773654105853441179;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin13773654105853441179;'/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/stateBased9694354490668629389.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 09:41:36] [INFO ] Flatten gal took : 5 ms
[2024-05-21 09:41:36] [INFO ] Flatten gal took : 3 ms
[2024-05-21 09:41:36] [INFO ] Time to serialize gal into /tmp/LTL9890288097376055114.gal : 1 ms
[2024-05-21 09:41:36] [INFO ] Time to serialize properties into /tmp/LTL11263518552791094405.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/LTL9890288097376055114.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14740332484065839685.hoa' '-atoms' '/tmp/LTL11263518552791094405.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/LTL11263518552791094405.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14740332484065839685.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-21 09:41:51] [INFO ] Flatten gal took : 2 ms
[2024-05-21 09:41:51] [INFO ] Flatten gal took : 3 ms
[2024-05-21 09:41:51] [INFO ] Time to serialize gal into /tmp/LTL18356851904380986572.gal : 1 ms
[2024-05-21 09:41:51] [INFO ] Time to serialize properties into /tmp/LTL3373601322004462678.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/LTL18356851904380986572.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3373601322004462678.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 : !((F((G(F(((X("(((Section_48>=1)&&(F49>=1))||(!((F14>=1)&&(Section_13>=1))))"))||(F(!("((F14>=1)&&(Section_13>=1))"))))U((G((X("(((Sec...823
Formula 0 simplified : G(FG("((Section_48>=1)&&(F49>=1))" U (X!"(((Section_48>=1)&&(F49>=1))||(!((F14>=1)&&(Section_13>=1))))" & G"((F14>=1)&&(Section_13>=...333
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-21 09:42:06] [INFO ] Flatten gal took : 8 ms
[2024-05-21 09:42:06] [INFO ] Applying decomposition
[2024-05-21 09:42:06] [INFO ] Flatten gal took : 3 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/graph12119115274677369840.txt' '-o' '/tmp/graph12119115274677369840.bin' '-w' '/tmp/graph12119115274677369840.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12119115274677369840.bin' '-l' '-1' '-v' '-w' '/tmp/graph12119115274677369840.weights' '-q' '0' '-e' '0.001'
[2024-05-21 09:42:06] [INFO ] Decomposing Gal with order
[2024-05-21 09:42:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 09:42:06] [INFO ] Flatten gal took : 5 ms
[2024-05-21 09:42:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 09:42:06] [INFO ] Time to serialize gal into /tmp/LTL15055709695490066632.gal : 2 ms
[2024-05-21 09:42:06] [INFO ] Time to serialize properties into /tmp/LTL15190551777040296642.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/LTL15055709695490066632.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15190551777040296642.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...256
Read 1 LTL properties
Checking formula 0 : !((F((G(F(((X("(((i8.u42.Section_48>=1)&&(i8.u18.F49>=1))||(!((i6.u53.F14>=1)&&(i6.u53.Section_13>=1))))"))||(F(!("((i6.u53.F14>=1)&&(...1117
Formula 0 simplified : G(FG("((i8.u42.Section_48>=1)&&(i8.u18.F49>=1))" U (X!"(((i8.u42.Section_48>=1)&&(i8.u18.F49>=1))||(!((i6.u53.F14>=1)&&(i6.u53.Secti...459
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-096-LTLFireability-09 finished in 88239 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(X(((G(p0) U p1)||F(p2)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Found a Lengthening insensitive property : CircularTrains-PT-096-LTLFireability-15
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 168 transition count 80
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 152 transition count 80
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 32 place count 152 transition count 72
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 48 place count 144 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 60 place count 138 transition count 66
Applied a total of 60 rules in 6 ms. Remains 138 /168 variables (removed 30) and now considering 66/96 (removed 30) transitions.
// Phase 1: matrix 66 rows 138 cols
[2024-05-21 09:42:22] [INFO ] Computed 73 invariants in 1 ms
[2024-05-21 09:42:22] [INFO ] Implicit Places using invariants in 77 ms returned [2, 23, 119, 121, 123, 129, 134, 135]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 78 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 130/168 places, 66/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 130 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 129 transition count 65
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 129 transition count 64
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 128 transition count 64
Applied a total of 4 rules in 3 ms. Remains 128 /130 variables (removed 2) and now considering 64/66 (removed 2) transitions.
// Phase 1: matrix 64 rows 128 cols
[2024-05-21 09:42:22] [INFO ] Computed 65 invariants in 1 ms
[2024-05-21 09:42:22] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 09:42:22] [INFO ] Invariant cache hit.
[2024-05-21 09:42:22] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 128/168 places, 64/96 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 241 ms. Remains : 128/168 places, 64/96 transitions.
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-15
Product exploration explored 100000 steps with 2844 reset in 364 ms.
Product exploration explored 100000 steps with 2901 reset in 399 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 (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 262 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 98 steps (0 resets) in 6 ms. (14 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F p0)]
Knowledge based reduction with 5 factoid took 300 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-21 09:42:24] [INFO ] Invariant cache hit.
[2024-05-21 09:42:24] [INFO ] [Real]Absence check using 63 positive place invariants in 8 ms returned sat
[2024-05-21 09:42:24] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-21 09:42:24] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2024-05-21 09:42:24] [INFO ] Computed and/alt/rep : 32/64/32 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-21 09:42:24] [INFO ] Added : 30 causal constraints over 6 iterations in 75 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 128 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-21 09:42:24] [INFO ] Invariant cache hit.
[2024-05-21 09:42:24] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 09:42:24] [INFO ] Invariant cache hit.
[2024-05-21 09:42:24] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 32 sub problems to find dead transitions.
[2024-05-21 09:42:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 606 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1434 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 2048ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2048ms
Finished structural reductions in LTL mode , in 1 iterations and 2203 ms. Remains : 128/128 places, 64/64 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 108 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 152 steps (0 resets) in 5 ms. (25 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 124 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-21 09:42:27] [INFO ] Invariant cache hit.
[2024-05-21 09:42:27] [INFO ] [Real]Absence check using 63 positive place invariants in 8 ms returned sat
[2024-05-21 09:42:27] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-21 09:42:27] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-21 09:42:27] [INFO ] Computed and/alt/rep : 32/64/32 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-21 09:42:27] [INFO ] Added : 30 causal constraints over 6 iterations in 80 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2928 reset in 369 ms.
Product exploration explored 100000 steps with 2904 reset in 403 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-21 09:42:28] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2024-05-21 09:42:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 644 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1445 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 2093ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2094ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2101 ms. Remains : 128/128 places, 64/64 transitions.
Built C files in :
/tmp/ltsmin5549115058907723779
[2024-05-21 09:42:30] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5549115058907723779
Running compilation step : cd /tmp/ltsmin5549115058907723779;'/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 175 ms.
Running link step : cd /tmp/ltsmin5549115058907723779;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin5549115058907723779;'/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/stateBased786450315850492769.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-21 09:42:45] [INFO ] Invariant cache hit.
[2024-05-21 09:42:45] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 09:42:45] [INFO ] Invariant cache hit.
[2024-05-21 09:42:46] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 32 sub problems to find dead transitions.
[2024-05-21 09:42:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 648 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1429 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 2080ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2081ms
Finished structural reductions in LTL mode , in 1 iterations and 2248 ms. Remains : 128/128 places, 64/64 transitions.
Built C files in :
/tmp/ltsmin15387756689970454227
[2024-05-21 09:42:48] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15387756689970454227
Running compilation step : cd /tmp/ltsmin15387756689970454227;'/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 184 ms.
Running link step : cd /tmp/ltsmin15387756689970454227;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin15387756689970454227;'/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/stateBased8341212720389109823.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 09:43:03] [INFO ] Flatten gal took : 4 ms
[2024-05-21 09:43:03] [INFO ] Flatten gal took : 2 ms
[2024-05-21 09:43:03] [INFO ] Time to serialize gal into /tmp/LTL946503220186338685.gal : 1 ms
[2024-05-21 09:43:03] [INFO ] Time to serialize properties into /tmp/LTL17849711199405164206.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/LTL946503220186338685.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14046091761755807949.hoa' '-atoms' '/tmp/LTL17849711199405164206.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...318
Loading property file /tmp/LTL17849711199405164206.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14046091761755807949.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-21 09:43:18] [INFO ] Flatten gal took : 2 ms
[2024-05-21 09:43:18] [INFO ] Flatten gal took : 2 ms
[2024-05-21 09:43:18] [INFO ] Time to serialize gal into /tmp/LTL5661826360386854092.gal : 1 ms
[2024-05-21 09:43:18] [INFO ] Time to serialize properties into /tmp/LTL14685610938123112456.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/LTL5661826360386854092.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14685610938123112456.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 : !(((F("((F87>=1)&&(Section_86>=1))"))||(X(G("((Section_11>=1)&&(F12>=1))")))))
Formula 0 simplified : G!"((F87>=1)&&(Section_86>=1))" & XF!"((Section_11>=1)&&(F12>=1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-21 09:43:33] [INFO ] Flatten gal took : 2 ms
[2024-05-21 09:43:33] [INFO ] Applying decomposition
[2024-05-21 09:43:33] [INFO ] Flatten gal took : 3 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/graph17044874891971179532.txt' '-o' '/tmp/graph17044874891971179532.bin' '-w' '/tmp/graph17044874891971179532.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17044874891971179532.bin' '-l' '-1' '-v' '-w' '/tmp/graph17044874891971179532.weights' '-q' '0' '-e' '0.001'
[2024-05-21 09:43:33] [INFO ] Decomposing Gal with order
[2024-05-21 09:43:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 09:43:33] [INFO ] Flatten gal took : 5 ms
[2024-05-21 09:43:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 09:43:33] [INFO ] Time to serialize gal into /tmp/LTL12522696806803371838.gal : 1 ms
[2024-05-21 09:43:33] [INFO ] Time to serialize properties into /tmp/LTL14862691011122928210.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/LTL12522696806803371838.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14862691011122928210.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...256
Read 1 LTL properties
Checking formula 0 : !(((F("((i10.i1.u2.F87>=1)&&(i1.i0.u29.Section_86>=1))"))||(X(G("((i9.i0.u46.Section_11>=1)&&(i9.i2.u36.F12>=1))")))))
Formula 0 simplified : G!"((i10.i1.u2.F87>=1)&&(i1.i0.u29.Section_86>=1))" & XF!"((i9.i0.u46.Section_11>=1)&&(i9.i2.u36.F12>=1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-096-LTLFireability-15 finished in 86326 ms.
[2024-05-21 09:43:48] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15858396224126134916
[2024-05-21 09:43:48] [INFO ] Applying decomposition
[2024-05-21 09:43:48] [INFO ] Computing symmetric may disable matrix : 96 transitions.
[2024-05-21 09:43:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:43:48] [INFO ] Computing symmetric may enable matrix : 96 transitions.
[2024-05-21 09:43:48] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:43:48] [INFO ] Flatten gal took : 3 ms
[2024-05-21 09:43:48] [INFO ] Computing Do-Not-Accords matrix : 96 transitions.
[2024-05-21 09:43:48] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:43:48] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15858396224126134916
Running compilation step : cd /tmp/ltsmin15858396224126134916;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '144' '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'
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/graph17948847338946742808.txt' '-o' '/tmp/graph17948847338946742808.bin' '-w' '/tmp/graph17948847338946742808.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17948847338946742808.bin' '-l' '-1' '-v' '-w' '/tmp/graph17948847338946742808.weights' '-q' '0' '-e' '0.001'
[2024-05-21 09:43:48] [INFO ] Decomposing Gal with order
[2024-05-21 09:43:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 09:43:48] [INFO ] Flatten gal took : 5 ms
[2024-05-21 09:43:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 09:43:48] [INFO ] Time to serialize gal into /tmp/LTLFireability16808184483774152303.gal : 1 ms
[2024-05-21 09:43:48] [INFO ] Time to serialize properties into /tmp/LTLFireability5866951710812234078.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/LTLFireability16808184483774152303.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5866951710812234078.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...277
Read 5 LTL properties
Checking formula 0 : !((X((F("((i7.i0.u9.Section_11>=1)&&(i7.i1.u18.F12>=1))"))||(("((i7.i0.u22.Section_10>=1)&&(i7.i0.u9.F11>=1))")&&(F("((i4.u7.Section_7...184
Formula 0 simplified : X(G!"((i7.i0.u9.Section_11>=1)&&(i7.i1.u18.F12>=1))" & (!"((i7.i0.u22.Section_10>=1)&&(i7.i0.u9.F11>=1))" | G!"((i4.u7.Section_70>=1...176
Compilation finished in 248 ms.
Running link step : cd /tmp/ltsmin15858396224126134916;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin15858396224126134916;'/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' 'X((<>((LTLAPp0==true))||(<>((LTLAPp2==true))&&(LTLAPp1==true))))' '--buchi-type=spotba'
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin15858396224126134916;'/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' 'X((<>((LTLAPp0==true))||(<>((LTLAPp2==true))&&(LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15858396224126134916;'/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' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.021: Initializing POR dependencies: labels 106, guards 96
pins2lts-mc-linux64( 4/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.034: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.034: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.038: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.038: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.074: LTL layer: formula: [](<>((LTLAPp3==true)))
pins2lts-mc-linux64( 3/ 8), 0.074: "[](<>((LTLAPp3==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.074: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.105: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.108: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.129: There are 108 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.129: State length is 169, there are 99 groups
pins2lts-mc-linux64( 0/ 8), 0.129: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.129: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.129: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.129: Visible groups: 0 / 99, labels: 1 / 108
pins2lts-mc-linux64( 0/ 8), 0.129: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.129: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.143: [Blue] ~120 levels ~960 states ~960 transitions
pins2lts-mc-linux64( 1/ 8), 0.153: [Blue] ~240 levels ~1920 states ~1920 transitions
pins2lts-mc-linux64( 5/ 8), 0.152: [Blue] ~240 levels ~3840 states ~1920 transitions
pins2lts-mc-linux64( 2/ 8), 0.199: [Blue] ~954 levels ~7680 states ~8408 transitions
pins2lts-mc-linux64( 5/ 8), 0.268: [Blue] ~1372 levels ~15360 states ~19800 transitions
pins2lts-mc-linux64( 1/ 8), 0.389: [Blue] ~3086 levels ~30720 states ~44472 transitions
pins2lts-mc-linux64( 1/ 8), 0.643: [Blue] ~5397 levels ~61440 states ~91384 transitions
pins2lts-mc-linux64( 0/ 8), 1.089: [Blue] ~10890 levels ~122880 states ~160216 transitions
pins2lts-mc-linux64( 1/ 8), 1.799: [Blue] ~19161 levels ~245760 states ~370184 transitions
pins2lts-mc-linux64( 7/ 8), 2.859: [Blue] ~35322 levels ~491520 states ~689016 transitions
pins2lts-mc-linux64( 5/ 8), 4.552: [Blue] ~57012 levels ~983040 states ~1433648 transitions
pins2lts-mc-linux64( 1/ 8), 7.194: [Blue] ~146373 levels ~1966080 states ~2903336 transitions
pins2lts-mc-linux64( 1/ 8), 12.422: [Blue] ~292040 levels ~3932160 states ~5765056 transitions
pins2lts-mc-linux64( 1/ 8), 23.276: [Blue] ~552652 levels ~7864320 states ~11396680 transitions
pins2lts-mc-linux64( 1/ 8), 46.333: [Blue] ~980147 levels ~15728640 states ~22630352 transitions
pins2lts-mc-linux64( 7/ 8), 88.363: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 88.445:
pins2lts-mc-linux64( 0/ 8), 88.445: Explored 27523474 states 37851446 transitions, fanout: 1.375
pins2lts-mc-linux64( 0/ 8), 88.445: Total exploration time 88.300 sec (88.240 sec minimum, 88.260 sec on average)
pins2lts-mc-linux64( 0/ 8), 88.445: States per second: 311704, Transitions per second: 428669
pins2lts-mc-linux64( 0/ 8), 88.445:
pins2lts-mc-linux64( 0/ 8), 88.445: State space has 26204123 states, 8362147 are accepting
pins2lts-mc-linux64( 0/ 8), 88.445: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 88.445: blue states: 27523474 (105.03%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 88.445: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 88.445: all-red states: 8362147 (31.91%), bogus 1518 (0.01%)
pins2lts-mc-linux64( 0/ 8), 88.445:
pins2lts-mc-linux64( 0/ 8), 88.445: Total memory used for local state coloring: 151.1MB
pins2lts-mc-linux64( 0/ 8), 88.445:
pins2lts-mc-linux64( 0/ 8), 88.445: Queue width: 8B, total height: 9901986, memory: 75.55MB
pins2lts-mc-linux64( 0/ 8), 88.445: Tree memory: 455.9MB, 18.2 B/state, compr.: 2.7%
pins2lts-mc-linux64( 0/ 8), 88.445: Tree fill ratio (roots/leafs): 19.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 88.445: Stored 96 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 88.445: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 88.445: Est. total memory use: 531.5MB (~1099.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15858396224126134916;'/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' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15858396224126134916;'/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' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
Detected timeout of ITS tools.
[2024-05-21 10:07:41] [INFO ] Flatten gal took : 5 ms
[2024-05-21 10:07:41] [INFO ] Time to serialize gal into /tmp/LTLFireability18106187591840863204.gal : 1 ms
[2024-05-21 10:07:41] [INFO ] Time to serialize properties into /tmp/LTLFireability10346337993700911865.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/LTLFireability18106187591840863204.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10346337993700911865.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...299
Read 5 LTL properties
Checking formula 0 : !((X((F("((Section_11>=1)&&(F12>=1))"))||(("((Section_10>=1)&&(F11>=1))")&&(F("((Section_70>=1)&&(F71>=1))"))))))
Formula 0 simplified : X(G!"((Section_11>=1)&&(F12>=1))" & (!"((Section_10>=1)&&(F11>=1))" | G!"((Section_70>=1)&&(F71>=1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
36175 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,361.772,2691420,1,0,2014,1.59728e+07,19,538,2302,1.98387e+07,5017
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CircularTrains-PT-096-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G(F("((Section_48>=1)&&(F49>=1))"))))
Formula 1 simplified : FG!"((Section_48>=1)&&(F49>=1))"
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
9234 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,454.106,2959592,1,0,2638,1.88094e+07,14,538,2292,1.98387e+07,5893
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA CircularTrains-PT-096-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((F((G(F(((X("(((Section_48>=1)&&(F49>=1))||(!((F14>=1)&&(Section_13>=1))))"))||(F(!("((F14>=1)&&(Section_13>=1))"))))U((G((X("(((Sec...828
Formula 2 simplified : G(FG("((Section_48>=1)&&(F49>=1))" U (X!"(((Section_48>=1)&&(F49>=1))||(!((F14>=1)&&(Section_13>=1))))" & G"((F14>=1)&&(Section_13>=...334
Detected timeout of ITS tools.
[2024-05-21 10:31:34] [INFO ] Flatten gal took : 4 ms
[2024-05-21 10:31:34] [INFO ] Input system was already deterministic with 96 transitions.
[2024-05-21 10:31:34] [INFO ] Transformed 168 places.
[2024-05-21 10:31:34] [INFO ] Transformed 96 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 10:31:34] [INFO ] Time to serialize gal into /tmp/LTLFireability10034319142079825884.gal : 1 ms
[2024-05-21 10:31:34] [INFO ] Time to serialize properties into /tmp/LTLFireability14342902575403178562.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/LTLFireability10034319142079825884.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14342902575403178562.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...344
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((G(F(((X("(((Section_48>=1)&&(F49>=1))||(!((F14>=1)&&(Section_13>=1))))"))||(F(!("((F14>=1)&&(Section_13>=1))"))))U((G((X("(((Sec...828
Formula 0 simplified : G(FG("((Section_48>=1)&&(F49>=1))" U (X!"(((Section_48>=1)&&(F49>=1))||(!((F14>=1)&&(Section_13>=1))))" & G"((F14>=1)&&(Section_13>=...334
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
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="CircularTrains-PT-096"
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 CircularTrains-PT-096, 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 r070-tall-171620505700348"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CircularTrains-PT-096.tgz
mv CircularTrains-PT-096 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 ;